八数码问题

来源：百度知道 编辑：UC知道 时间：2024/04/30 04:17:34
初状态 0 1 2
3 4 5
6 7 8
末状态 8 7 6
5 4 3
2 1 0
0表示空格，问最少要几步，可由初到末？ 要步骤！！

012...312...312...312...312...312...310...301
345->045->645->645->645->640->642->642
678...678...078...708...780...785...780...785

031...631...631...631...631...631...630...603
642->042->742->742->742->740->741->741
785...785...085...805...850...852...852...852

063...763...763...763...763...763...760...706
741->041->841->841->841->840->843->843
852...852...052...502...520...521...521...521

076...876...876...876...876
843->043->543->543->543
521...521...021...201...210
共28步
请注意回答时间···

program num8_str1；
uses Crt；
type a33：array[1..3，1..3] Of byte；
{3X3的二维数组，用于存放棋盘布局}
a4=array[1..4] of shortint;