Searching game trees with Min Max Approximation : experiments and analysis

Author

Jon T. Richardson

Date of Award

12-1991

Degree Type

Thesis

Degree Name

Master of Science

Major

Computer Science

Major Professor

David Mutchler

Committee Members

David Straight, Jean Blair

Abstract

The Min Max Approximation (MMA) algorithm [Riv88] is a method of exploring a game tree unevenly. Rivest's implementation of the algorithm is reviewed and variations on his technique are discussed. Results are given of additional experiments with the game of Connect-Four which demonstrate weaknesses of MMA. Further experiments with the game of Checkers are described. These experiments reaffirm MMA's promise. The strength and weaknesses of MMA borne out in these experiments are summarized.

Recommended Citation

Richardson, Jon T., "Searching game trees with Min Max Approximation : experiments and analysis. " Master's Thesis, University of Tennessee, 1991.
https://trace.tennessee.edu/utk_gradthes/12514