博弈算法在黑白棋中的应用-《计算机技术与发展》

文章信息/Info

Author(s):: DU Xiu-quan; CHENG Jia-xing; Ministry of Education, Key Laboratory of Intelligent Computing and Signal Processing, Anhui University

Keywords:: tree of game - playing; black and white chess; evaluat ion function; artificial intelligence

摘要:: 计算机博弈是一种对策性游戏，是人工智能的主要研究领域之一．它涉及人工智能中的搜索方法、推理技术和决策规划等。目前广泛研究的是确定的、二人、零和、完备信息的博弈搜索。文中通过一个黑白棋程序的设计，将生成的博弈树节点的估值过程和对博弈树搜索过程相结合，采用传统的Alpha—Beta剪枝和极大一极小原则方法给出了博弈程序设计的核心内容：包括博弈树搜索和估值函数两个方面，提出了对原算法的一种改进，该算法提高了搜索速度。实验结果验证了算法的有效性

Abstract:: The computer game- playing is a game of countermeasure and one of the major artificial intelligence research areas. It involves reasoning,decision-making and planning etc. At the present, widely study the simple basic game- playing that is determinate, two person, zero, complete information game- playing search. Through a black and white chess procedure design, introduced the game - playing programming core content by the process of estimating the production tree of game- playing point value and the tree of game- playing search,used traditional Alpha Beta pruning and the principle of max - min method to introduce the gambling programming core content, including the tree of game- playing search and valuation function, put forward the algorithm improvement method which increase searching speed, the experimental result validated its effect