//記錄每步棋，可以建立鏈表用來進(jìn)行悔棋、后退(本程序沒有實(shí)現(xiàn))
struct Step
{
 int x,y; //棋子坐標(biāo)
 int ball; //表示下子方{BLACK,WHITE}
};
//記錄棋盤情況，用于搜索過程
class CBoardSituation
{
 public:
 int nArrBoard[15][15]; //棋盤情況
 struct Step machineStep; //AI所下的那一步
 long value; //盤面所打的分?jǐn)?shù)
};
//當(dāng)前棋盤，用于棋盤顯示
int nArrBoard[15][15];

void DFAI()
{
 long value=-MAXINT; //對(duì)初始根節(jié)點(diǎn)的value賦值
 CBoardSituation currentBoard;
 //獲取當(dāng)前機(jī)器新棋面情況
 for(int i=0;i<15;i++)
 for(int j=0;j<15;j++)
  currentBoard.nArrBoard[i][j]=nArrBoard[i][j];
 currentBoard.machineStep.ball=ComputerBall;
 currentBoard.machineStep.x=gnRow;
 currentBoard.machineStep.y=gnColumn;
 currentBoard.value=Eveluate(currentBoard.nArrBoard,BLACK);
 //選取幾個(gè)最好的下法（貪婪法）-->CountList;
 GetSeveralGoodPlace(¤tBoard,WHITE);
 CountList.RemoveAll();
 POSITION pos=templist.GetHeadPosition();
 for(int j=0;j {
 CountList.AddTail(templist.GetNext(pos));
 }
 pos=CountList.GetHeadPosition();
 CBoardSituation *pBoard;
 //對(duì)這些盤面做進(jìn)一步深度搜索
 for(i=0;i {
 pBoard= &(CountList.GetNext(pos));
 pBoard->value=Search(pBoard,BLACK,value,0);
 value=Select(value,pBoard->value,WHITE); //找出最大的分值
 }
 //回到鏈表頭
 pos=CountList.GetHeadPosition();
 for(i=0;i {
 pBoard= &(CountList.GetNext(pos));
 if (value==pBoard->value) //找出得到最高分的盤面
 {
  value=pBoard->value;
  gnRow=pBoard->machineStep.x;
  gnColumn=pBoard->machineStep.y;
  bPlayerDo=TRUE; //當(dāng)前下子方改為人
  break;
 }
 }
 //其他處理
}
其中Search()函數(shù)如下：
//算法搜索函數(shù)
long Search(CBoardSituation *board,int mode,long &oldvalue, int depth)
{
 CList m_DeepList;
 long value;
 if(depthnArrBoard,mode))<8000)
 {
 value=(mode==WHITE)?-MAXINT:MAXINT;
 //選擇幾個(gè)最好的搜索目標(biāo)
 GetSeveralGoodPlace(board,mode);
 POSITION pos=templist.GetHeadPosition();
 for(int j=0;j {
  m_DeepList.AddTail(templist.GetNext(pos));
 }
 pos=m_DeepList.GetHeadPosition();
 CBoardSituation successorBoard;
 for(int i=0;i {
  successorBoard= m_DeepList.GetNext(pos);
  //是否進(jìn)行繼續(xù)深度搜索(剪枝):極大極小值法
  if((mode==WHITE && value<=oldvalue) || (mode==BLACK && value>=oldvalue))
  {
  if(mode==WHITE)
   value=Select(value,Search(&successorBoard,BLACK,value,depth+1),WHITE);
  else//mode==BLACK
   value=Select(value,Search(&successorBoard,WHITE,value,depth+1),BLACK);
  }
 }
 return value;
 }
 else//搜索結(jié)束條件
 {
 return Eveluate(board->nArrBoard,mode);//棋面打分
 }
 return 0;
}