-*- mode:Text -*-
Copyright 1992 Patrick H. Winston.  All rights reserved.
Version 1.1, transferred from master disk on 21 Jan 93
 
This file may reference other files containing copyrighted software.
Any restrictions on the use of such software are described in the
files containing that software.  This file may be freely copied as
long as this notice is kept intact.

PURPOSE

Provides program support for Chapter 6, Trees and Adversarial
Search.  Illustrates adversarial search using game trees.

REMARKS

The alpha-beta procedure provided works on preformed game trees;
they are not incorporated into a game-playing program.  This way,
you can run the alpha-beta procedure on trees you design to
explore how the alpha-beta procedure works.

PERFORMANCE EXPERIMENT 1

Examine the file contest.exp.  Run the search experiments by
typing the following command to your lisp system:

(load "contest.exp")

Alternatively, evaluate each Lisp expression in the file one at a
time, noting what each does.

PERFORMANCE EXPERIMENT 2

Run the search procedures with other game trees.

LARGE-SCALE LISP PROJECT

Incorporate the alpha-beta search procedure into a
tic-tac-toe-playing program or other game-playing program.