Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 232,658,345 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.
2018
2018
Negascout Algorithm Implementation in OthelloBoard Games
Samuel Devaprasad Octaaji
2018
Corpus ID: 192630745
ABSTRACT Othello is a zero-sum board game. Although Othello is simpler than chess, it is impossible to calculate all of sixty…
Expand
2017
2017
AI agents for the abstract strategy game Tak
L. Beljaards
2017
Corpus ID: 267878715
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
2012
2012
IMPLEMENTASI ALGORITMA NEGASCOUT DALAM PERMAINAN OTHELLO
J. Purwadi
,
Rosa Delima
2012
Corpus ID: 173629487
2011
2011
Fuzzified Algorithm for Game Tree Search with Statistical and Analytical Evaluation
Dmitrijs Rutko
2011
Corpus ID: 56284204
This paper presents a new game tree search algorithm which is based on the idea that the exact game tree evaluation is not…
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
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
Review
2006
Review
2006
Modern developments of Shannon's Chess
Dmitry Batenkov
2006
Corpus ID: 15217511
We investigate some improvements and recent developments in the game-tree search techniques, which have influenced development of…
Expand
1998
1998
Selective Game Tree Search on a Cray T3e
Rainer Feldmann
,
Burkhard MonienDepartment
1998
Corpus ID: 18202112
The-algorithm or the Negascout algorithm are known to search game trees eeciently. Many research has been done in the past to…
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