The 8-tiles project is to study, play and analyze the 8-tiles problem. Currently, it runs in 2 algorithms, Breadth First Search and Depth First Search. Even if you don't like the current implementation of one of algorithms, you can easily modify it, change it, or even implement and your new preferred algorithms using the game elements. Adding new algorithm will cost you changing about 2 or 3 lines besides your own implementation. Not only run the algorithm, but the interface helps you to show the number of nodes explored by the algorithm and the number of steps it takes to solve the game. You can start from a random solvable state or navigate to a state yourself. The interface animates the actions of solving the state and you can change the delay between each action to be able to track, analyze and learn.