A brief description is available from the ACM 1980 tournament booklet [6] :
Cray-1, United Computing, Kansas City (512k; 64 bits; 80,000,000 inst/sec)
Cube 2.0 is an updated version of Cube 1.1. It executes on either the Cray-1 or on an Honeywell 60/80 provided by Honeywell in Minneapolis. The program is written in Fortran, uses alpha-beta algorithm and iterative deepening. On the Cray-1, the Lanks say the program examines 4,000 nodes per second. This is its first ACM tournament.
a chess program from the early 80s, written in Fortran IV by Lloyd L. Lank [1] and James A. Lank, at that time affiliated with United Computing Inc. [2] , Kansas City, Missouri. Cube ran on a Cray-1, participating as Cube 2.0 at the ACM 1980 [3] , and as Cube 2.1 the ACM 1981 [4] .
Table of Contents
Description
A brief description is available from the ACM 1980 tournament booklet [6] :Cube 2.0 is an updated version of Cube 1.1. It executes on either the Cray-1 or on an Honeywell 60/80 provided by Honeywell in Minneapolis. The program is written in Fortran, uses alpha-beta algorithm and iterative deepening. On the Cray-1, the Lanks say the program examines 4,000 nodes per second. This is its first ACM tournament.
External Links
References
What links here?
Up one level