Statistical Service

Approximately optimal search on a higher-dimensional sliding puzzle

Abstract Higher-dimensional sliding puzzles are constructed on the vertices of a d -dimensional hypercube, where $$2^d-l$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msup> <mml:mn>2</mml:mn> <mml:mi>d</mml:mi> </mml:msup> <mml:mo>-</mml:mo> <mml:mi>...