Principal variation search
Semantic Scholar uses AI to extract papers important to this topic.
textabstractThis paper introduces a new paradigm for minimax game-tree search algorithms. MT is a memory-enhanced version of… Expand Fuzzified game tree search algorithm is based on the idea that the exact game tree evaluation is not required to find the best… Expand In this paper, we use an adaptive resolution R to enhance the min-max search with alpha-beta pruning technique, and show that the… Expand This paper presents a new game tree search algorithm which is based on the idea that the exact game tree evaluation is not… Expand Game playing adalah salah satu sistem kecerdasan buatan (AI). Untuk permasalahan pada permainan yang berbasis pada giliran pemain… Expand MTD(f) is a new minimax search algorithm, simpler and more efficient than previous algorithms. In tests with a number of… Expand This paper deals with algorithms searching trees generated by two-person, zero-sum games with perfect information. The standard… Expand Search algorithms are often categorized by their node expansion strategy. One option is the depth-first strategy, a simple… Expand The alpha-beta tree search algorithm can be improved through the use of minimal windows. Branches are searched with a minimal… Expand