八数码问题求解实验报告.docxVIP

八数码问题求解实验软件 TC2.0或VC6.0编程语言或其它编程语言实验目的熟悉人工智能系统中的问题求解过程；熟悉状态空间的盲目搜索和启发式搜索算法的应用；熟悉对八数码问题的建模，求解及编程语言的应用。（三）实验内容八数码问题：在3×3的方格棋盘上，摆放着1到8这八个数码，有一个方格是空的，要求对空格执行空格左移，空格右移，空格上移，空格下移这四个操作使得棋盘从初始状态到目标状态。输入初始状态和目标状态，输出从初始状态到目标状态的路径。实验代码 #include stdafx.h#include iostream#include ctime#include vectorusing namespace std;const int ROW = 3;const int COL = 3;const int MAXDISTANCE = 10000;const int MAXNUM = 10000;typedef struct _Node{int digit[ROW][COL];int dist; // distance between one state and the destinationint dep;// the depth of node// So the comment function = dist + dep.int index; // point to the location of parent} Node;Node src, dest;vectorNode node_v; // store the nodesbool isEmptyOfOPEN() {for (int i = 0; i node_v.size(); i++) {if (node_v[i].dist != MAXNUM)return false;}return true;}bool isEqual(int index, int digit[][COL]) {for (int i = 0; i ROW; i++)for (int j = 0; j COL; j++) {if (node_v[index].digit[i][j] != digit[i][j])return false;}return true;}ostream operator(ostream os, Node node) {for (int i = 0; i ROW; i++) {for (int j = 0; j COL; j++)os node.digit[i][j] ;os endl;}return os;}void PrintSteps(int index, vectorNode rstep_v) {rstep_v.push_back(node_v[index]);index = node_v[index].index;while (index != 0) {rstep_v.push_back(node_v[index]);index = node_v[index].index;}for (int i = rstep_v.size() - 1; i = 0; i--)cout Step rstep_v.size() - i endl rstep_v[i] endl;}void Swap(int a, int b) {int t;t = a;a = b;b = t;}void Assign(Node node, int index) {for (int i = 0; i ROW; i++)for (int j = 0; j COL; j++)node.digit[i][j] = node_v[index].digit[i][j];}int GetMinNode() {int dist = MAXNUM;int loc; // the location of minimize nodefor (int i = 0; i node_v.size(); i++) {if (node_v[i].dist == MAXNUM)continue;else if ((node_v[i].dist + node_v[i].dep) dist) {loc = i;dist = node_v[i].dist + node_v[i].dep;}}return loc;}bool isExpandable(Node node) {for (int i = 0; i node_v.size(); i++) {if (isEqual(i, node.digit))return false;}return true;}//扩展int Distance(Node no