|
|||||
|
|
| 一种新的博弈树搜索方法 | |
| 引用本文： | 张明亮,李凡长.一种新的博弈树搜索方法[J].山东大学学报(工学版),2009,39(6):1-7. |
| 作者姓名： | 张明亮 李凡长 |
| 作者单位： | 张明亮 ：苏州科技学院电子与信息工程学院, 江苏 苏州 215011; 张明亮 李凡长：.苏州大学计算机科学与技术学院, 江苏 苏州 215006 |
| 摘 要： | 通过对机器博弈主要搜索算法的深入分析和实践,提出了在博弈树一层结点中以广度优先方式,运用接力式空窗探测技术反复淘汰到只剩一个结点的新搜索方法. 该方法面向应用,搜索过程易控,理论上的最小搜索极限小于极小博弈树. 对比实验表明,该算法平均搜索效率高于PVS搜索和MTD(f)方法，并且使用该方法的迭代深化对博弈树优化效果最佳,从而使迭代深化搜索应用范围更加广泛. |
| 关 键 词： | 博弈树 极小树 空窗探测 迭代深化 广度优先 五子棋 |
| 收稿时间： | 2009-07-19 |
A new search method for a game tree |
|
| ZHANG Ming-liang,LI Fan-zhang.A new search method for a game tree[J].Journal of Shandong University of Technology,2009,39(6):1-7. | |
| Authors: | ZHANG Ming-liang LI Fan-zhang |
| Affiliation: | ZHANG Ming-Liang：Electronics ＆ Information College, Suzhou University of Science and Technology, Suzhou 215011, China; ZHANG Ming-Liang, LI Fan-Chang： College of Computer Science and Technology, Soochow University, Suzhou 215006, China |
| Abstract: | A new search method was given for a game-tree with breadth-firstin the first layer nodes and continuously minimal window test by deep analysis on game-tree search algorithms. It was good for the application and the processof search was easier for control, and may build a smaller search tree than the minimalgame-tree in theory. Comparison experiments indicate that the efficiency of thistechnique outperforms the PVS and MTD(f) method. Another speriority is tooptimize a game-tree by an iterative-deepening search, and to make the overall efficiency of iterative-deepening exceed a one-off game tree search. |
| Keywords: | game-tree minimal tree null window search iterative-deepening search breadth-first gobang |
| 本文献已被 万方数据 等数据库收录！ | |
| 点击此处可从《山东大学学报(工学版)》浏览原始摘要信息 | |
| 点击此处可从《山东大学学报(工学版)》下载全文 | |