六子棋人机对战源代码.pdf

//头文件 // 接口类SearchEngine.h:interfacefortheCSearchEngineclass. #includeMoveGenerator.h #includeEveluation.h classCSearchEngine { public: CSearchEngine() virtual~CSearchEngine() virtual STONEMOVESearchAGoodMove(BYTEposition[][GRID_NUM], intType)=0;//得 到最优走法（核心），type为棋子颜色 virtualvoidSetEveluator(CEveluation*pEval){m_pEval=pEval;};//设置评估对象 virtualvoidSetSearchDepth(intnDepth){m_nSearchDepth=nDepth;} virtual void SetMoveGenerator(CMoveGenerator *pMG){m_pMG= pMG;};//设置走法生 成器 BOOLGameOver(){returnm_bGameOver;};//返回游戏结束标记值 voidBeginGame(){m_bGameOver=FALSE;};//设置游戏结束标记值为FALSE protected: virtualvoidMakeMove(STONEMOVEmove,inttype);//计算机走最佳路，type为棋子颜 色 virtualvoidUnMakeMove(STONEMOVEmove) BYTECurPosition[GRID_NUM][GRID_NUM];//棋盘 CMoveGenerator*m_pMG;//声明生成走法器已被定义 CEveluation*m_pEval;//声明评估对象已被定义 BOOLm_bGameOver;//游戏结束布尔型标记值 STONEMOVEm_cmBestMove intm_nMaxDepth intm_nSearchDepth } #endif // 走法生成器类MoveGenerator.h:interfacefortheCMoveGeneratorclass. #includeEveluation.h #includeHistoryHeuristic.h #includeNegaScout_TT_HH.h #includeTranspositionTable.h classCMoveGenerator { public: CMoveGenerator() virtual~CMoveGenerator() int Sort_CreatePossibleMove(BYTE position[GRID_NUM][GRID_NUM], int nPly, int Type) intCreatePossibleMove(BYTEposition[GRID_NUM][GRID_NUM],intnPly,intType) //此函数完成走法链，获得走法和相应 //走法的价值，所有走法的价值经过从大到小的排序，显然m_MoveList[2][0]是最优走 法 BOOLIsValidPosition(BYTEposition[GRID_NUM][GRID_NUM],inti,intj) voidsort(intdepth,intn,intcount) STONEMOVEm_MoveList[7][40000];//三层走法链，在这里只进行第一层即一位数组 m_MoveList[2] //很显然，对当前局面最多只有64980路走法 protected: intm_nMoveCount;//获得有哪些信誉好的足球投注网站当前局面的走法总数 CHistoryHeuristic*HistoryHeuristic CEveluation*m_pEvel;//评估指针对象 } #endif // 置换表类TranspositionTable.h:interfacefortheCTranspositionTableclass. enumENTRY_TYPE{exact,lower_bound,upper_bound} typedefstructHASHI