A New Paradigm for Minimax Search

04/05/2014
by   Aske Plaat, et al.
0

This paper introduces a new paradigm for minimax game-tree search algo- rithms. MT is a memory-enhanced version of Pearls Test procedure. By changing the way MT is called, a number of best-first game-tree search algorithms can be simply and elegantly constructed (including SSS*). Most of the assessments of minimax search algorithms have been based on simulations. However, these simulations generally do not address two of the key ingredients of high performance game-playing programs: iterative deepening and memory usage. This paper presents experimental data from three game-playing programs (checkers, Othello and chess), covering the range from low to high branching factor. The improved move ordering due to iterative deepening and memory usage results in significantly different results from those portrayed in the literature. Whereas some simulations show Alpha-Beta expanding almost 100 other algorithms [12], our results showed variations of less than 20 instance of our framework (MTD-f) out-performs our best alpha- beta searcher (aspiration NegaScout) on leaf nodes, total nodes and execution time. To our knowledge, these are the first reported results that compare both depth-first and best-first algorithms given the same amount of memory

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/11/2017

A Minimax Algorithm Better Than Alpha-beta?: No and Yes

This paper has three main contributions to our understanding of fixed-de...
research
05/07/2015

Best-First and Depth-First Minimax Search in Practice

Most practitioners use a variant of the Alpha-Beta algorithm, a simple d...
research
11/08/2019

A different take on the best-first game tree pruning algorithms

The alpha-beta pruning algorithms have been popular in game tree searchi...
research
04/05/2014

SSS* = Alpha-Beta + TT

In 1979 Stockman introduced the SSS* minimax search algorithm that domi-...
research
04/05/2014

Nearly Optimal Minimax Tree Search?

Knuth and Moore presented a theoretical lower bound on the number of lea...
research
03/27/2013

A Cure for Pathological Behavior in Games that Use Minimax

The traditional approach to choosing moves in game-playing programs is t...
research
03/27/2013

Predicting The Performance of Minimax and Product in Game-Tree

The discovery that the minimax decision rule performs poorly in some gam...

Please sign up or login with your details

Forgot password? Click here to reset