Additive approximation algorithms for sliding puzzle

DOI10.1007/978-3-031-39344-0_10MaRDI QIDQ6535809zbMATH OpenFDO

Authors Zhixian Zhong

Publication date 28 February 2024

Full work available at URL https://doi.org/10.1007/978-3-031-39344-0_10

zbMATH Keywords

approximation algorithmasymptotic analysisGod's numberpotential functionsliding puzzle

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Approximation algorithms (68W25) Analysis of algorithms (68W40) Combinatorial games (91A46)

Recommendations

• Solving the \((n^2-1)\)-puzzle with \(\frac{8}{3}n^3\) expected moves
• A real-time algorithm for the \((n^{2}-1)\)-puzzle
• The \((n^ 2-1)\)-puzzle and related relocation problems
• scientific article; zbMATH DE number 1529463
• A simple proof that the \((n^{2} - 1)\)-puzzle is hard

Cites work

• A real-time algorithm for the \((n^{2}-1)\)-puzzle
• Solving the \((n^2-1)\)-puzzle with \(\frac{8}{3}n^3\) expected moves
• The \((n^ 2-1)\)-puzzle and related relocation problems

This page was built for publication: Additive approximation algorithms for sliding puzzle

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