public MinMaxAlphaBeta(int max, IHeuristicFunction heuristicFunction)
{
_heuristicFunction = heuristicFunction;
if (max == 0)
_max = 1;
_max = (max * 2) - 1;
}
public SearchProblem(IGoalTest <S> goalTest, IStepCostFunction <A, S, C> stepCost, ISuccessorFunction <A, S> successor, IHeuristicFunction <S, C> heuristicFn)
{
this.goalTest = goalTest;
this.stepCost = stepCost;
this.successorFn = successor;
this.heuristicFn = heuristicFn;
}
public MinMax(int max)
{
_heuristicFunction = new HeuristicFunctionDescnedent();
if (max == 0)
_max = 1;
_max = (max * 2) - 1;
}
public MinMax(int max)
{
_heuristicFunction = new HeuristicFunctionDescnedent();
if (max == 0)
{
_max = 1;
}
_max = (max * 2) - 1;
}
public MinMaxAlphaBeta(int max, IHeuristicFunction heuristicFunction)
{
_heuristicFunction = heuristicFunction;
if (max == 0)
{
_max = 1;
}
_max = (max * 2) - 1;
}
public MinMaxAlphaBetaWithOpen(int max, IHeuristicFunction heuristicFunction)
: base(max, heuristicFunction)
{
}
public HillClimbingSearch(IHeuristicFunction hf)
{
this.hf = hf;
}
public GreedyBestFirstEvaluationFunction(IHeuristicFunction hf)
{
this.hf = hf;
}
public LRTAStarAgent(OnlineSearchProblem problem, IPerceptToStateFunction ptsFunction, IHeuristicFunction hf)
{
this.Problem = problem;
this.PerceptToStateFunction = ptsFunction;
this.HeuristicFunction = hf;
}
public SimulatedAnnealingSearch(IHeuristicFunction hf)
{
this.hf = hf;
this.scheduler = new Scheduler();
}
public SimulatedAnnealingSearch(IHeuristicFunction hf, Scheduler scheduler)
{
this.hf = hf;
this.scheduler = scheduler;
}
public AStarSearch(IHeuristicFunction <TProblemState> heuristicFunction)
{
_heuristicFunction = heuristicFunction;
}
public AStarSearch( Problem problem, IHeuristicFunction heuristic )
{
this.m_problem = problem;
this.m_heuristic = heuristic;
}
public RecursiveBestFirstSearch(IHeuristicFunction heuristicFn)
{
_heuristicFn = heuristicFn ?? throw new ArgumentNullException(nameof(heuristicFn));
}
public AStarSearch(QueueSearch search, IHeuristicFunction hf) : base(search, new AStarEvaluationFunction(hf))
{
}
public MinMaxAlphaBetaWithOpen(int max, IHeuristicFunction heuristicFunction)
: base(max, heuristicFunction)
{
}
public RecursiveBestFirstSearch(IHeuristicFunction <TProblemState> heuristicFunction)
{
_heuristicFunction = heuristicFunction;
}
/// <summary>
/// Initializes a new instance of the <see cref="HeuristicSearch"/> class.
/// </summary>
public HeuristicSearch()
{
_queue = new PriorityQueue <double, Node>();
this.Heuristic = new Heuristic();
}
public GreedyBestFirstSearch(QueueSearch search, IHeuristicFunction hf) : base(search, new GreedyBestFirstEvaluationFunction(hf))
{
}
public AStarEvaluationFunction(IHeuristicFunction hf)
{
this.hf = hf;
}