(参考)人工智能实验报告

态 int nAutoIncrease; public: Eight(); Eight(int s[][N]); void init();// 初始化 open 和 close int f(state s); int w(int s[N][N]); void sortOpen();// 对 Open 表进行排序 void moveToClosed(state s); //void moveToOpen(state s); void genToOpen(state s); void findZeroPostion(int &x,int &y, state s);// 查找 0 的位置进行上下左右移动 pare(state s); // 当前的状态与目标状态比较 void genNewState(state oldState); void heuristicSearch();// 查找路径 bool IsInOpen(state s); bool IsInClosed(state s); void move(state des,state src); bool IsCanSolve(int s[N][N]); void findPath(); void show(state s); }; Eight::Eight() { start[0][0] = 2; start[0][1] = 8; start[0][2] = 3; start[1][0] = 1; start[1][1] = 6; start[1][2] = 4; start[2][0] = 7; start[2][1] = 0; start[2][2] = 5; nAutoIncrease = 1; openIndex = -1; closedIndex = -1; } Eight::Eight(int s[][N])