资 源 简 介
搜索算法部分使用minmax递归，alphabeta剪枝，初期和中期搜索6层，最后部分搜索15层。评估算法主要是最小行动力，加以位置值的相关判断- The search algorithm partially uses the minmax recursion, the
alphabeta pruning, the initial period and the intermediate stage
searches 6, finally partially searches 15. Appraised the algorithm
mainly is the smallest good power, performs the position value the
correlation to judge
文 件 列 表
Othello
res
ReadMe.txt
AI_kua.cpp
AI_kua.h
Human.h
HI.cpp
HI.h
Othello.h
Model.h
Resource.h
StdAfx.h
Splash.h
Judge.cpp.bak
Human.cpp
Board.h
Player.cpp
OthelloDoc.h
Model.cpp
MainFrm.h
WinDlg.h
Record.cpp
StdAfx.cpp
Board.cpp
Othello.dsp
Player.h
Judge.cpp
Splash.cpp
Othello.dsw
Record.h
OthelloView.h
WinDlg.cpp
Judge.h
Othello.nks
MainFrm.cpp
OthelloDoc.cpp
Othello.cpp
shockwaveflash.h
shockwaveflash.cpp
OthelloView.cpp
Othello.plg
Othello.rc
Release
