设计和实现了基于PVM的博弈树并行搜索过程。
The article designs and implements the parallel search process using PVM in chess tree.
该博弈并行搜索模型，适用于一般的博弈树搜索问题。
The model can be used to solve other parallel chess tree problems.
其中五子棋博弈树搜索包括产生子结点顺序与访问结点的具体操作。
Gameplaying tree search includes the generation of node order and the concrete operation in accessing the nodes.
基于博弈树的构建 ，对传统的博弈算法进行了分析研究 ，指出了其存在的不足。
This paper gives profound research is game-tree search algorithm and game-tree optimization technique.
目前黑白棋、五子棋、国际象棋等棋类的计算机博弈已经取得了成功，而博弈树更为庞大的中国象棋计算机博弈尚处于萌芽阶段。
Now, people have obtained success in Othello, Gobang, chess with computer game, however, Chinese chess computer game which has huger searching-tree, is still at the initial stage.
极大极小博弈树(Minimax Game Tree，简写为MGT，译者注)用于编写电脑之间的游戏程序，这类程序由两个游戏者轮流，每次执行一个步骤。
The Minimax game Tree is used for programming computers to play games in which there are two players taking turns to play moves.
然而，在这些更复杂的博弈中，程序仅仅能搜索极大极小树中的一部分；由于树太过庞大，程序往往不能搜索到博弈最终的结局。
In these more complicated games, however, the programs can only look at the part of the minimax tree; often, the programs can't even see the end of the game because it is so far down the tree.
结果表明基于博弈的AT L逻辑比传统的基于计算树逻辑(CTL)更适合于描述和分析复杂电子商务协议。
These works indicate that the alternating-time temporal logic (ATL) logic based on game is more suit-able to describe and analyze complex e-commerce protocols than traditional CTL.
解决博弈问题的传统算法——搜索树法所无法克服的对搜索深度的限制。
Search tree, which is restricted by search depth, is the traditional algorithm in dealing with game.
摘要解决博弈问题的传统演算法搜索树法所无法克服的对搜索深度的限制。
Search tree, which is restricted by search depth, is the traditional algorithm in dealing with game.
摘要解决博弈问题的传统演算法搜索树法所无法克服的对搜索深度的限制。
Search tree, which is restricted by search depth, is the traditional algorithm in dealing with game.
应用推荐