Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 219,937,492 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Alpha–beta pruning
Chess engine
Computer Go
MTD-f
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
MTD(f), A Minimax Algorithm Faster Than NegaScout
A. Plaat
arXiv.org
2014
Corpus ID: 37468183
MTD(f) is a new minimax search algorithm, simpler and more efficient than previous algorithms. In tests with a number of…
Expand
2014
2014
EVALUASI IMPLEMENTASI ALGORITMA NEGASCOUT DAN ALGORITMA ALPHA BETA PADA PERMAINAN STRATEGO BARRAGE
J. Purwadi
,
R. G. Santosa
2014
Corpus ID: 59662296
2012
2012
Implementasi Algoritma Negascout untuk Permainan Checkers
Aditya Kurniawan Effendi
,
Rosa Delima
,
Antonius Rachmat Chrismanto
2012
Corpus ID: 119973743
Checker is a zero sum game which means if one player is declared win then the other player is declared lose, if one player gets 1…
Expand
2011
2011
Fuzzified Tree Search in Real Domain Games
Dmitrijs Rutko
Mexican International Conference on Artificial…
2011
Corpus ID: 10706755
Fuzzified game tree search algorithm is based on the idea that the exact game tree evaluation is not required to find the best…
Expand
2011
2011
Game Tree Search with Adaptive Resolution
Hung-Jui Chang
,
Meng-Tsung Tsai
,
T. Hsu
Advances in Computer Games
2011
Corpus ID: 20303142
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
Analisis Dan Implementasi Kecerdasan Buatan Pada Permainan Checker Menggunakan Algoritma Minimax Dengan Negascout
M. Akbar
2011
Corpus ID: 59842606
2009
2009
Game Playing untuk Othello dengan Menggunakan Algoritma Negascout dan MTDF
Gunawan Gunawan
,
Yosi Kristian
,
Hermawan Andika
2009
Corpus ID: 141708519
Game playing adalah salah satu sistem kecerdasan buatan (AI). Untuk permasalahan pada permainan yang berbasis pada giliran pemain…
Expand
2005
2005
Enhanced forward pruning
M. Winands
,
H. van den Herik
,
J. Uiterwijk
,
Erik C. D. van der Werf
Information Sciences
2005
Corpus ID: 18921512
1996
1996
Trends in Game Tree Search
A. Bruin
,
W. Pijls
Conference on Current Trends in Theory and…
1996
Corpus ID: 11942979
This paper deals with algorithms searching trees generated by two-person, zero-sum games with perfect information. The standard…
Expand
1985
1985
Information Acquisition in Minimal Window Search
A. Reinefeld
,
J. Schaeffer
,
T. Marsland
International Joint Conference on Artificial…
1985
Corpus ID: 10342714
The alpha-beta tree search algorithm can be improved through the use of minimal windows. Branches are searched with a minimal…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE