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

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

youdao

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

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

youdao