暴力枚举
(参照刘汝佳代码)
八数码问题(3*3的矩阵给出初始状态和目标状态,矩阵有一个空格,求最小的移动达到目的) 代码:
#include <cstdio>
#include <iostream>
#include <cstring>
#define MAX 1000000
#define MAXHASHSIZE 1000003
typedef int state[9];
const int dx[4] = {-1,1,0,0};
const int dy[4] = {0,0,-1,1};
state st[MAX] , goal;
int dist[MAX];
int head[MAXHASHSIZE];
int next[MAXHASHSIZE];
void init_lookup_table()
{
memset(head,0,sizeof(head));
}
int hash(state &s)
{
int v = 0;
for(int i = 0; i < 9; ++i) //将9矩阵的数字转化成一个9位数的数字
v = v*10 + s[i];
return v % MAXHASHSIZE;
}
int try_to_insert(int s) //链表存储插入
{
int h = hash(st[s]);
int u = head[h];
while(u)
{
if(memcmp(st[u],st[s],sizeof(st[s])) == 0) //找到了, 插入失败
return 0; //顺着链表查找
u = next[u];
}
next[s] = head[h];
head[h] = s; //插入链表
return 1;
}
int bfs() //广搜不多说了,广搜迷宫最短路一样
{
init_lookup_table();
int front = 1;
int rear = 2;
while(front < rear)
{
state &s = st[front];
if(memcmp(goal,s,sizeof(s)) == 0)
return front;
int z;
for(z = 0; z < 9; ++z)
if(!s[z]) break;
int x = z/3 , y = z%3;
for(int d = 0; d < 4; ++d)
{
int newx = x + dx[d];
int newy = y + dy[d];
int newz = newx*3 + newy;
if(newx >= 0 && newx < 3 && newy >= 0 && newy < 3)
{
state &t = st[rear];
memcpy(&t,&s,sizeof(s));
t[newz] = s[z];
t[z] = s[newz];
dist[rear] = dist[front]+1;
if(try_to_insert(rear) == 1)
rear++;
}
}
front++;
}
return 0;
}
int main()
{
freopen("input.txt","r",stdin);
for(int i = 0; i < 9; ++i) //0代表空格
scanf("%d",&st[1][i]);
for(int i = 0; i < 9; ++i)
scanf("%d",&goal[i]);
int ans = bfs();
if(ans > 0)
printf("%d\n",dist[ans]);
else
printf("-1\n");
return 0;
}