UVA Knights in FEN

题目如下：

Problem D

Knights in FEN

Input: standard input

Output: standard output

Time Limit: 10 seconds

 

There are black and white knightson a 5 by 5 chessboard. There are twelve of each color, and there is one squarethat is empty. At any time, a knight can move into an empty square as long asit moves like a knight in normal chess (what else did you expect?).

Given an initial position of the board, thequestion is: what is the minimum number of moves in which we can reach thefinal position which is:

Input

First line of the input file contains an integerN (N<14) that indicates how many sets of inputs are there. The descriptionof each set is given below:

Each set consists of five lines; each linerepresents one row of a chessboard. The positions occupied by white knights aremarked by 0 and the positions occupied by black knights are marked by 1. Thespace corresponds to the empty square on board.

There is no blank line between the two sets ofinput.

The first set of the sample input belowcorresponds to this configuration:

Output

For each set your task is to find the minimumnumber of moves leading from the starting input configuration to the final one.If that number is bigger than 10, then output one line stating

Unsolvable in less than 11 move(s).

 

otherwise output one linestating

Solvablein nmove(s).

where n <= 10.

Theoutput for each set is produced in a single line as shown in the sample output.

Sample Input

2

01011

110 1

01110

01010

00100

10110

01 11

10111

01001

00000

Sample Output

Unsolvable in less than 11 move(s).

Solvable in 7 move(s).

简单的dfs，模拟跳马，判断出是目标状态后更新最小值。

AC的代码如下：

#include 
   
   
    
    

using namespace std;
int G[5][5];
int dx[]= {2,1,-1,-2,-2,-1,1,2};
int dy[]= {1,2,2,1,-1,-2,-2,-1};
int standard[5][5]= {{1,1,1,1,1},{0,1,1,1,1},{0,0,2,1,1},{0,0,0,0,1},{0,0,0,0,0}};
bool judge()
{
    for(int i=0; i<5; i++)
        for(int j=0; j<5; j++)
            if(G[i][j]!=standard[i][j])
                return false;
    return true;

}
int MIN;
int ok;
void dfs(int x,int y,int depth)
{
    if(depth>10)
        return;
    if(judge())
    {
        if(MIN>depth)
            MIN=depth;
        ok=1;
    }
    for(int i=0; i<8; i++)
    {
        int newx=x+dx[i];
        int newy=y+dy[i];
        if(newx>=0&&newx<5&&newy>=0&&newy<5)
        {
            swap(G[x][y],G[newx][newy]);
            dfs(newx,newy,depth+1);
            swap(G[x][y],G[newx][newy]);
        }
    }
}
int main()
{
    int N;
    cin>>N;
    getchar();
    while(N--)
    {
        char c;
        char b[6];
        int X,Y;
        for(int i=0; i<5; i++)
        {
            gets(b);
            for(int j=0; j<5; j++)
            {
                c=b[j];
                if(isdigit(c))
                    G[i][j]=c-'0';
                else
                {
                    G[i][j]=2;
                    X=i;
                    Y=j;
                }
            }

        }
        ok=0;
        MIN=20;
        dfs(X,Y,0);
        if(ok)
            printf("Solvable in %d move(s).\n",MIN);
        else
            printf("Unsolvable in less than 11 move(s).\n");
    }
    return 0;
}