A Memory-Efficient Method for Fast Computation of Short 15-Puzzle Solutions Ian Parberry Technical Report LARCLaboratory for Recreational Computing Department of Computer Science - Eternity II puzzle - 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

	MAKING CONNECTIONS by Mark Halpin Fifteen unclued entries span this puzzle’s grid. These are divided into five sets of three entries each, labeled for reference only with otherwise meaningless letters. Within each set, DocID: 1u3rM - View Document
	Brain Burn A Solitary Confinement game for the piecepack by Mark A. Biggar Version 1.1, July 2004 Copyright © 2003, 2004 Mark A. Biggar 1 player - 20 min DocID: 1fs1h - View Document
	Non-optimal Multi-Agent Pathfinding is Solved (SinceGabriele R¨oger and Malte Helmert University of Basel, Switzerland {gabriele.roeger,malte.helmert}@unibas.ch Abstract DocID: 18j94 - View Document
	Solving the (𝒏𝟐 − 𝟏)-Puzzle in Real Time with 𝟖𝟑𝒏𝟑 Expected Moves Ian Parberry Technical Report LARCLaboratory for Recreational Computing DocID: 18cTY - View Document
	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 DocID: 18a4W - View Document