A Memory-Efficient Method for Fast Computation of Short 15-Puzzle Solutions Ian Parberry Technical Report LARCLaboratory for Recreational Computing Department of Computer Science - Combination puzzles - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2014-04-24 15:56:54 Mechanical 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 & Engineering Add to Reading List Source URL: larc.unt.edu Download Document from Source Website File Size: 2,13 MB Share Document on Facebook

	D:/New/Books/Orthoreconstructions/ortho.dvi DocID: 1rtmc - View Document
	1 ΠME Journal, PROBLEM DEPARTMENT AND HAROLD REITER∗ DocID: 1qEos - View Document
	Psychological Science, in press Gesture changes thought by grounding it in action S.L. Beilock & S. Goldin-Meadow Department of Psychology, The University of Chicago DocID: 1pkwy - View Document
	Psychological Science, in press Gesture changes thought by grounding it in action S.L. Beilock & S. Goldin-Meadow Department of Psychology, The University of Chicago DocID: 1pb9K - View Document
	A Brief History of Dissected Maps, the Earliest Jigsaw Puzzles by Joe McAlhany Old World Auctions An eternal classroom staple, the dissected map (or puzzle map) remains the most fun and engaging way for a child to learn DocID: 1oTh5 - View Document