This paper is therefore limited to comparing the implementations of the popular AI algorithms, namely Breadth First Search, Depth First Search, A*, Best First Search and Hill climbing algorithms for solving a sliding n-puzzle in an attempt to look at the better efficient of the algorithms for this case.
There are 5 different search algorithms that are explored in this paper, namely the Breadth First Search, Depth First Search, A*, Best First Search and Hill Climbing.
The Breadth First Search is an uninformed type algorithm, so it does not start will full knowledge of the entire State Space.
Other than that, it operates over a Breadth First Search's motion of expansion.
* Breadth First Search: More complete and concise uninformed technique that manages to find the best solution using minimal computation but suffers from intensive memory use.
Breadth first search's initial state is an empty board.
In the diagram for Breadth first search (figure 4), there are three examples given ach with a different initial queen.