Puzzle8 solver using informed and uninformed searches. Uses A* with various heuristics as well as depth first, breadth first and greedy (hill climbing).
Part of the assignment also required to apply search strategies for path finding in a bidirected graph, those have been included as well.