alphabeta_hh.cpp

这是使用 C++ 写的棋子游戏

// Alphabeta_HH.cpp: implementation of the CAlphabeta_HHEngine class.
//
//////////////////////////////////////////////////////////////////////

#include "Alphabeta_HH.h"

//////////////////////////////////////////////////////////////////////
// Construction/Destruction
//////////////////////////////////////////////////////////////////////

CAlphabeta_HHEngine::CAlphabeta_HHEngine()
{

}

CAlphabeta_HHEngine::~CAlphabeta_HHEngine()
{

}

void CAlphabeta_HHEngine::SearchAGoodMove(BYTE position[][9])
{
    memcpy(CurPosition,position,90);

    m_nMaxDepth=m_nSearchDepth;
    ResetHistoryTable();//初始化历史记录表
    AlphaBeta(m_nMaxDepth,-20000,20000);
    m_umUndoMove.cmChessMove=m_cmBestMove;
    m_umUndoMove.nChessID=MakeMove(&m_cmBestMove);  

    memcpy(position,CurPosition,90);
}

int CAlphabeta_HHEngine::AlphaBeta(int nDepth, int alpha,int beta)
{
    int score;
    int Count,i;
    BYTE type;

    i=IsGameOver(CurPosition, nDepth);
    if(i!=0)
        return i;

    if(nDepth<=0)//叶子节点取估值
        return m_pEval->Eveluate(CurPosition,(m_nMaxDepth-nDepth)%2,m_nUserChessColor);
    
    Count=m_pMG->CreatePossibleMove(CurPosition,nDepth,(m_nMaxDepth-nDepth)%2,m_nUserChessColor);
    if(nDepth==m_nMaxDepth)
    {
        //在根节点设定进度条
        progress->setTotalSteps(Count);
        progress->setProgress(1);
    }

    //取所有走法的历史得分
    for(i=0;i<Count;i++) 

        m_pMG->m_MoveList[nDepth][i].Score=GetHistoryScore(&m_pMG->m_MoveList[nDepth][i]);

    MergeSort(m_pMG->m_MoveList[nDepth],Count,0);//对Count种走法按历史得分大小排序

    int bestmove=-1;//记录最佳走法的变量

    for(i=0;i<Count;i++) 
    {
        if(nDepth==m_nMaxDepth)
            progress->nextStep();

        type=MakeMove(&m_pMG->m_MoveList[nDepth][i]);
        score=-AlphaBeta(nDepth-1,-beta,-alpha);
        UnMakeMove(&m_pMG->m_MoveList[nDepth][i],type); 

        if(score>alpha)
        {
            alpha=score;
            if(nDepth==m_nMaxDepth)
                m_cmBestMove=m_pMG->m_MoveList[nDepth][i];
            bestmove=i;
        }
        if(alpha>=beta) 
        {
            bestmove=i;
            break;
        }           
    }
    if(bestmove!=-1)
        EnterHistoryScore(&m_pMG->m_MoveList[nDepth][bestmove],nDepth);//将最佳走法汇入历史记录表

    return alpha;
}