Best-First Minimax Search

From Chessprogramming wiki
Jump to: navigation, search

Home * Search * Best-First Minimax Search

Best-First Minimax Search, (BFMMS)
is a Best-First search algorithm based on Best-First and a shallow alpha-beta depth-first-search proposed by Richard Korf and Max Chickering [1].

BFMMS, MCαβ, the Rollout Paradigm and further MCTS-minimax hybrids share the same idea, to combine Best-First with Depth-First searches.

Four Phases

BFMMS can be divided into four strategic phases, repeated as long as there is time left:

  1. In the Selection phase the best node is selected from the game tree via node score from the root node until it selects an unexpanded node
  2. The Expansion strategy adds the unexpanded child nodes to the tree
  3. The Playout phase performs a shallow alpha-beta search to get a node score
  4. The Backpropagation strategy propagates the score through the tree

See also


Forum Posts


Up one level