public RDFSStrategy(PuzzleNode goalNode)
: base()
{
code = "RDFS";
longName = "Recursive Depth-First Search";
ClosedList = new HashSet<node>();
GoalNode = goalNode;
v = new TreeVisitor();
}
public BFSStrategy(PuzzleNode goalNode)
: base()
{
code = "BFS";
longName = "Breadth-First Search";
Frontier = new Queue<node>();
ClosedList = new HashSet<node>();
GoalNode = goalNode;
v = new TreeVisitor();
}
public AStar(PuzzleNode goalNode)
{
code = "AS";
longName = "A* Search";
longName = "Greedy Best-First Search";
Frontier = new ConcurrentPriorityQueue<node, int>();
ClosedList = new HashSet<node>();
GoalNode = goalNode;
v = new TreeVisitor();
}
