CMU Artificial Intelligence Repository
MINIMAX: Lisp code for alpha beta minimax search.
lang/lisp/code/search/minimax/
Common Lisp implementation of alpha-beta minimax search by Mark
Kantrowitz (18-NOV-90). Includes a NEG-MAX implementation.
A simple implementation of alpha-beta search for tic-tac-toe by
Marco Zagha at Carnegie Mellon University for "AI: Representation and
Problem Solving" (15-381), Spring 1990.
Requires: Common Lisp
Ports: Portable
Copying: Use, copying, modification, and distribution permitted.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Author(s): Mark Kantrowitz
Marco Zagha
Keywords:
Alpha Beta Minimax, Authors!Kantrowitz, Authors!Zagha,
Lisp!Search, Search, Tic-Tac-Toe
References: ?
Last Web update on Mon Feb 13 10:30:40 1995
AI.Repository@cs.cmu.edu