<--- Back to Details
First PageDocument Content
NP-complete problems / Hamiltonian path / Icosahedron / Combination puzzles / Puzzles / Line graph / N-dimensional sequential move puzzle / Graph theory / Theoretical computer science / Mathematics
Date: 2008-10-28 21:28:52
NP-complete problems
Hamiltonian path
Icosahedron
Combination puzzles
Puzzles
Line graph
N-dimensional sequential move puzzle
Graph theory
Theoretical computer science
Mathematics

On Rolling Cube Puzzles Kevin Buchin∗ Martin L. Demaine† Christian Knauer∗ Maike Buchin∗

Add to Reading List

Source URL: cccg.ca

Download Document from Source Website

File Size: 523,15 KB

Share Document on Facebook

Similar Documents

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

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

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

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: 1oMby - View Document

Developmental Checklist for Infants and Toddlers (0 to 2 years of age) If your child has difficulty with three or more criteria listed below, it is recommended that you contact Joan Surfus, OTD, OTR/L, SWC at

Developmental Checklist for Infants and Toddlers (0 to 2 years of age) If your child has difficulty with three or more criteria listed below, it is recommended that you contact Joan Surfus, OTD, OTR/L, SWC at

DocID: 1a3To - 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

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

On Rolling Cube Puzzles Kevin Buchin∗ Martin L. Demaine† Christian Knauer∗  Maike Buchin∗

On Rolling Cube Puzzles Kevin Buchin∗ Martin L. Demaine† Christian Knauer∗ Maike Buchin∗

DocID: 17Uj7 - View Document