// COPYRIGHT NOTES
// ---------------
// This source code is a part of chess which is an example of <Game Programing guide>.
// You may use, compile or redistribute it as part of your application
// for free.
// You cannot redistribute sources without the official agreement of the author.
// If distribution of you application which contents code below was occured, place
// e-mail <hidebug@hotmail.com> on it is to be appreciated.
// This code can be used WITHOUT ANY WARRANTIES on your own risk.
//
// Spring Wang <hidebug@hotmail.com>
// ---------------
// 版權(quán)聲明
// ---------------
// 本文件所含之代碼是《人機(jī)博弈程序設(shè)計(jì)指南》的范例程序中國(guó)象棋的一部分
// 您可以免費(fèi)的使用, 編譯 或者作為您應(yīng)用程序的一部分。
// 但,您不能在未經(jīng)作者書面許可的情況下分發(fā)此源代碼。
// 如果您的應(yīng)用程序使用了這些代碼,在您的應(yīng)用程序界面上
// 放入 e-mail <hidebug@hotmail.com> 是令人欣賞的做法。
// 此代碼并不含有任何保證,使用者當(dāng)自承風(fēng)險(xiǎn)。
//
// 王小春 <hidebug@hotmail.com>
// Alphabeta_HH.cpp: implementation of the CAlphabeta_HH class.
//
//////////////////////////////////////////////////////////////////////
#include "stdafx.h"
#include "chess.h"
#include "Alphabeta_HH.h"
#ifdef _DEBUG
#undef THIS_FILE
static char THIS_FILE[]=__FILE__;
#define new DEBUG_NEW
#endif
//////////////////////////////////////////////////////////////////////
// Construction/Destruction
//////////////////////////////////////////////////////////////////////
CAlphabeta_HH::CAlphabeta_HH()
{
}
CAlphabeta_HH::~CAlphabeta_HH()
{
}
CAlphabeta_HH::SearchAGoodMove(BYTE position[10][9])
{
memcpy(CurPosition, position, 90);
m_nMaxDepth = m_nSearchDepth;
ResetHistoryTable();
alphabeta(m_nMaxDepth, -20000, 20000);
MakeMove(&m_cmBestMove);
memcpy(position, CurPosition, 90);
}
int CAlphabeta_HH::alphabeta(int depth, int alpha, int beta)
{
int score;
int Count,i;
BYTE type;
i = IsGameOver(CurPosition, depth);
if (i != 0)
return i;
if (depth <= 0) //葉子節(jié)點(diǎn)取估值
return m_pEval->Eveluate(CurPosition, (m_nMaxDepth-depth)%2);
Count = m_pMG->CreatePossibleMove(CurPosition, depth, (m_nMaxDepth-depth)%2);
for (i=0;i<Count;i++)
{
m_pMG->m_MoveList[depth][i].Score =
GetHistoryScore(&m_pMG->m_MoveList[depth][i]);
}
MergeSort(m_pMG->m_MoveList[depth], Count, 0);
int bestmove = -1;
for (i=0;i<Count;i++)
{
type = MakeMove(&m_pMG->m_MoveList[depth][i]);
score = -alphabeta(depth - 1, -beta, -alpha);
UnMakeMove(&m_pMG->m_MoveList[depth][i],type);
if (score > alpha)
{
alpha = score;
if(depth == m_nMaxDepth)
m_cmBestMove = m_pMG->m_MoveList[depth][i];
bestmove = i;
}
if (alpha >= beta)
{
bestmove = i;
break;
}
}
if (bestmove != -1)
EnterHistoryScore(&m_pMG->m_MoveList[depth][bestmove], depth);
return alpha;
}