In the problems of minimax tree search, what we are looking for is often the optimal branch at the root node.
在极大极小树搜索时，我们经常寻找的是根节点的最优分支。
2
Perhaps just as important are fundamental algorithms like binary search, graph searching algorithms, sorting algorithms, and tree-based searches such as minimax.