Changes

Jump to: navigation, search

Eugen

26 bytes added, 18:27, 16 May 2019
no edit summary
'''Eugen''',<br/>
a chess program developed by [[Eugenio Castillo Jiménez]] to run under [[MS-DOS]]. Eugen participated at the [[WMCCC 1996]] in [https://en.wikipedia.org/wiki/Jakarta Jakarta], the [[WMCCC 1997]] in [https://en.wikipedia.org/wiki/Paris Paris] and the [[WCCC 1999]] in [https://en.wikipedia.org/wiki/Paderborn Paderborn]. Further, Eugen played various [[Spanish Computer Chess Championship|Spanish Computer Chess Championships]], and won the [[SCCC 1996]] <ref>[http://www.csvn.nl/index.php?option=com_content&view=article&id=209%3Aspanje-ccc-1996&catid=19%3Acomputer-computer&Itemid=48&lang=en Spanje CCC 1996], [[CSVN]] tournament site</ref> <ref>[[Eugenio Castillo Jiménez]] ('''1997'''). ''The Spanish Computer-Chess Championship''. [[ICGA Journal#20_1|ICCA Journal, Vol. 20, No. 1]]</ref>.
According to Eugenio <ref>[http://www.rebel.nl/authors.htm Meet the Authors] by [[Ed Schroder|Ed Schröder]]</ref>, Eugen was partially inspired by [[:Category:Open Source|open source programs ]] like [[Turbo Chess]], [[GNU Chess]], and [[Crafty]]. It used 16 bit [[Attack and Defend Maps|attacktables]] which were [[Incremental Updates|incrementally updated]] in every [[Make Move|make]] and [[Unmake Move|unmake move]], the [[Search|search]] uses [[Iterative Deepening|iterative deepening]], and [[Null Move Pruning|recursive nullmove]] ([[Depth Reduction R|R]]=2). [[Álvaro Begué]], who for a short time worked with Eugenio on a computer chess project, mentioned Eugen had a good implementation of the [[Null Move Pruning#NMQS|null-move quiescence]] algorithm <ref>[https://www.stmintz.com/ccc/index.php?id=383312 Re: List is NOT a Crafty clone, ... etc] by [[Álvaro Begué]], [[CCC]], August 21, 2004</ref>, based on the ideas and publications by [[Don Beal]] <ref>[[Don Beal]] ('''1989'''). ''Experiments with the Null Move.'' [[Advances in Computer Chess 5]], a revised version is published ('''1990''') under the title ''A Generalized Quiescence Search Algorithm''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 43, No. 1, edited version in ('''1999'''). ''The Nature of MINIMAX Search''. Ph.D. thesis, IKAT, Chapter 10, pp. 101-116</ref>.
=Descriptions=

Navigation menu