Eugen 7.2 is a program based on a hard selective search extensions algorithm, he don't makes conventional alpha beta pruning and he (in Spanish it's he) uses a special null turn moves in quiescence search. The program consist of about 40.000 C and assembler code lines. Node speed on a Pentium 133Mhz is approximately 12.000 to 30.000 nodes per second. Chess programming is my hobby-job for about last 8 years. Currently Spanish CCC.
1999
Eugen born in 1994 like a personal free time project, initially written in Pascal and assembler, in 1995 it was changed to C language. Eugen is partially inspirated in freeware programs like Turbo Chess, Gnu, and Crafty.
^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. Artificial Intelligence, Vol. 43, No. 1, pp. 85-98. ISSN 0004-3702, edited version in (1999). The Nature of MINIMAX Search. Ph.D. thesis, IKAT, ISBN 90-62-16-6348. Chapter 10, pp. 101-116
Table of Contents
Eugen,
a chess program developed by Eugenio Castillo Jiménez to run under MS-DOS. Eugen participated at the WMCCC 1996 in Jakarta, the WMCCC 1997 in Paris and the WCCC 1999 in Paderborn. Further, Eugen played various Spanish Computer Chess Championships, and won the SCCC 1996 [1] [2].
According to Eugenio [3], Eugen was partially inspirated by freeware programs like Turbo Chess, GNU Chess, and Crafty. It used 16 bit attacktables which were incrementally updated in every make and unmake move, the search uses iterative deepening, and recursive nullmove (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 quiescence algorithm [4], based on the ideas and publications by Don Beal [5].
Descriptions
given on the ICGA tournament page [6]:1997
1999
Selected Games
WMCCC 1997, round 1, Eugen 7.2 - Junior [7]See also
Forum Posts
External Links
References
What links here?
Up one level