其中五子棋博弈树搜索包括产生子结点顺序与访问结点的具体操作。
Gameplaying tree search includes the generation of node order and the concrete operation in accessing the nodes.
设计和实现了基于PVM的博弈树并行搜索过程。
The article designs and implements the parallel search process using PVM in chess tree.
解决博弈问题的传统算法——搜索树法所无法克服的对搜索深度的限制。
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.
该博弈并行搜索模型，适用于一般的博弈树搜索问题。
The model can be used to solve other parallel chess tree problems.
该博弈并行搜索模型，适用于一般的博弈树搜索问题。
The model can be used to solve other parallel chess tree problems.
应用推荐