Solving the (n^2-1)-puzzle with 83n^3 expected moves

DOI10.3390/A8030459zbMATH Open1461.68090OpenAlexW1935730781MaRDI QIDQ1736675FDOQ1736675

Ian Parberry

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a8030459

Recommendations

• A real-time algorithm for the \((n^{2}-1)\)-puzzle
• The \((n^ 2-1)\)-puzzle and related relocation problems
• A simple proof that the \((n^{2} - 1)\)-puzzle is hard
• scientific article; zbMATH DE number 1529463
• Analysis of the picture cube puzzle

zbMATH Keywords

analysis of algorithmsgreedy algorithmaverage-case analysis15-puzzle\((n^2-1)\)-puzzle8-puzzle

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Combinatorial games (91A46)

Cites Work

• The parallel search bench ZRAM and its applications
• Mersenne twister
• The \((n^ 2-1)\)-puzzle and related relocation problems
• A real-time algorithm for the \((n^{2}-1)\)-puzzle

Cited In (4)

• The \((n^ 2-1)\)-puzzle and related relocation problems
• Introduction to reconfiguration
• On the diameters of friends-and-strangers graphs
• Additive approximation algorithms for sliding puzzle

Uses Software

• ZRAM
• MersenneTwister

This page was built for publication: Solving the \((n^2-1)\)-puzzle with \(\frac{8}{3}n^3\) expected moves

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