Searching algorithm are commonly exploited in the Artificial Intelligence field,
here I present two simple implementations of the well known
algorithms: depth first, breadth first and depth limited for tree search. To
show this two simple game, the 8 puzzle game and a simple grid world
has been used.
This documentation provide a complete description of the steps and
here you can find the source code for the optimized version of the program.