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

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

youdao

如果编译器知道这种预测信息，就可以围绕最可能执行的分支生成最优的代码。

If the compiler has this prediction information, it can generate the most optimal code around the branch.

youdao

通过分支指令访问条件结构的 False 部分，这不是最优的方式，但是访问它的可能性不大。

The False portion of the conditional would then be available through the branch instruction, which is less optimal but also less likely.

youdao