scientific article; zbMATH DE number 1529463

MaRDI QIDQ4515633zbMATH OpenFDO

Authors Filip R. W. Karlemo, Patric R. J. Östergård

Publication date 30 March 2001

zbMATH Keywords

15-puzzle24-puzzledistancegraph

Mathematics Subject Classification ID

Recreational mathematics (00A08) Distance in graphs (05C12) Extremal problems in graph theory (05C35)

Recommendations

• A simple proof that the \((n^{2} - 1)\)-puzzle is hard
• The \((n^ 2-1)\)-puzzle and related relocation problems
• A Modern Treatment of the 15 Puzzle
• Sliding puzzles and rotating puzzles on graphs
• On God's number(s) for Rubik's slide

Cited in

(10)

• Sliding piece puzzles with oriented tiles
• Solving the \((n^2-1)\)-puzzle with \(\frac{8}{3}n^3\) expected moves
• Inglenook shunting puzzles
• Ice sliding games
• Discrete configuration spaces of squares and hexagons
• The kissing problem: how to end a gathering when everyone kisses everyone else goodbye
• The 5-puzzle doubly covers the soccer ball
• scientific article; zbMATH DE number 7779759 (Why is no real title available?)
• Additive approximation algorithms for sliding puzzle
• A characterization of achievable patterns of the MN-puzzle problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4515633)