poj 1077

      经典的八数码问题，不过题目开始一直在说16数码问题。

     《算法竞赛入门经典》P131说的很清楚了。不过这道题要注意用hash判重，用STL偷懒会TLE。

代码（G++）：

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <queue>

#define MAX 500000
#define MOD 100000
using namespace std;

typedef int State[9];
const int dir[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
const char ch[4]={'u','d','l','r'};

struct Node{
    int id;
    int pos;
    string s;
};

State state[MAX];
int head[MOD],next[MAX];
char array[9];

int hash(int id)
{
    int i,num;
    num=0;
    for(i=0;i<9;i++)
    {
        num=num*10+state[id][i];
    }
    if(num==123456780) return -1;
    else return num%MOD;
}

int check(int id)
{
    int i,h;
    h=hash(id);

    if(h==-1) return 1;
    for(i=head[h];i!=-1;i=next[i])
    {
        if(memcmp(state[i],state[id],sizeof(State))==0) return 0;
    }
    next[id]=head[h];
    head[h]=id;
    return -1;
}

string bfs(int v)
{
    int i,x,y,nx,ny,pos,npos,c,id,k;
    queue<Node> qi;
    Node node;
    qi.push((Node){0,v,""});
    c=1;
    while(!qi.empty())
    {
        node=qi.front();
        qi.pop();

        id=node.id;
        pos=node.pos;
        x=pos/3;
        y=pos%3;
        for(i=0;i<4;i++)
        {
            nx=x+dir[i][0];
            ny=y+dir[i][1];
            if(nx>=0&&ny>=0&&nx<3&&ny<3)
            {
                npos=nx*3+ny;
                memcpy(state[c],state[id],sizeof(state[id]));
                state[c][npos]=state[id][pos];
                state[c][pos]=state[id][npos];
                k=check(c);
                if(k==1) return node.s+ch[i];
                else if(k==-1){
                    qi.push((Node){c++,npos,node.s+ch[i]});
                }
            }
        }
    }
    return "unsolvable";
}

int main()
{
    //freopen("in.txt","r",stdin);

    int i,x;
    string str;
    while(scanf("%c",&array[0])!=EOF)
    {
        for(i=1;i<9;i++) scanf(" %c",&array[i]);
        for(i=0;i<9;i++)
        {
            if(array[i]=='x')
            {
                state[0][i]=0;
                x=i;
            }else state[0][i]=array[i]-'0';
        }
        memset(head,-1,sizeof(head));
        check(0);
        str=bfs(x);
        printf("%s\n",str.c_str());
    }
    return 0;
}

题目（ http://poj.org/problem?id=1077）：

Eight

Time Limit: 1000MS		Memory Limit: 65536K
				Special Judge

Description

The 15-puzzle has been around for over 100 years; even if you don't know it by that name, you've seen it. It is constructed with 15 sliding tiles, each with a number from 1 to 15 on it, and all packed into a 4 by 4 frame with one tile missing. Let's call the missing tile 'x'; the object of the puzzle is to arrange the tiles so that they are ordered as: 

 1  2  3  4 

 5  6  7  8 

 9 10 11 12 

13 14 15  x 

where the only legal operation is to exchange 'x' with one of the tiles with which it shares an edge. As an example, the following sequence of moves solves a slightly scrambled puzzle: 

 1  2  3  4    1  2  3  4    1  2  3  4    1  2  3  4 

 5  6  7  8    5  6  7  8    5  6  7  8    5  6  7  8 

 9  x 10 12    9 10  x 12    9 10 11 12    9 10 11 12 

13 14 11 15   13 14 11 15   13 14  x 15   13 14 15  x 

           r->           d->           r-> 

The letters in the previous row indicate which neighbor of the 'x' tile is swapped with the 'x' tile at each step; legal values are 'r','l','u' and 'd', for right, left, up, and down, respectively. 

Not all puzzles can be solved; in 1870, a man named Sam Loyd was famous for distributing an unsolvable version of the puzzle, and 
frustrating many people. In fact, all you have to do to make a regular puzzle into an unsolvable one is to swap two tiles (not counting the missing 'x' tile, of course). 

In this problem, you will write a program for solving the less well-known 8-puzzle, composed of tiles on a three by three 
arrangement. 

Input

You will receive a description of a configuration of the 8 puzzle. The description is just a list of the tiles in their initial positions, with the rows listed from top to bottom, and the tiles listed from left to right within a row, where the tiles are represented by numbers 1 to 8, plus 'x'. For example, this puzzle 

 1  2  3 

 x  4  6 

 7  5  8 

is described by this list: 

 1 2 3 x 4 6 7 5 8 

Output

You will print to standard output either the word ``unsolvable'', if the puzzle has no solution, or a string consisting entirely of the letters 'r', 'l', 'u' and 'd' that describes a series of moves that produce a solution. The string should include no spaces and start at the beginning of the line.

Sample Input

 2  3  4  1  5  x  7  6  8 

Sample Output

ullddrurdllurdruldr