这是一个8

This an 8-puzzle solver. You input the current state of your annoying little 8 puzzle and it ll use the Hillclimbing Algorithm to calculate a list of moves which you can use to solve the puzzle. It is written in C++ with an interactive text mode based interface. Enter numbers 0-8. Keep your pathlength short as you can, and make the number of nodes between 1 and 65536 (on an x86 machine).