Changes

Jump to: navigation, search

Coko

40 bytes removed, 23:18, 27 November 2018
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=
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.
 
=See also=
* [[Various Classifications#Acronym|Acronym]]
=Publications=
=References=
<references />
 
'''[[Engines|Up one level]]'''
[[Category:Acronym]]

Navigation menu