Clash

[ Clash cymbals [1] Clash,

a chess program written in Fortran IV by Chris Peters, in 1980 a student at the University of Washington. Clash played the ACM 1980 on a Texas Instruments TI-990 16-bit minicomputer (28k, 16 bits; 200,000 inst/sec). Without iterative deepening there was not much to gain, and Clash lost all of its four games.

Description

A brief description is available from the ACM 1980 tournament booklet [2] :

Clash is entering its first ACM tournament. The program is written in [Fortran IV](Fortran "Fortran") by [Chris Peters](index.php?title=Chris_Peters&action=edit&redlink=1 "Chris Peters (page does not exist)"), a student at the University of Washington. It requires 10k for instructions and an additional 4k for the tree search. The program searches a highly [selective](Selectivity "Selectivity") [tree](Search_Tree "Search Tree") and examines about 1,000 - 2,000 positions per move. It uses the [alpha-beta](Alpha-Beta "Alpha-Beta") algorithm and the [killer heuristic](Killer_Heuristic "Killer Heuristic") but does not employ [iterative deepening](Iterative_Deepening "Iterative Deepening").

Photos & Games

ACM 1980, round 3, Clash vs. Ostrich 81, Chris Peters and Monty Newborn chat, while Ostrich ponders 6… e6
Tournament Director David Levy scans the other games


[Event "ACM 1980"]
[Site "Nashville USA"]
[Date "1980.10.27"]
[Round "3"]
[White "Clash"]
[Black "Ostrich 81"]
[Result "0-1"]

1.e4 d5 2.Nc3 Nf6 3.Nxd5 Nxe4 4.Nc3 Nxc3 5.dxc3 Qxd1+ 6.Kxd1 Bf5 7.Bd3 e6 8.Bf4 Bc5 
9.Ke2 Bxd3+ 10.cxd3 Na6 11.Be5 O-O 12.b4 f6 13.bxc5 fxe5 14.d4 exd4 15.cxd4 e5 16.dxe5 
Nxc5 17.Rd1 Ne4 18.Nf3 Nc3+ 19.Ke3 Nxd1+ 20.Rxd1 c5 21.Rd7 b6 22.e6 Rae8 23.e7 Rf7 
24.Rxa7 Rexe7+ 25.Rxe7 Rxe7+ 26.Kd3 Ra7 27.h3 Rxa2 28.Ke3 c4 29.g4 b5 30.Ne5 Ra3+ 
31.Ke4 Rxh3 32.f3 c3 33.Kd4 c2 34.Nd3 Rxf3 35.Ne1 Rf4+ 36.Ke5 c1=Q 37.Nd3 Qe3+ 38.Kd6 
Qxd3+ 39.Kc6 Rxg4 40.Kc7 Rg6 41.Kb8 Qd8+ 42.Kb7 Rb6+ 43.Ka7 Qb8# 0-1