minimax search 中文意思是什麼
minimax search
解釋
極小化極大搜索-
Shared - memory multiprocessor systems. one is a recently - proposed parallel randomized best - first minimax search ( prbfm ) algorithm in a chess - playing program, and the other is the latest version of crafty, a state - of - the - art alpha - beta - based chess - playing program whose older sequential version is known as a typical game program in spec2000
演算法一是最近新出的parallelrandomizedbest - firstminimaxsearch （ prbfm ） ，演算法二是著名的開源棋類游戲crafty採用的dynamictreesplitting演算法，其早期的單線程版本是spec2000benchmark測試cpu整數性能的程序之一。 -
In the problems of minimax tree search, what we are looking for is often the optimal branch at the root node
在極大極小樹搜索時，我們經常尋找的是根節點的最優分支。 -
A nonmonotone line search algorithm for nonsmooth discrete minimax problem
關於一類非光滑極大極小問題的非單調線性搜索演算法 -
4. the paper applies the minimax algorithm to the problem of computer go and adds the heuristic information about computer go to the minimax algorithm, therefore, it forms the main inference method of computer go in inference machine and improves the search efficiency
論文把極大極小演算法應用於圍棋博弈問題，並且按照棋手計算死活的思路，在極大極小演算法中加入了有關圍棋博弈的啟發式信息，形成了推理機中主要的圍棋博弈推理方法，提高了搜索的效率。
分享友人