25,161
edits
Changes
no edit summary
'''L'Excentrique''',<br/>
a chess program by [[Claude Jarry]] running on [[Amdahl 470|Amdahl]] mainframe computers <ref>[[Ben Mittman]], [[Monroe Newborn]] ('''1980'''). ''[http://dl.acm.org/citation.cfm?id=358817&dl=ACM&coll=DL&CFID=78577980&CFTOKEN=10389697 Computer chess at ACM 79: the tournament and the man vs. man and machine match]''. [[ACM#Communications|Communications of the ACM]], Vol. 23, Issue 1, [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3.Computer_chess_at_ACM_79/3-1%20and%203-2%20and%203-3.Computer_chess_at_ACM_79.062303018.pdf pdf] from [[The Computer History Museum]]</ref>. It incorporated [[Iterative Deepening|iterative deepening]] with two [[Ply|ply]] increments, to overcome possible inconsistencies introduced by the alternation of attacking and defensive continuations returned by successive [[Odd-Even Effect|even-odd ply]] searches <ref>[[Eric Thé]] ('''1992'''). ''[http://digitool.library.mcgill.ca/R/?func=dbin-jump-full&object_id=56753&local_base=GEN01-MCG02 An analysis of move ordering on the efficiency of alpha-beta search]''. Master's thesis, [[McGill University]], advisor [[Monroe Newborn]]</ref>. Further, the program used pure [[Minimax]] for the first few iterations in order to find and save the strongest continuation for each first level move. On deeper levels, L'Excentrique employs [[Alpha-Beta|alpha-beta]]. Jarry argued that finding the strongest continuation for each first ply move on the initial few iterations results in faster searches on later iterations <ref>[[David Levy]], [[Monroe Newborn]] ('''1982, 1983'''). ''[https://link.springer.com/book/10.1007/978-3-642-85538-2 All About Chess and Computers]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer], [https://rd.springer.com/chapter/10.1007/978-3-642-85538-2_14 Postscript: 1978 – 80 and BELLE The World Champion]</ref>. =Tournament Play=L'Excentrique participated at the [[ACM 1976]], [[ACM 1979]] and [[ACM 1981]], and the [[WCCC 1980|3rd WCCC 1980]] in [http://en.wikipedia.org/wiki/Linz Linz], where it upset reigning champion [[Chess (Program)|Chess 4.9]] in round one, becoming strong fourth only losing from [[Belle]] <ref>[[David Levy]], [[Ben Mittman]], [[Monroe Newborn]] ('''1980'''). ''3rd World Computer Chess Championship''. [[ICGA Journal|ICCA Newsletter]], Vol. 3, No. 3, reprinted in [http://www.computerhistory.org/chess/full_record.php?iid=doc-431614f6c8af8 The Fourth World Computer Chess Championship] (labeled 22nd ACM), [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3%20and%204-3.1983_WCCC/1983-%20WCCC.062303061.sm.pdf pdf] from [[The Computer History Museum]], [http://www.sci.brooklyn.cuny.edu/%7Ekopec/Publications/Publications/O_36_C.pdf pdf] from [[Danny Kopec]]</ref> .
=Photos=