博弈树搜索算法研究

通过讨论人工智能中用于计算机博奕的一般技术如极大极小搜索、Alpha-Beta剪枝、小窗口搜索,对五子棋博奕的内在规律进行了分析研究,给出解决五子棋博奕的2种优化算法,这2种优化算法大大提高了搜索效率,相比之下引入置换表后的优化算法的搜索效率更高。

智能搜索算法在棋类零和博弈中的应用

介绍了3种智能搜索算法及人机博弈的一种形式——零和博弈,并通过一个实例——中国象棋介绍了智能搜索算法在棋类零和博弈游戏中的应用。

一种改进的威胁空间搜索算法

研究了五子棋游戏开发中极大极小搜索框架计算量太大,无用计算太多等问题.在传统经典极大极小搜索和alpha-beta剪枝基础上采用了判重,加入启发式的优化,每次选择最有"前途"的若干个决策搜索以减少搜索量,再加入基于五子棋专业棋手下棋策略,改进威胁空间搜索算法.使得计算机的搜索过程更像人的思考过程,算法复杂度大幅降低.经过测试最终编写的程序具备高响应度和智能性.

五子棋算法的研究与思考

通过对五子棋算法的研究,探讨在博弈算法设计中优化的一些基本思路,并对其他棋类博弈算法提出一些思考和展望。

五子棋中的博弈问题

人机对战五子棋程序设计,分为知识库设计和博弈树搜索两个方面.其中五子棋博弈树搜索包括产生子结点顺序与访问结点的具体操作.通过α β剪枝求解产生子结点顺序问题.访问结点的具体操作即是五子棋的静态估值函数求值.系统中博弈问题用产生式系统描述.

Aggregating metasearch engine results based on maximal entropy OWA operator

The maximal entropy ordered weighted averaging （ME-OWA） operator is used to aggregate metasearch engine results, and its newly analytical solution is also applied. Within the current context of the OWA operator, the methods for aggregating metasearch engine results are divided into two kinds. One has a unique solution, and the other has multiple solutions. The proposed method not only has crisp weights, but also provides multiple aggregation results for decision makers to choose from. In order to prove the application of the ME-OWA operator method, under the context of aggregating metasearch engine results, an example is given, which shows the results obtained by the ME-OWA operator method and the minimax linear programming （ minimax-LP ） method. Comparison between these two methods are also made. The results show that the ME-OWA operator has nearly the same aggregation results as those of the minimax-LP method.