Problem:
Problem D: Curling 2.0

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

Fig. D-1 shows an example of a game board.
Some squares may be occupied with blocks.
There are two special squares namely the start and the goal,
which are not occupied with blocks.
(These two squares are distinct.)
Once the stone begins to move, it will 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. D-1: Example of board (S: start, G: goal)

The movement of the 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. D-2(a)).

Once thrown, the stone keeps moving to the same direction until
one of the following occurs:

The stone hits a block (Fig. D-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. D-2: Stone movements

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

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

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

Input

The input is a sequence of datasets.
The end of the input is indicated by a line
containing two zeros separated by a space.
The number of datasets never exceeds 100.

Each dataset is formatted 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 and the height of the board satisfy:
2 <= w <= 20, 1 <= h <= 20.

Each line consists of w decimal numbers delimited by a space.
The number describes the status of the corresponding square.

0

vacant square

1

block

2

start position

3

goal position

The dataset for Fig. 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 each dataset, print a line having a decimal integer indicating the
minimum number of moves 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
this number.

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
1 0 2 1 1 3
12 1
2 0 1 1 1 1 1 1 1 1 1 3
13 1
2 0 1 1 1 1 1 1 1 1 1 1 3
0 0

Output for the Sample Input

1
4
-1
4
10
-1

Solution in C# (judge verdict: Accepted)


//#define READ_FILE72 //When you want to input from a file ,define this 

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.IO;

using CHY72;



namespace CHY72{
    
    
    public class PointXY{
        public int X , Y;
        public int SQLength() { return X * X + Y * Y; }
        public bool Flag = false;
        public int ID = -1;
        public PointXY(int _X,int _Y,int _ID = -1) {
            X = _X; Y = _Y; ID = _ID;
        }
        public PointXY(PointXY P1, int _X = 0, int _Y = 0) {
            X = P1.X + _X; Y = P1.Y + _Y; ID = P1.ID;
        }
        public static bool operator ==(PointXY P1, PointXY P2) {
            return (P1.X== P2.X && P1.Y == P2.Y);
        }
        public static bool operator !=(PointXY P1, PointXY P2) {return !(P1 ==P2);}
        public override int GetHashCode() {return X.GetHashCode() ^ Y.GetHashCode();}
        public override bool Equals(object obj) {
            if (obj == null || this.GetType() != obj.GetType()) {return false;}
            return (this == (PointXY)obj);
        }

        public string CurrentInformation() {
            return "x:" + X + "  y:" + Y + "  ID:" + ID;
        } 

    }

    public class Lib72 {
        public static T[][] CopyJagArray2<T>(T[][] _Base){
            T[][] NewArray = new T[_Base.Length][];
            for (int i = 0; i < _Base.Length; i++) {
                NewArray[i] = new T[_Base[i].Length ];
                for (int j = 0; j < _Base[i].Length; j++) {
                    NewArray[i][j] = _Base[i][j];
                }
            }
            return NewArray;
        }
        public static T[][][] CopyJagArray3<T>(T[][][] _Base) {
            T[][][] NewArray = new T[_Base.Length][][];
            for (int i = 0; i < _Base.Length; i++) {
                NewArray[i] = CopyJagArray2(_Base[i] ); ;
            }
            return NewArray;
        }

        public static bool isInRect(int _X, int _Y, int _W, int _H) { 
            return (_X >= 0 && _Y >= 0 && _X < _W && _Y < _H); }
        public static int NumFromChar(char CNUM) { return CNUM - 48; }
        public static char LoopChar52(char _C, int n) {
            //Char(C#) uses Uni-Code
            //33 !  "#$%&'(  41 )
            //42 * +,-.  47/
            //48 0  .... 57 9
            //58 :;<=>? 64 @
            //65 A .... 90 Z
            //91 [\]^_ 96`
            //97 a .... 122 z
            int i_C = (int)_C;
            if (i_C > 64 && i_C < 91) i_C -= 65;//0~25 AZ
            else if (i_C > 96 && i_C < 123) i_C -= 71;//26~51 az
            else return '0';
            int RESULT = Modulo ((i_C + n ) , 52);
            if(RESULT < 26) return (char)(RESULT+65);
            else return (char)(RESULT + 71);
        }
        public static int Modulo(int A, int B) {
            // -6 % 5 == -1 ; Modulo (-6 , 5 ) == 4
            int Result = A % B;
            if (Result >= 0) { return Result; }
            else return Result + B;
        }
        public static int intFromHourMinSec(int _h,int _m,int _s) {
            return _s + 60 * _m + 3600 * _h;
        }

        public static int[] KETAArray(int Num) {return KETAArray(Num.ToString()); }
        public static int[] KETAArray(string Num) {
            char[] cKETA = Num.ToCharArray();
            int[] iKETA = new int[cKETA.Length];
            for (int i = 0; i < iKETA.Length; i++) {
                iKETA[i] = NumFromChar(cKETA[i]);
            }
            return iKETA;
        }
        public static int KETA(int Num) { return Num.ToString().ToCharArray().Length; }
        public static int FromKETAArray(int[] _ketaarray) {
            int result = 0;
            int[] R_ketaarray = _ketaarray.Reverse().ToArray(); 
            for (int i = 0,j=1; i < R_ketaarray.Length; i++,j *=10) {
                result += j * R_ketaarray[i];
            }
            return result;
        }
        public static bool isPrime(int p) {
            if (p != 2 && p % 2 == 0) return false;
            if (p == 1) return false;
            int SQp = (int)(Math.Sqrt(p));
            for (int i = 3; i <= SQp; i++) {
                if (p % i == 0) return false;
            }
            return true;
        } 
    }
}    

public class Program {
    static bool ReadLine_1(ref int num1, bool Fin0 = true) {
        string str = Console.ReadLine();
        num1 = int.Parse(str);
        return (Fin0 && num1 == 0);
    }
    static int  ReadLine_1() {
        return  int.Parse(Console.ReadLine());
    }
    static bool ReadLine_2(ref int num1, ref int num2, char Spliter = ' ', bool Fin0 = true,int FinNum =0) {
        string str = Console.ReadLine();
        num1 = int.Parse(str.Split(Spliter)[0]);
        num2 = int.Parse(str.Split(Spliter)[1]);
        return (Fin0 && num1 == FinNum && num2 == FinNum);
    }
    static int[] ReadLine_Array(char Spliter = ' ') {
        return Console.ReadLine().Split(Spliter).Select(s => int.Parse(s)).ToArray();
    }

#if READ_FILE72
    static bool FileReadLine_1(ref int num1, bool Fin0 = true) {
        string str = cReader.ReadLine();
        num1 = int.Parse(str);
        return (Fin0 && num1 == 0);
    }
    static int FileReadLine_1() {
        return int.Parse(cReader.ReadLine());
    }
    static bool FileReadLine_2(ref int num1, ref int num2, char Spliter = ' ', bool Fin0 = true, int FinNum = 0) {
        string str = cReader.ReadLine();
        num1 = int.Parse(str.Split(Spliter)[0]);
        num2 = int.Parse(str.Split(Spliter)[1]);
        return (Fin0 && num1 == FinNum && num2 == FinNum);
    }
    static int[] FileReadLine_Array(char Spliter = ' ') {
        return cReader.ReadLine().Split(Spliter).Select(s => int.Parse(s)).ToArray();
    }

    const string ReadFileName = "Read.txt";
    static bool ReadFromLocal = true;
    static System.IO.StreamReader cReader ;
#endif

    const int DefaultMax = 72727272;


    static void Main(string[] args) {
        #if READ_FILE72  
        cReader = ReadFromLocal ?
            new System.IO.StreamReader(System.IO.Directory.GetCurrentDirectory() + "\\" + ReadFileName, System.Text.Encoding.Unicode) :
            new System.IO.StreamReader(ReadFileName, System.Text.Encoding.Unicode);
        #endif

        Main72();

        #if READ_FILE72
            cReader.Close();
        #endif
    }

    class MeAndMAP {
        public int[][] Map;
        public PointXY Me;
        public MeAndMAP(PointXY _Me, int[][] _Map,int _Now = 0) {
            Me = _Me; 
            Map =_Map;
            Me.ID = _Now;
        }
        
        public MeAndMAP(MeAndMAP MMP) {
            Me = new PointXY(MMP.Me);
            Map = Lib72.CopyJagArray2(MMP.Map);
            Me.ID = MMP.Me.ID;
        }

        public int ObjectGo1(int x, int y ,int i) {
            int NextX = Me.X +x, NextY = Me.Y + y;
            if (Lib72.isInRect(NextX,NextY, h, w)) {
                switch (Map[NextX][NextY] ) {
                    case 0:
                        Me = new PointXY(Me,x,y);
                        return 0;
                    case 1:
                        if (i != 0) Map[NextX][NextY] = 0;
                        else { Failed = true; }
                        return 1;
                    case 3:
                        return 3;
                }
                return -2;
            }else return -1;
        }

        public void Go(int x, int y) {
            Me.ID++;
            for (int i = 0; true; i++ ) {
                int Go1 = ObjectGo1(x, y,i);
                if (Go1 == 1) break;
                if (Go1 == -1) { Failed = true; break; }
                if (Go1 == 3) { Goaled = true; break; }
            }
        }

        public bool Goaled = false;
        public bool Failed = false;
    }

    
    static int w, h;

    static void Main72() {
        while (true) {
            w = 0; h = 0;
            if (ReadLine_2(ref w, ref h)) return;
            int[][] Map = new int[h][];
            for (int i = 0; i < h; i++) {Map[i] = ReadLine_Array();}
            PointXY Start = new PointXY(0,0);
            
            for (int i = 0; i < h; i++) {
                for (int j = 0; j < w; j++) {
                    if (Map[i][j] == 2) { Start = new PointXY(i, j); Map[i][j] = 0; break; }
                }
            }
            Queue<MeAndMAP> QMM = new Queue<MeAndMAP>();
            QMM.Enqueue(new MeAndMAP(Start,Map,0));
            int OKNum = -2;
            while (true) {

                if (QMM.Count == 0) break;
                MeAndMAP NowQMM = QMM.Dequeue();
                if (NowQMM.Me.ID >= 10) break;

                MeAndMAP QMM1 = new MeAndMAP(NowQMM);
                QMM1.Go(0, 1);
                if (QMM1.Goaled) { OKNum = NowQMM.Me.ID; break; }
                else if (!QMM1.Failed) QMM.Enqueue(QMM1);


                MeAndMAP QMM2 = new MeAndMAP(NowQMM);
                QMM2.Go(0, -1);
                if (QMM2.Goaled) { OKNum = NowQMM.Me.ID; break; }
                else if (!QMM2.Failed) QMM.Enqueue(QMM2);

                MeAndMAP QMM3 = new MeAndMAP(NowQMM);
                QMM3.Go(1, 0);
                if (QMM3.Goaled) { OKNum = NowQMM.Me.ID; break; }
                else if (!QMM3.Failed) QMM.Enqueue(QMM3);
                MeAndMAP QMM4 = new MeAndMAP(NowQMM);
                QMM4.Go(-1, 0);
                if (QMM4.Goaled) { OKNum = NowQMM.Me.ID; break; }
                else if (!QMM4.Failed) QMM.Enqueue(QMM4);

            }
            Console.WriteLine(++OKNum); 
            

        }




    }

}