This repository contains implementations in C++ of graph search algorithms. The are tested by solving different configurations of the 8-puzzle.

The text file with 100 initial states for the 8-puzzle was taken from here. The last two inputs, which are, allegedly, the hardest initial states (they need 31 moves to solve), were taken from here.

8 6 7 2 5 4 3 0 1
6 4 7 8 5 0 3 2 1