Principal variation search

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

Topic mentions per year

Topic mentions per year

1985-2013
012319852013

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
In this paper, we focus on the development of two agents for playing ’Jumper’, under a memory limit of 1024KB and a time limit of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
2007
2007
Connect6 is a game similar to tic-tac-toe in that a certain number of pieces are connected in order for a player to win. Unlike… (More)
  • figure 1
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
2005
2005
In this paper forward-pruning methods, such as multi-cut and null move, are tested at so-called ALL nodes. We improved the… (More)
  • figure 1
  • figure 4
  • figure 5
  • table 1
  • table 2
Is this relevant?
1998
1998
In this paper we introduce a framework for best first search of minimax trees. Existing best first algorithms like SSS* and DUAL… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
1998
1998
Most practitioners use a variant of the Alpha-Beta algorithm, a simple depth-first procedure, for searching minimax trees. SSS… (More)
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
1998
1998
The-algorithm or the Negascout algorithm are known to search game trees eeciently. Many research has been done in the past to… (More)
Is this relevant?
1994
1994
This paper introduces a new paradigm for minimax game-tree search algorithms. MT is a memory-enhanced version of Pearl’s… (More)
  • figure 3
  • figure 2
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
Review
1992
Review
1992
With the continuing price performance improvement of small computers there is growing interest in looking again at some of the… (More)
Is this relevant?
1985
1985
The alpha-beta tree search algorithm can be improved through the use of minimal windows. Branches are searched with a minimal… (More)
  • figure 3
  • figure 4
Is this relevant?