https://github.com/douglasrizzo/search

Graph search algorithms implemented in order to solve the 8-puzzle
https://github.com/douglasrizzo/search

Last synced: 25 days ago
JSON representation

Graph search algorithms implemented in order to solve the 8-puzzle

• Host: GitHub
• URL: https://github.com/douglasrizzo/search
• Owner: douglasrizzo
• License: gpl-3.0
• Created: 2017-06-26T15:48:50.000Z (over 7 years ago)
• Default Branch: master
• Last Pushed: 2017-08-11T21:08:04.000Z (over 7 years ago)
• Last Synced: 2024-12-17T19:28:45.887Z (about 1 month ago)
• Language: C++
• Size: 385 KB
• Stars: 0
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Graph Search and the 8-puzzle

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](https://github.com/OhadR/8-puzzle). The last two inputs, which are, allegedly, the hardest initial states (they need 31 moves to solve), were taken from [here](http://w01fe.com/blog/2009/01/the-hardest-eight-puzzle-instances-take-31-moves-to-solve/).

    8 6 7 2 5 4 3 0 1

    6 4 7 8 5 0 3 2 1