Searching Algorithms

Enter the numbers for initial and goal states in the Starting and Desired State tables, respectively (Enter nothing for the empty position).

Starting State:
Desired State:

Depth First Search
Breadth First Search
Best First Search (Number of Tiles Out Of Place)
Best First Search (Minimum Number of Moves To Reach The Goal State)
Best First Search (H Function : totdist + 3 * seq)
Maximum Iterations:

Total Nodes Generated:
Solution Steps:
Visited States: