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.
2019
2019
This paper presents an improved Othello game solver using the Hardware/Software Co-Design approach. Enhancements in Data… 
2014
2014
MTD(f) is a new minimax search algorithm, simpler and more efficient than previous algorithms. In tests with a number of… 
2014
2014
textabstractThis paper introduces a new paradigm for minimax game-tree search algorithms. MT is a memory-enhanced version of… 
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… 
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…