www.pudn.com > 1223456.rar > MTD_fEngine.cpp

// MTD_f.cpp: implementation of the CMTD_fEngine class. 
// 
////////////////////////////////////////////////////////////////////// 
 
#include "stdafx.h" 
#include "MTD_fEngine.h" 
 
////////////////////////////////////////////////////////////////////// 
// Construction/Destruction 
////////////////////////////////////////////////////////////////////// 
 
CMTD_fEngine::CMTD_fEngine() 
{ 
 
} 
 
CMTD_fEngine::~CMTD_fEngine() 
{ 
 
} 
 
CMTD_fEngine::SearchAGoodMove(BYTE position[][9]) 
{ 
	int firstguess=0; 
 
	memcpy(CurPosition,position,90); 
	m_nMaxDepth=m_nSearchDepth; 
	CalculateInitHashKey(CurPosition);//计算初始棋盘的哈希值 
 
	//迭代深化调用 MTD(f)搜索 
	for(m_nMaxDepth=1;m_nMaxDepth<=m_nSearchDepth;m_nMaxDepth++) 
		firstguess=Mtdf(firstguess,m_nMaxDepth); 
	MakeMove(&m_cmBackupBM); 
	memcpy(position,CurPosition,90); 
	return 0; 
} 
 
int CMTD_fEngine::Mtdf(int firstguess, int nDepth) 
{ 
	int g,lowerbound,upperbound,beta; 
	 
	g=firstguess; 
	//初始搜索范围-20000 - 20000 
	upperbound=20000; 
	lowerbound=-20000; 
	while(lowerboundEveluate(CurPosition,(m_nMaxDepth-nDepth)%2,m_nUserChessColor); 
		EnterHashTable(exact,current,nDepth,(m_nMaxDepth-nDepth)%2);//将估值放入置换表 
		return current; 
	} 
 
	Count=m_pMG->CreatePossibleMove(CurPosition,nDepth,(m_nMaxDepth-nDepth)%2,m_nUserChessColor); 
	if(nDepth==m_nMaxDepth) 
	{ 
		//在根节点设定进度条 
		m_pThinkProgress->SetRange(0,Count); 
		m_pThinkProgress->SetStep(1); 
	} 
 
	int eval_is_exact=0;//数据类型标志设为 0 
 
	for (i=0;iStepIt();//走进度条 
 
		Hash_MakeMove(&m_pMG->m_MoveList[nDepth][i],CurPosition);//产生子节点的哈希值 
		type=MakeMove(&m_pMG->m_MoveList[nDepth][i]);			//产生子节点 
 
		score=-FAlphaBeta(nDepth-1,-beta,-alpha);//递归搜索子节点 
		 
		Hash_UnMakeMove(&m_pMG->m_MoveList[nDepth][i],type, CurPosition);  
		UnMakeMove(&m_pMG->m_MoveList[nDepth][i],type);  
 
				 
		if(score>current) 
		{ 
			current=score; 
			if(nDepth == m_nMaxDepth) 
				m_cmBestMove = m_pMG->m_MoveList[nDepth][i]; 
			if(score>=beta)//beta剪枝 
			{ 
				EnterHashTable(lower_bound, score, nDepth,(m_nMaxDepth-nDepth)%2);//将下边界装入置换表 
				return current; 
			} 
			if(score>alpha) 
			{ 
				eval_is_exact=1;//设定确切值标志 
				alpha=score;//保留最大值 
			} 
		} 
	} 
 
	//将搜索结果放入置换表 
	if(eval_is_exact)  
		EnterHashTable(exact,alpha,nDepth,(m_nMaxDepth-nDepth)%2); 
    else  
		EnterHashTable(upper_bound,current,nDepth,(m_nMaxDepth-nDepth)%2); 
 
	return current;//返回极大值 /边界 
}