A Modern Treatment of the 15 Puzzle

DOI10.2307/2589612zbMath1007.00006OpenAlexW4241192958WikidataQ56269531 ScholiaQ56269531MaRDI QIDQ2757412

Aaron Archer

Publication date: 26 November 2001

Full work available at URL: https://doi.org/10.2307/2589612

zbMATH Keywords

permutationsalternating group \(A_{15}\)Sam Lloyd's fifteen puzzle

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Recreational mathematics (00A08)

Related Items (13)

A simple proof that the \((n^{2} - 1)\)-puzzle is hard ⋮ Invitation to combinatorial reconfiguration ⋮ A characterization of biconnected graphs reachable by robots jumping over \(m\) obstacles ⋮ Colored pebble motion on graphs ⋮ Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces ⋮ Learning heuristic functions for large state spaces ⋮ Multi-color pebble motion on graphs ⋮ How Do You Fix an Oval Track Puzzle? ⋮ Predicting optimal solution cost with conditional probabilities ⋮ Sliding puzzles and rotating puzzles on graphs ⋮ Pebble exchange group of graphs ⋮ The Fifteen Puzzle—A New Approach ⋮ Pebble exchange on graphs

This page was built for publication: A Modern Treatment of the 15 Puzzle