A characterization of achievable patterns of the MN-puzzle problem

DOI10.1007/BF02945315MaRDI QIDQ758220zbMATH OpenFDO

Authors Hongqing Yang

Publication date 1990

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

zbMATH Keywords

achievable patternsMN-puzzle problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorics in computer science (68R05)

Recommendations

• The \((n^ 2-1)\)-puzzle and related relocation problems
• A simple proof that the \((n^{2} - 1)\)-puzzle is hard
• How to solve the torus puzzle
• scientific article; zbMATH DE number 1529463
• Finding the shortest move-sequence in the graph-generalized 15-puzzle is NP-hard

Cited in

(2)

• A skeleton model to enumerate standard puzzle sequences
• scientific article; zbMATH DE number 5688296 (Why is no real title available?)

This page was built for publication: A characterization of achievable patterns of the MN-puzzle problem

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