有界深度优先搜索算法——八数码问题【人工智能导论习题实现】

//在矩阵的输入中用 0 代替空格
#include<iostream>
#include<stack>
#include<queue>
#define st 0
using namespace std;
int path,num,X,Y,open_len,close_len,tar;
bool Find;
int path_matrix[389113][4][4];
int step[389113];
int Tar[4][4];
queue<int> open;
queue<int> close;
void init(){
	cout<<"please input initial matrix："<<endl;
	for(int i = 1;i <= 3;i++)
	for(int j = 1;j <= 3;j++)
	cin>>path_matrix[st][i][j];
	open.push(st);
	open_len = 1;num++;
	cout<<"please input target matrix: "<<endl;
	for(int i = 1;i <= 3;i++)
	for(int j = 1;j <= 3;j++)
	cin>>Tar[i][j]; 
	Find = false;
}
void space_search(int matrix[4][4]){
	for(int i = 1;i <= 3;i++)
	for(int j = 1;j <= 3;j++){
		if(matrix[i][j] == 0){
			X = i;
			Y = j;
			return;
		}
	}	
}
void copy