Game Tree Searching by Min/Max Approximation

@article{Rivest1987GameTS,
  title={Game Tree Searching by Min/Max Approximation},
  author={Ronald L. Rivest},
  journal={Artif. Intell.},
  year={1987},
  volume={34},
  pages={77-96}
}
Abstract We present an iterative method for searching min/max game trees based on the idea of approximating the “min” and “max” operators by generalized mean-valued operators. This approximation is used to guide the selection of the next leaf node to expand, since the approximations allow one to select efficiently that leaf node upon whose value the (approximate) value at the root most highly depends. Experimental results from almost 1,000 games of Connect-Four 1 suggest that our scheme is… CONTINUE READING
BETA

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 56 CITATIONS

A game-learning machine

VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Learning to Solve Markovian Decision Processes

VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

On Optimal Game-Tree Search using Rational Meta-Reasoning

VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Research on Optimization Computing Service Platform Architecture

  • 2006 6th World Congress on Intelligent Control and Automation
  • 2006
VIEW 2 EXCERPTS
HIGHLY INFLUENCED

Two-agent IDA*

  • J. Exp. Theor. Artif. Intell.
  • 1998
VIEW 3 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Collision Avoidance for Unmanned Aerial Vehicles using Simultaneous Game Theory

  • 2018 IEEE/AIAA 37th Digital Avionics Systems Conference (DASC)
  • 2018
VIEW 1 EXCERPT
CITES BACKGROUND

FILTER CITATIONS BY YEAR

1988
2018

CITATION STATISTICS

  • 6 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES