八数码问题

还没做完

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
/*
const int SIZE = 1000000;
const int N = 9;*/
#define SIZE 5000000
#define N 9

typedef int Node[N];
Node st[SIZE], goal;
int dist[SIZE];

char da[SIZE][N+1];
int da_k = 0;


const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};

int compare_char (const void *a, const void *b) {  
	return strcmp((char *)a,(char *)b);  
} 

int bfs () {
	int i;
	int front = 0, rear = 1;	//左闭区，右开
	dist[front] = 0;
	
	char string[N+1];
	for(i = 0; i < N; i ++){
		string[i] = st[front][i] + '0';
	}string[i] = 0;
//	printf("%s %d ",string, da_k);
	
	memcpy(da[da_k++], string, sizeof(da[0]));
	qsort(da, da_k, sizeof(da[0]), compare_char);
	
	while(front < rear){
		if(memcmp(goal, st[front], sizeof(st[front])) == 0)
			return front;
		int z;
		for(z = 0; z < N; z ++){
			if(!st[front][z])
				break;
		}
		int x = z / 3;
		int y = z % 3;
		int d;
		for(d = 0; d < 4; d ++){//printf("*");
			int newx = x + dx[d];
			int newy = y + dy[d];
			int newz = newx * 3 + newy;
			if(newx >= 0 && newx < 3 && newy >= 0 && newy < 3){
				
				if(rear >= SIZE){
					printf("error1 %d",rear);
					return 0;
				}
				
				memcpy(st[rear], st[front], sizeof(st[front]));
				st[rear][newz] = st[front][z];
				st[rear][z] = st[front][newz];
				dist[rear] = dist[front] + 1;
			
				for(i = 0; i < N; i ++){
			//		printf("%d", st[rear][i]);
					string[i] = st[rear][i] + '0';
				}string[i] = 0;
				
				
			//	printf("%s %d ",string, da_k);
				if((char *)bsearch(string, da, da_k, sizeof(da[0]), compare_char) != NULL)
					continue;
				
				memcpy(da[da_k++], string, sizeof(da[0]));
		//		qsort(da, da_k, sizeof(da[0]), compare_char);
				rear ++;
			}
		}
		front ++;
	} 
	printf("error2 %d\n", front);
	return 0;
}

int main () {
	
	int i;
	char c1[N], c2[N];
/*	scanf("%s %s", c1, c2);

	for(i = 0; i < N; i ++){
		if(c1[i] == '.')
			st[0][i] = 0;
		else
			st[0][i] = c1[i] - 48;
		if(c2[i] == '.')
			goal[i] = 0;
		else
			goal[i] = c2[i] - 48;
	}*/
	

	st[0][0] = 1;	//3
	st[0][1] = 2;
	st[0][2] = 3;
	st[0][3] = 4;
	st[0][4] = 5;
	st[0][5] = 6;
	st[0][6] = 7;
	st[0][7] = 8;
	st[0][8] = 0;
	
	goal[0] = 1;
	goal[1] = 2;
	goal[2] = 3;
	goal[3] = 0;
	goal[4] = 4;
	goal[5] = 6;
	goal[6] = 7;
	goal[7] = 5;
	goal[8] = 8;
	
	st[0][0] = 1;	//13
	st[0][1] = 2;
	st[0][2] = 3;
	st[0][3] = 4;
	st[0][4] = 5;
	st[0][5] = 6;
	st[0][6] = 7;
	st[0][7] = 8;
	st[0][8] = 0;
	
	goal[0] = 1;
	goal[1] = 2;
	goal[2] = 3;
	goal[3] = 5;
	goal[4] = 6;
	goal[5] = 0;
	goal[6] = 7;
	goal[7] = 8;
	goal[8] = 4;
	
/*	st[0][0] = 2;	//31
	st[0][1] = 6;
	st[0][2] = 4;
	st[0][3] = 1;
	st[0][4] = 3;
	st[0][5] = 7;
	st[0][6] = 0;
	st[0][7] = 5;
	st[0][8] = 8;
	
	goal[0] = 8;
	goal[1] = 1;
	goal[2] = 5;
	goal[3] = 7;
	goal[4] = 3;
	goal[5] = 6;
	goal[6] = 4;
	goal[7] = 0;
	goal[8] = 2;*/
	

	int ans = bfs();
	
	if(ans > 0) printf("%d", dist[ans]);
	else printf("-1");
	
	return 0;
}