# 數字推盤遊戲

## 解法

1. 放错的方块的数量，
2. 所有放错的方块到各自目标位置的距离之和。

## 參考文獻

1. ^ COS 226 Programming Assignment 8 Puzzle. [2010-01-30]. （原始内容存档于2021-01-07）.
2. ^ Sam Loyd's Fifteen. [2010-01-30]. （原始内容存档于2021-01-07）.
3. ^ The 15 Puzzle by Jerry Slocum and Dic Sonneveld. [2010-01-30]. （原始内容存档于2021-01-07）.
4. ^ 8 puzzle. [2010-11-11]. （原始内容存档于2020-09-08）.
5. ^ The Eight Puzzle. [2010-01-30]. （原始内容存档于2021-01-07）.
6. ^ 橫刀立馬華容道. [2016-05-18]. （原始内容存档于2021-01-07）.
7. ^ Daniel Ratner; Manfred K. Warmuth. Finding a Shortest Solution for the N × N Extension of the 15-PUZZLE Is Intractable. National Conference on Artificial Intelligence. 1986.
8. ^ Ratner, Daniel; Warmuth, Manfred. The (n2−1)-puzzle and related relocation problems. Journal of Symbolic Computation. 1990, 10 (2): 111–137. doi:10.1016/S0747-7171(08)80001-6.
9. ^ A. Brüngger, A. Marzetta, K. Fukuda and J. Nievergelt, The parallel search bench ZRAM and its applications页面存档备份，存于互联网档案馆）, Annals of Operations Research 90 (1999), pp. 45–63.
10. ^ Stuart Russell; Peter Norving. 人工智能——一种现代方法. 人民邮电出版社. 2010: 84–85. ISBN 978-7-115-23227-4.
11. ^ Beeler, Robert. The Fifteen Puzzle: A Motivating Example for the Alternating Group (PDF). https://faculty.etsu.edu/. East Tennessee State University. [2020-12-26]. （原始内容存档 (PDF)于2021-01-07）.