然而,在这些更复杂的博弈中,程序仅仅能搜索极大极小树中的一部分;由于树太过庞大,程序往往不能搜索到博弈最终的结局。
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.
讨论了命题公式的主析取范式、主合取范式中的极小项与极大项下标集合的性质,利用主范式的下标集合得到了命题公式蕴涵的几个充要条件。
With respect to the principal disjunctive normal form and the principal conjunctive normal form, we also approach the properties of the subscript sets derived from the minimum term and maximum term.
虽然在很多文章中,它不是着重强调极小极大方法的使用。
Although in many papers it is not formally emphasized, the minimax approach was used.
应用推荐