摘要
博弈是诸如下棋、打牌、战争等一类竞争性智能活动的通称。通过对机器博弈的研究衍生了大量实用的研究成果。分析当今国际上主流的加快博弈树搜索效率的算法,根据它们的优缺点建立一种基于优化迭代的新算法,并且通过实验数据证明算法的优势。
The Game is a general designation for brainpower actions,suCh as the chess,the card and the war. Many practical productions are gained through the research on game. The main techniques in the research on game tree search are discussed, and then an improved algorithm of game tree search based on optimized iterative deepening is presented. According to the experimental data, the new algorithm displays good performance.
出处
《计算机应用与软件》
CSCD
北大核心
2008年第2期228-230,249,共4页
Computer Applications and Software
关键词
Α-Β剪枝
历史启发
迭代深化
极小窗口搜索
置换表
Alpha-beta search
History heuristic
Iterative deepening
Minimal window search
Transposition table
