人工智能中的八数码问题：附有详细的注释

我们可以将八数码问题看成移动空格的问题.在不断的移动空格过程当中不断改变棋盘的布局,使之到达目标状态.

用一个open表(本程序采用序栈)的节点,从中选择一个总体代价最小的节点(不妨设为A节点,栈不为空时)是否是目标状态,如果不是则将A节点的有效的儿子节点(不在open表及closed表中出现过,不违反移动规则)插入有序表open表中,并将A节点插入closed表中.然后重复以上操作.

-Artificial Intelligence 8 digital issues: with detailed annotations, we can be eight issues as the digital mobile space problems. In the continuous process of the mobile space changing the layout of the chessboard to make it reach the target state. With one open Table (This procedure using sequence stack) node, and select an overall cost of the smallest node (may wish to set the A node, when the stack is not empty) it is the target state, if not A node will be the son of an effective node (not open table and closed the table, there were no violations of the mobile rules) into an orderly table open table, and insert the closed node A table. and then repeat the above operation.