表1 ：UCT极大极小树搜索的伪代码。

Table 1: Pseudocode of UCT for minimax tree.

youdao

几乎所有的国际象棋程序都在以各种形式使用极大极小树。

Almost all chess programs use the minmax tree in one form or another.

youdao

几乎所有的国际象棋程序都在以各种形式使用极大极小树。

Almost all chess programs use the minimax tree in one form or another.

youdao

在极大极小树搜索时，我们经常寻找的是根节点的最优分支。

In the problems of minimax tree search, what we are looking for is often the optimal branch at the root node.

youdao

对一棵完整的极大极小树来说，计算机能够向前遍历每一步，直到找到最佳步骤为止。

With a full minimax tree, the computer could look ahead for each move to determine the best possible move.

youdao

因此，许多古典方法认为人工智能应该由类似极大极小树，预编程数据库和预编代码组成。

So, much of the classical approach to AI consists of things like minimax trees, preprogrammed databases, and prewritten code.

youdao

对于几乎每一个棋类博弈游戏程序来说，极大极小树（the minimax tree）都是其中的核心。

The minimax tree is at the heart of almost every board game program in existence.

youdao

然而，在这些更复杂的博弈中，程序仅仅能搜索极大极小树中的一部分；由于树太过庞大，程序往往不能搜索到博弈最终的结局。

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.

youdao

然而，在这些更复杂的博弈中，程序仅仅能搜索极大极小树中的一部分；由于树太过庞大，程序往往不能搜索到博弈最终的结局。

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.

youdao