25,161
edits
Changes
Coko
,no edit summary
'''Coko''',
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>. As described by Cooper in the 1971 Panel <ref>[[Ben Mittman]] ('''1971'''). ''[http://www.computerhistory.org/chess/full_record.php?iid=doc-431614f6d1ee8 Computer Chess Programs (Panel)]''. [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-3.computer_chess_panel.mittman/3-1%20and%203-3.computer_chess_panel.mittman_etc.1971.ACM.062303021.pdf pdf] from [[The Computer History Museum]]</ref>, Coko III does not use [[Alpha-Beta]]:
