Date: 2014-04-24 15:56:54Mechanical puzzles Puzzles Combination puzzles NP-complete problems Fads Fifteen puzzle Eternity II puzzle Greedy algorithm Shortest path problem Mathematics Games Theoretical computer science | | A Memory-Efficient Method for Fast Computation of Short 15-Puzzle Solutions Ian Parberry Technical Report LARCLaboratory for Recreational Computing Department of Computer Science & EngineeringAdd to Reading ListSource URL: larc.unt.eduDownload Document from Source Website File Size: 2,13 MBShare Document on Facebook
|