Difference between revisions of "Cube"

From Chessprogramming wiki
Jump to: navigation, search
(Created page with "'''Home * Engines * Cube''' [[FILE:Hexahedron.gif|border|right|thumb|Cube <ref>A rotating [https://en.wikipedia.org/wiki/Hexahedron hexahedron] (cube). [htt...")
 
Line 10: Line 10:
 
  [[Cray-1]], United Computing, Kansas City (512k; 64 bits; 80,000,000 inst/sec)
 
  [[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|alpha-beta]] algorithm and [[Iterative Deepening|iterative deepening]]. On the Cray-1, the Lanks say the program examines 4,000 [[Nodes per second|nodes per second]]. This is its first ACM tournament.  
+
  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|alpha-beta]] algorithm and [[Iterative Deepening|iterative deepening]]. On the Cray-1, the Lanks say the program examines 4,000 [[Nodes per Second|nodes per second]]. This is its first ACM tournament.  
  
 
=External Links=  
 
=External Links=  

Revision as of 14:35, 23 May 2018

Home * Engines * Cube

Cube [1]

Cube,
a chess program from the early 80s, written in Fortran IV by Lloyd L. Lank [2] and James A. Lank, at that time affiliated with United Computing Inc. [3] , Kansas City, Missouri. Cube ran on a Cray-1, participating as Cube 2.0 at the ACM 1980 [4] , and as Cube 2.1 the ACM 1981 [5] .

Description

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. 

External Links

References

Up one level