#include<iostream>
#include<iomanip>
using namespace std;
int   Forward[8][2]={{-1,-2},{-1,2},{1,-2},{1,2},{-2,-1},{-2,1},{2,-1},{2,1}};//馬的遍歷方向
class Dfs_horse
{
public:
    Dfs_horse(); 
    void Dfs_Visit(int x,int y);               
private:
    int  Qipan[8][8] ;//每個格子的值,表示是否遍歷過 
    int  Count ;    //計數,遍歷棋盤的格子的數目 
    int  Num ;        //控制輸出. 
};

Dfs_horse::Dfs_horse() //初始化,使每個格子的值為假
{
   for (int i = 0; i < 8;i ++)
   for(int j = 0;j < 8;j ++)
   Qipan[i][j] = 0;   
   Count = 0;
   Num = 0;
}
                     
void  Dfs_horse::Dfs_Visit(int x,int y)
{
	if(x > 8 || x<1 || y>8 || y<1) return;//越界返回
    if(Qipan[x-1][y-1] != 0) return;//若此格已經遍歷過則返回 
    Count ++;           
    Qipan[x-1][y-1] = Count;//記錄這個格子的遍歷時間     
    for(int ix = 0;ix < 8;ix ++)  //向各個方向搜索           
       Dfs_Visit(x+Forward[ix][0],y+Forward[ix][1]) ;       
     if(Count == 64)  //Num控制輸出遍歷結果的次數 
     {        
         Num ++;   
         cout << "遍歷次數 " << Num << endl ;         
         cout <<"-----遍歷的路徑為-----"<<endl;
         for (int i = 0;i < 8;i ++)
         {
             for(int j = 0;j < 8;j ++)    
                cout<< setw(2) << right<< Qipan[i][j] <<" " ;
               cout << endl; 
         }                    
     }    
}


int  main()
{
     Dfs_horse  abc;
     abc.Dfs_Visit(7,2);    
     system("PAUSE");
     return 0;
}