MTD(f), A Minimax Algorithm Faster Than NegaScout

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

MTD(f) is a new minimax search algorithm, simpler and more efficient than previous algorithms. In tests with a number of tournament game playing programs for chess, checkers and Othello it performed better, on average, than NegaScout/PVS (the AlphaBeta variant used in practically all good chess, checkers, and Othello programs). One of the strongest chess programs of the moment, MIT's parallel chess program Cilkchess uses MTD(f) as its search algorithm, replacing NegaScout, which was used in StarSocrates, the previous version of the program.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/30/2011

Why 'GSA: A Gravitational Search Algorithm' Is Not Genuinely Based on the Law of Gravity

Why 'GSA: A Gravitational Search Algorithm' Is Not Genuinely Based on th...
research
02/12/2018

Neural Program Search: Solving Programming Tasks from Description and Examples

We present a Neural Program Search, an algorithm to generate programs fr...
research
11/02/2018

Value-based Search in Execution Space for Mapping Instructions to Programs

Training models to map natural language instructions to programs given t...
research
03/16/2023

A bit-parallel tabu search algorithm for finding E(s^2)-optimal and minimax-optimal supersaturated designs

We prove the equivalence of two-symbol supersaturated designs (SSDs) wit...
research
03/14/2018

A Static Program Slicing Approach for Output Stream Objects in JEE Applications

In this paper, we propose a program slicing approach for the output stre...
research
01/05/1999

TDLeaf(lambda): Combining Temporal Difference Learning with Game-Tree Search

In this paper we present TDLeaf(lambda), a variation on the TD(lambda) a...

Please sign up or login with your details

Forgot password? Click here to reset