搜索第一弹

题目，这个题目跟我玩过的一个游戏比较像 ，机甲战士，呵呵

Description

On Planet MM-21,after their Olympic games this year, curling is getting popular. But the rulesare somewhat different from ours. The game is played on an ice game board onwhich a square mesh is marked. They use only a single stone. The purpose of thegame is to lead the stone from the start to the goal with the minimum number ofmoves.

Fig. 1 shows anexample of a game board. Some squares may be occupied with blocks. There aretwo special squares namely the start and the goal, which are not occupied withblocks. (These two squares are distinct.) Once the stone begins to move, itwill proceed until it hits a block. In order to bring the stone to the goal,you may have to stop the stone by hitting it against a block, and throw again.

Fig. 1: Example of board (S: start, G: goal)

The movement ofthe stone obeys the following rules:

• At the beginning, the stone stands still at the start square.
• The movements of the stone are restricted to x and y directions. Diagonal moves are prohibited.
• When the stone stands still, you can make it moving by throwing it. You may throw it to any direction unless it is blocked immediately(Fig. 2(a)).
• Once thrown, the stone keeps moving to the same direction until one of the following occurs:
  • The stone hits a block (Fig. 2(b), (c)).
    • The stone stops at the square next to the block it hit.
    • The block disappears.
  • The stone gets out of the board.
    • The game ends in failure.
  • The stone reaches the goal square.
    • The stone stops there and the game ends in success.
• You cannot throw the stone more than 10 times in a game. If the stone does not reach the goal in 10 moves, the game ends in failure.

Fig. 2: Stone movements

Under the rules,we would like to know whether the stone at the start can reach the goal and, ifyes, the minimum number of moves required.

With the initialconfiguration shown in Fig. 1, 4 moves are required to bring the stone from thestart to the goal. The route is shown in Fig. 3(a). Notice when the stonereaches the goal, the board configuration has changed as in Fig. 3(b).

Fig. 3: The solution for Fig. D-1 and the final board configuration

Input

The input is asequence of datasets. The end of the input is indicated by a line containingtwo zeros separated by a space. The number of datasets never exceeds 100.

Each dataset isformatted as follows.

the width(=w)and the height(=h) of the board
First row of the board
... 
h-th row of the board

The width andthe height of the board satisfy: 2 <= w <= 20, 1<= h <= 20.

Each lineconsists of w decimal numbers delimited by a space. The numberdescribes the status of the corresponding square.

0	vacant square
1	block
2	start position
3	goal position

The dataset forFig. D-1 is as follows:

6 6 
1 0 0 2 1 0 
1 1 0 0 0 0 
0 0 0 0 0 3 
0 0 0 0 0 0 
1 0 0 0 0 1 
0 1 1 1 1 1

Output

For eachdataset, print a line having a decimal integer indicating the minimum number ofmoves along a route from the start to the goal. If there are no such routes,print -1 instead. Each line should not have any character other than thisnumber.

Sample Input

2 1

3 2

6 6

1 0 0 2 1 0

1 1 0 0 0 0

0 0 0 0 0 3

0 0 0 0 0 0

1 0 0 0 0 1

0 1 1 1 1 1

6 1

1 1 2 1 1 3

6 1

代码：

#include<stdio.h>
#include<string.h>
#define N 25
int dx[5]={0,0,0,1,-1};
int dy[5]={0,1,-1,0,0};
int a[N][N];
int n,m;
int min;
int count;
int x,y;
void dfs(int x,int y)
{


    int i;
    count++;
    if(count>10)return;
    for(i=1;i<=4;i++)
      {
        int xx,yy;
        xx=x+dx[i];
        yy=y+dy[i];
        if(xx>n||yy>m||xx<=0||yy<=0)continue;
        if(a[xx][yy]==1)continue;
        if(a[xx][yy]==3)
            {
                 if(min>count)
                 min=count;
            }
        while(1)
         {
              xx+=dx[i],yy+=dy[i];
              if(xx>n||yy>m||xx<=0||yy<=0)break;
              if(a[xx][yy]==3)
              {
                    if(min>count)
                    min=count;


              }
              if(a[xx][yy]==1)
              {
                    a[xx][yy]=0;
                    dfs(xx-dx[i],yy-dy[i]);
                     count--;
                     a[xx][yy]=1;
                    break;
              }
         }
      }
}
int main()
{
     int i,j;
     while(scanf("%d%d",&m,&n)!=EOF&&n&&m){
     min=999;  count=0;
     for(i=1;i<=n;i++)
            for(j=1;j<=m;j++)
                    {
                         scanf("%d",&a[i][j]);
                            if(a[i][j]==2){x=i;y=j;}
                    }
        dfs(x,y);
       if(min!=999) printf("%d\n",min);
       else printf("-1\n");}
     return 0;
}