25,161
edits
Changes
Coko
,no edit summary
'''Coko''', (COKO III)<br/>
a chess program by [[Dennis Cooper]] and [[Ed Kozdrowicki]] which competed the first four [[ACM North American Computer Chess Championship|ACM North American Computer Chess Championships]], [[ACM 1970]], [[ACM 1971]], [[ACM 1972]] ('''Coko III''') and [[ACM 1972]] ('''Coko IV'''). Coko, the Cooper-Kozdrowicki chess program was written in [[Fortran]] as a highly selective tree searcher in the spirit of a [[Type B Strategy|Shannon Type B]] program using a tree pruning system (TPS) consists of a set of commands designed for programming heuristic tree searches <ref>[[Ed Kozdrowicki|Edward W. Kozdrowicki]] ('''1968'''). ''[[http:''//portal.acm.org/citation.cfm?id=810637&dl=GUIDE&coll=GUIDE&CFID=85270894&CFTOKEN=84258946|An adaptive tree pruning system: A language for programming heuristic tree searches]]''. Proceedings of the 1968 23rd ACM national conference</ref>.
=Descriptions=
Apparently due to a [[Engine Testing#bugs|bug]], Coko III found other moves better than mate in one and threw the win ...
<pre>
[Event "ACM 1971"][Site "Chicago"][Date "1972.08.03"][Round "2"][White "Coko III"][Black "Genie"][Result "0-1"] 1.d4 d5 2.Nf3 Nf6 3.Bg5 Bg4 4.Nc3 Ne4 5.Ne5 Be6 6.Nxe4 dxe4 7.c4 Nd7 8.Nxd7 Bxd7 9.e3 f6 10.Bf4 Be6 11.Qh5+ Kd7 12.d5 Bg8 13.Qf5+ e6 14.dxe6+ Bxe6 15.Qxe4 c6 16.Rd1+ Ke8 17.Rxd8+ Kxd8 18.Qxe6 Bb4+ 19.Ke2 Re8 20.Qg4 g6 21.Qh4 g5 22.Qxh7 Be7 23.Qd3+ Kc8 24.Bd6 Kd7 25.Bxe7+ Kxe7 26.Qh7+ Ke6 27.Qe4+ Kd6 28.c5+ Kxc5 29.Qd4+ Kb5 30.Kd1+ Ka5 31.b4+ Ka4 32.Qc3 Rad8+ 33.Kc2 Rd2+ 34.Kxd2 Rd8+ 35.Kc2 Rd2+ 36.Qxd2 Ka3 37.Qc3+ Kxa2 38. Kc1 f5 39. Kc2 f4 40. Kc1 g4 41. Kc2 f3 42. Kc1 fxg2 43. Kc2 gxh1=Q 44. Kc1 Qxf1+ 45.Kd2 Qxf2+ 46.Kc1 Qg1+ 47.Kc2 Qxh2+ 48.Kc1 and resigned later Qh1+ 49.Kc2 Qb1+ 50.Kd2 g3 51.Qc4+ Qb3 52.Qxb3+ Kxb3 53.e4 Kxb4 54.e5 g2 0-1
</pre>
MATER is written by George Baylor and Simon in FORTRAN. It is able to search to great depths for checkmates. MATER is presently part of the Cooper-Kozdrowicki program. While MATER is an interesting program in its own right, the opportunity to checkmate one's opponent plays a relatively small computational part of the game of chess, and its inclusion in the Cooper-Kozdrowicki program does not seem to add measurably to the program's strength.
=Publications=
=References=
<references />
'''[[Engines|Up one level]]'''
[[Category:Mainframe]]
[[Category:Fortran]]
[[Category:Acronym]]
