Changes

Jump to: navigation, search

Clash

3,499 bytes added, 21:27, 24 April 2018
Created page with "'''Home * Engines * Clash''' FILE:Sabiancrashcymbals.jpeg|border|right|thumb|Clash cymbals <ref>A pair of clash cymbals, Image by Kovac9478, January 01, 2..."
'''[[Main Page|Home]] * [[Engines]] * Clash'''

[[FILE:Sabiancrashcymbals.jpeg|border|right|thumb|Clash cymbals <ref>A pair of clash cymbals, Image by Kovac9478, January 01, 2008, [https://creativecommons.org/licenses/by/3.0/deed.en CC BY 3.0], [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons], [https://en.wikipedia.org/wiki/Clash_cymbals Clash cymbals from Wikipedia]</ref> ]]

'''Clash''',<br/>
a chess program written in [[Fortran|Fortran IV]] by [[Chris Peters]], in 1980 a student at the [https://en.wikipedia.org/wiki/University_of_Washington University of Washington]. Clash played the [[ACM 1980]] on a [https://en.wikipedia.org/wiki/Texas_Instruments Texas Instruments] [https://en.wikipedia.org/wiki/TI-990 TI-990] 16-bit [https://en.wikipedia.org/wiki/Minicomputer minicomputer] (28k, 16 bits; 200,000 inst/sec). Without [[Iterative Deepening|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 <ref>[http://www.computerhistory.org/chess/full_record.php?iid=doc-431614f6cdeeb The Eleventh ACM's North American Computer Chess Championship], [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3.1980_11th_ACM_NACCC/The_Eleventh_ACMs_North_American_Computer_Chess_Championship.1980.062303015.sm.pdf pdf] from [[The Computer History Museum]]</ref> :
Clash is entering its first ACM tournament. The program is written in [[Fortran|Fortran IV]] by [[Chris Peters]], 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 [[Selectivity|selective]] [[Search Tree|tree]] and examines about 1,000 - 2,000 positions per move. It uses the [[Alpha-Beta|alpha-beta]] algorithm and the [[Killer Heuristic|killer heuristic]] but does not employ [[Iterative Deepening|iterative deepening]].

=Photos & Games=
[[FILE:ACM1980ClashOstrich.jpg|none|border|text-bottom|link=https://archive.org/stream/PersonalComputing198102/Personal%20Computing%201981-02#page/n86/mode/1up]]
[[ACM 1980]], round 3, Clash vs. [[Ostrich|Ostrich 81]], [[Chris Peters]] and [[Monroe Newborn|Monty Newborn]] chat, while Ostrich ponders 6... e6 <br/>Tournament Director [[David Levy]] scans the other games
<pre>
[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
</pre>

=External Links=
* [https://en.wikipedia.org/wiki/Clash Clash from Wikipedia]
* [[Videos#TheAristocrats|The Aristocrats]] - Get it like that (Culture clash tour - Tokyo), [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: [[Videos#GuthrieGovan|Guthrie Govan]], [[Videos#BryanBeller|Bryan Beller]], [[Videos#MarcoMinnemann|Marco Minnemann]]
: {{#evu:https://www.youtube.com/watch?v=GVlwqflKUfY|alignment=left|valignment=top}}

=References=
<references />

'''[[Engines|Up one level]]'''

Navigation menu