摘要
解决机器博弈问题的传统方法是在博弈树上采用各种搜索算法，结合局面评估，来生成相应的走法。本文将遗传算法引入到人机博弈中来,通过时搜索树进行选择，交叉，变异等操作，得到可能包含更优解的博弈树，运用评估函数估值，从而产生当前局面下的最佳着法。
Using adversarial search technologies with the evaluation function and then creating move generations in the game tree is the traditional methods, which is for solving the problems of machine adversarial. This thesis uses the genetic algorithms in machine adversarial. With the Operations of selection, crossover and mutation, we will get the best optimal solutions of the game tree and have the best move of current situation.
作者
徐阳东
刘弘
XU Yang-dong,Liu Hong （School of Information Science and Engineering, Shandong Normal University, Jinan 250014, China）
出处
《电脑知识与技术》
2008年第3期1275-1278,共4页
Computer Knowledge and Technology
关键词
遗传算法
机器博弈
搜索技术
genetic algorithms
machine adversarial
adversarial search
