© 1964 by British Computer Society
| ||||||||||||||||||||||||||||||||||||||||||||||||||||
A partial analysis of Go*

1 Mathematics Department, New Mexico State University, USA, 2 Los Alamos Scientific Laboratory, University of California, USA
A game called Computer Go is defined. Computer Go differs from the game of Japanese Go only in that certain imprecisely defined conventions have been replaced by precise rules. Some general theorems on Computer Go are given, as well as a scheme for analysing the game with the aid of a computer. Several reduced versions of Computer Go were analysed, and the resultant strategies are briefly described.
* This research was supported in part by Grant NSF-G 25058, Grant AF-AFOSR 457-63, and by The Atomic Energy Commission.
Mathematics Department New Mexico State University.
¶ Los Alamos Scientific Laboratory, University of California, Los Alamos, New Mexico.