Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Principal variation search

Known as: Negascout, PVS 
Principal variation search (sometimes equated with the practically identical NegaScout) is a negamax algorithm that can be faster than alpha-beta… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
textabstractThis paper introduces a new paradigm for minimax game-tree search algorithms. MT is a memory-enhanced version of… Expand
  • figure 3
  • figure 2
  • figure 4
  • figure 6
  • figure 9
2011
2011
Fuzzified game tree search algorithm is based on the idea that the exact game tree evaluation is not required to find the best… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
2011
2011
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
2011
2011
This paper presents a new game tree search algorithm which is based on the idea that the exact game tree evaluation is not… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
2009
2009
Game playing adalah salah satu sistem kecerdasan buatan (AI). Untuk permasalahan pada permainan yang berbasis pada giliran pemain… Expand
1997
1997
MTD(f) is a new minimax search algorithm, simpler and more efficient than previous algorithms. In tests with a number of… Expand
1996
1996
This paper deals with algorithms searching trees generated by two-person, zero-sum games with perfect information. The standard… Expand
1996
1996
Search algorithms are often categorized by their node expansion strategy. One option is the depth-first strategy, a simple… Expand
  • figure 2.4
  • figure 2.6
  • figure 2.7
  • figure 2.9
  • figure 2.11
1985
1985
The alpha-beta tree search algorithm can be improved through the use of minimal windows. Branches are searched with a minimal… Expand
  • figure 3
  • figure 4