Informed search algorithm are usefull when dealing with large state
space, and when ”good” heuristics can be find for the problem. Here we
present two simple an implementation of the well known algorithms: A*.
To show this two simple game, the 8 puzzle game and the dating game has
been used, in the previous we tested 4 different heuristics while the second
has been used to compare simple depth first, A* and IDA*.
This documentation provide a complete description of the steps and
here you can find the source code for the optimized version of the program.