Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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… 
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… 
2009
2009
Game playing adalah salah satu sistem kecerdasan buatan (AI). Untuk permasalahan pada permainan yang berbasis pada giliran pemain… 
1998
1998
The-algorithm or the Negascout algorithm are known to search game trees eeciently. Many research has been done in the past to… 
1996
1996
This paper deals with algorithms searching trees generated by two-person, zero-sum games with perfect information. The standard… 
1996
1996
Search algorithms are often categorized by their node expansion strategy. One option is the depth-first strategy, a simple… 
1985
1985
The alpha-beta tree search algorithm can be improved through the use of minimal windows. Branches are searched with a minimal…