Solving the (n2−1)-Puzzle with 83n3 Expected Moves

Algorithms

Ian Parberry¹ 

[1] Department of Computer Science& Engineering, University of North Texas, Denton, TX 76203–5017, USA; E-Mail

关键词: 15-puzzle;    8-puzzle;    analysis of algorithms;    average case analysis;    greedy algorithm;    (n² − 1)-puzzle;   

DOI  :  10.3390/a8030459

来源: mdpi

【 摘 要 】

It is shown that the greedy algorithm for the .

【 授权许可】

CC BY   
© 2015 by the authors; licensee MDPI, Basel, Switzerland.