- Full text PDF available (1)
- This year (0)
- Last 5 years (0)
- Last 10 years (0)
Integral scalar processing and increased parallelism are major advances in supercomputer evolution. Three second-generation machines—BSP, Cyber 205, and Cray-1— are here described and compared.
The tree pruning system (TPS) consists of a set of commands designed for programming heuristic tree searches. This system was assembled as a pre-FORTRAN compiler similar in principle to that of FORMAC. TPS and FORTRAN IV statements are used together for writing programs. In the present implementation, each TPS command must be preceded by an asterisk (*) in… (More)
OKO III is a chess player written entirely in Fortran. On the IBM 360-65, COKO III plays a minimal chess game at the rate of .2 sec cpu time per move, with a level close to lower chess club play. A selective tree searching procedure controlled by tactical chess logistics allows a deployment of multiple minimal game calculations to achieve some optimal move… (More)
A grandmaster usually spends a lifetime collecting knowledge or information about the game. Some of this knowledge is given to COKO in the form of a 12,000 line FORTRAN program. Using this knowledge COKO plays very poorly but at the super rate of approximately one move/sec. The use of a brute force selective tree searching procedure yields an order of… (More)