Eight HDU - 1043

题目链接：Eight HDU - 1043

============================================================================================

Eight

Time Limit: 5000MS
Memory Limit: 32768 kB

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, several descriptions of configuration of the 8 puzzle. One 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. Do not print a blank line between cases.

Sample Input

2 3 4 1 5 x 7 6 8

Sample Output

ullddrurdllurdruldr

===================================================

这一题就是经典八数码。算法难点在于：

1.判重：map,hash,cantor康托展开

2.ac可用搜索算法：bfs dbfs A*

我是直接暴力预处理，从12345678X开始进行所有情况处理，然后结果反序输出。节点用int存储9位数的序列。

===================================================

#include <iostream>
#include <queue>
#include <map>
#include <algorithm>

using namespace std;

map<int,string> ans;
int n[10];

struct node{
    int num,nine;
    node(int nn,int nni):num(nn),nine(nni) {};
};

int change(int a,int b,int c){
    int u = c/n[a]%10, v = c/n[b]%10;
    //cout<<a<<" "<<b<<" "<<c<<endl;
    //cout<<u<<" "<<v<<" "<<u*n[a]<<" "<<v*n[b]<<" "<<v*n[a]<<" "<<u*n[b]<<endl;
    return c - u*n[a]  - v*n[b] + v*n[a] + u*n[b];
}

void init(){
    n[8] = 1;for(int i=7;i>=0;i--) n[i] = n[i+1]*10;
    //for(int i=0;i<9;i++) cout<<n[i]<<endl;

    queue<node> q;

    ans[123456789] = "";
    q.push(node(123456789,8));

    while(!q.empty()){
        node p = q.front();q.pop();
        int num = p.num , nine = p.nine;
        int tnt;
        //---------------------------------------------
        switch(nine){
            case 0:
                tnt = change(0,1,num);
                if(ans.count(tnt)==0){
                    ans[tnt] = ans[num] + "l";
                    q.push(node(tnt,1));
                }
                tnt = change(0,3,num);
                if(ans.count(tnt)==0){
                    ans[tnt] = ans[num] + "u";
                    q.push(node(tnt,3));
                }
                break;
            case 1:
                tnt = change(1,0,num);
                if(ans.count(tnt)==0){
                    ans[tnt] = ans[num] + "r";
                    q.push(node(tnt,0));
                }
                tnt = change(1,2,num);
                if(ans.count(tnt)==0){
                    ans[tnt] = ans[num] + "l";
                    q.push(node(tnt,2));
                }
                tnt = change(1,4,num);
                if(ans.count(tnt)==0){
                    ans[tnt] = ans[num] + "u";
                    q.push(node(tnt,4));
                }
                break;
            case 2:
                tnt = change(2,1,num);
                if(ans.count(tnt)==0){
                    ans[tnt] = ans[num] + "r";
                    q.push(node(tnt,1));
                }
                tnt = change(2,5,num);
                if(ans.count(tnt)==0){
                    ans[tnt] = ans[num] + "u";
                    q.push(node(tnt,5));
                }
                break;
            case 3:
                tnt = change(3,0,num);
                if(ans.count(tnt)==0){
                    ans[tnt] = ans[num] + "d";
                    q.push(node(tnt,0));
                }
                tnt = change(3,4,num);
                if(ans.count(tnt)==0){
                    ans[tnt] = ans[num] + "l";
                    q.push(node(tnt,4));
                }
                tnt = change(3,6,num);
                if(ans.count(tnt)==0){
                    ans[tnt] = ans[num] + "u";
                    q.push(node(tnt,6));
                }
                break;
            case 4:
                tnt = change(4,1,num);
                if(ans.count(tnt)==0){
                    ans[tnt] = ans[num] + "d";
                    q.push(node(tnt,1));
                }
                tnt = change(4,3,num);
                if(ans.count(tnt)==0){
                    ans[tnt] = ans[num] + "r";
                    q.push(node(tnt,3));
                }
                tnt = change(4,5,num);
                if(ans.count(tnt)==0){
                    ans[tnt] = ans[num] + "l";
                    q.push(node(tnt,5));
                }
                tnt = change(4,7,num);
                if(ans.count(tnt)==0){
                    ans[tnt] = ans[num] + "u";
                    q.push(node(tnt,7));
                }
                break;
            case 5:
                tnt = change(5,2,num);
                if(ans.count(tnt)==0){
                    ans[tnt] = ans[num] + "d";
                    q.push(node(tnt,2));
                }
                tnt = change(5,4,num);
                if(ans.count(tnt)==0){
                    ans[tnt] = ans[num] + "r";
                    q.push(node(tnt,4));
                }
                tnt = change(5,8,num);
                if(ans.count(tnt)==0){
                    ans[tnt] = ans[num] + "u";
                    q.push(node(tnt,8));
                }
                break;
            case 6:
                tnt = change(6,3,num);
                if(ans.count(tnt)==0){
                    ans[tnt] = ans[num] + "d";
                    q.push(node(tnt,3));
                }
                tnt = change(6,7,num);
                if(ans.count(tnt)==0){
                    ans[tnt] = ans[num] + "l";
                    q.push(node(tnt,7));
                }
                break;
            case 7:
                tnt = change(7,6,num);
                if(ans.count(tnt)==0){
                    ans[tnt] = ans[num] + "r";
                    q.push(node(tnt,6));
                }
                tnt = change(7,4,num);
                if(ans.count(tnt)==0){
                    ans[tnt] = ans[num] + "d";
                    q.push(node(tnt,4));
                }
                tnt = change(7,8,num);
                if(ans.count(tnt)==0){
                    ans[tnt] = ans[num] + "l";
                    q.push(node(tnt,8));
                }
                break;
            case 8:
                tnt = change(8,5,num);
                if(ans.count(tnt)==0){
                    ans[tnt] = ans[num] + "d";
                    q.push(node(tnt,5));
                }
                tnt = change(8,7,num);
                if(ans.count(tnt)==0){
                    ans[tnt] = ans[num] + "r";
                    q.push(node(tnt,7));
                }
                break;

            default:cout<<nine<<endl;
        }

        //---------------------------------------------
    }
}

int main(){
    init();

    char _;
    while(cin>>_){

        int cnt=0;

        if(_=='x') _='9';
        cnt+=(_-'0')*n[0];

        for(int i=1;i<9;i++) {
            cin>>_;
            if(_=='x') _='9';
            cnt+=(_-'0')*n[i];
        }

    //cout<<cnt<<endl;
    //cout<<ans[cnt]<<endl;

        if(ans.count(cnt)==0) puts("unsolvable");
        else{
            string strng = ans[cnt];

            //cout<<strng<<endl;

            for(int i=strng.length()-1;i>=0;i--){
                cout<<strng[i];
            }cout<<endl;
        }
    }
    return 0;
}