Wikispaces : chessprogramming - items matching description

Abyss

GerdIsenberg — Sat, 05 Aug 2017 19:27:34 GMT

Home * Engines * Abyss
Home * Games * Chinese Chess Engines * Abyss

		Abyss, a Chinese Chess program by Chun Ye and Tony Marsland, written in C under Unix aka SunOS. A X Window GUI was written in C++ by Haiying Wang ^[1]. The program was subject of Chun Ye's 1992 master thesis at University of Alberta ^[2] on the topic of selectivity and extension heuristics in the domain of Chinese Chess. Not only Ye's advisor, Tony Marsland, contributed to the development of the program, but also Don Beal - at that time visiting professor at University of Alberta - in particular concerning null move quiescence search. Abyss participated at all three Computer Olympiads which took place in Maastricht, winning the gold medal (shared) at the 3rd Computer Olympiad, 1991, while the 1999 version played in 2001 and 2002, respectively.
At the Edge of the Abyss ^[3]

Abyss' ICGA Tournaments

Description

The framework of Abyss ^[4] was based on the Western experimental Chess program Parabelle by Fred Popowich and Tony Marsland ^[5].

Move Generation

Abyss' board is represented as Mailbox - a one-dimensional array of 90 computer words, indexed by 0 .. 89. Pieces are encoded by ±1 for red and black pawns until ±7 for red and black kings, empty squares are represented by zero. To detect the edges of the board and palace during move generation, board arrays of pre-computed 12-bit direction masks consisting of four groups for each orthogonal direction of 3 bits each are utilized. Only the empty intersection of the move direction with the mask of the target square indicates target on board or inside palace, followed by piece specific tests to generate pseudo legal moves or to continue a direction loop for rook or cannon. Detection of strictly legal moves, i.e. it does not expose the own king in check, or does not oppose both kings on the same file with no pieces intervening, is delayed until the move is actually made for efficiency reasons - since not all generated pseudo legal moves are examined.

Search

The search procedure of Abyss was subject of Chun Ye's thesis concerning selectivity, in particular extensions which are combined in various experiments, and further elaborated in two additional papers along with Tony Marsland ^[6] ^[7]. Abyss already featured recursive null move pruning with depth reduction of 1 ^[8], and further Don Beal's null move quiescence search ^[9]. A piece evading move extension was motivated by threat detection concerning the complicated repetition rules of Chinese Chess.

Basics

Move Ordering

Selectivity

Evaluation

Material Balance with Point Values

Piece	Opening	Endgame
King	7000
Rook	1800
Cannon	900	800
Horse	800	900
Elephant	300
Advisor	300
Pawn	100

Piece-Square Tables
Square Control
King Safety
Attacking King Zone
Penalty for King on rank or file of opponent's Cannon

Misc

Opening Book

Abyss' ICGA Tournaments

^[10]

Edition	Version	Ranking	Participants
3rd Computer Olympiad, Maastricht 1991		1	2
6th Computer Olympiad, Maastricht 2001	Abyss '99	3	3
7th Computer Olympiad, Maastricht 2002	Abyss '99	4	4

Publications

Chun Ye (1992). Experiments in Selective Search Extensions. M.Sc. thesis, Department of Computing Science, University of Alberta, pdf
Chun Ye, Tony Marsland (1992). Experiments in Forward Pruning with Limited Extensions. ICCA Journal, Vol. 15, No. 2, pdf
Chun Ye, Tony Marsland (1992). Selective Extensions in Game-Tree Search. Heuristic Programming in AI 3, pdf

External Links

Engine

Abyss' ICGA Tournaments

Misc

References

^ Haiying Wang (1994). An application-oriented user interface model and development system. Ph.D. thesis, University of Alberta, pdf, see 6.2 Chinese Chess Program pp. 101.
^ Chun Ye (1992). Experiments in Selective Search Extensions. M.Sc. thesis, Department of Computing Science, University of Alberta, pdf
^ Lysefjord, Norway- a man standing on Preikestolen at the edge of the Abyss, Image by Mercy, August 2008, CC BY-SA 3.0, Wikimedia Commons
^ Description is based on Chun Ye (1992). Experiments in Selective Search Extensions. M.Sc. thesis, Department of Computing Science, University of Alberta, pdf
^ Fred Popowich, Tony Marsland. (1983) Parabelle: Experience with a Parallel Chess Program. Technical Report 83-7. Computing Science Department, University of Alberta, pdf
^ Chun Ye, Tony Marsland (1992). Experiments in Forward Pruning with Limited Extensions. ICCA Journal, Vol. 15, No. 2, pdf
^ Chun Ye, Tony Marsland (1992). Selective Extensions in Game-Tree Search. Heuristic Programming in AI 3, pdf
^ Gordon Goetsch, Murray Campbell (1990). Experiments with the Null-Move Heuristic. Computers, Chess, and Cognition, pp. 159-168
^ 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.
^ Abyss' ICGA Tournaments

What links here?

Page	Date Edited
3rd Computer Olympiad	Jul 25, 2017
6th Computer Olympiad	Jul 22, 2017
7th Computer Olympiad	Jul 23, 2017
Abyss	Aug 5, 2017
Chun Ye	Jul 25, 2017
Engines	Mar 10, 2018
GUI	Mar 16, 2018
Haiying Wang	Jul 27, 2017
Null Move Pruning	Dec 2, 2017
Parabelle	Jul 28, 2017
Tony Marsland	Nov 27, 2017
University of Alberta	Feb 20, 2018

Up one Level

Achilles

GerdIsenberg — Thu, 31 Dec 2015 10:09:35 GMT

Home * Engines * Achilles

		Achilles, a parallel chess system by Vladan Vučković based on his Axon 3 engine. In July 2007, at the Faculty of Electronic Engineering, University of Niš, Achilles won a four game match versus Grandmaster Igor Miladinović with 3½ - ½, running on a cluster of 12 AMD x64, 1.8 GHz with an own written UDP cluster chess operating system. Game was two hours per side ^[1] . Đorđe Vidanović was responsible for the opening book ^[2] .
Triumphant Achilles ^[3]

Forum Posts

GM Igor Miladinovic (elo 2606) vs Achilles live by Đorđe Vidanović, CCC, July 05, 2007
Achilles 3.5, GM 0.5 by Fernando Villegas, CCC, July 06, 2007
Achilles' games vs other progs, figure out its ELO by Đorđe Vidanović, CCC, July 18, 2007
Cluster chess : not only Grid but also Achilles by Marc Lacrosse, CCC, August 28, 2007
Re: Achilles ... by Frank Quisinsky, CCC, January 07, 2010 » Doch

External Links

Chess Engine

Achilles Home

Misc

References

^ Achilles Home
^ GM Igor Miladinovic (elo 2606) vs Achilles live by Đorđe Vidanović, CCC, July 05, 2007
^ Franz von Matsch, 1892, Triumphant Achilles: Achilles dragging the dead body of Hector in front of the gates of Troy, The original painting is a fresco on the upper level of the main hall of the Achilleion at Corfu, Greece

What links here?

Page	Date Edited
Achilles	Dec 31, 2015
Axon	Jul 14, 2013
Cheiron	Jan 7, 2016
Chiron	Sep 24, 2017
Engines	Mar 10, 2018
Fernando Villegas	Aug 15, 2016
Hector	Nov 11, 2016
Hector for Chess	Jan 7, 2016
Nibble	Jan 25, 2015
Ulysses	Nov 1, 2016
Vladan Vučković	Feb 10, 2016
Who's Who	Sep 6, 2017
Đorđe Vidanović	Feb 20, 2017

Up one level

Adam

GerdIsenberg — Tue, 24 Feb 2015 14:07:24 GMT

Home * Engines * Adam

		Adam, a chess engine by Dominique Longbien, written in C++, and first released in June 2002 as WinBoard engine ^[1]. Adam 3.3, released in March 2011, is compatible with UCI only. Adam was active over the board from 2002 until 2006 in participating several French Computer Chess Championship and French Programmers Tournaments. At the FCCC 2003, running in a Pentiom 3, 1.3 GHz, Adam searched about 250 KNPS ^[2].
Michelangelo: Creation of Adam ^[3]

Forum Posts

WB Engine 150, Adam by Dominique Longbien (France) is available by Frank Quisinsky, Winboard Forum, June 05, 2002
adam.exe,any chance for a non enchanched compile for us by mike schoonover, Winboard Forum, June 06, 2002
To Dominique Longbien: About Adam ... by Carlos, Winboard Forum, October 11, 2002
Help nalimov implementation by Dominique Longbien, Winboard Forum, April 16, 2003

External Links

Chess Engine

Adam from WBEC Ridderkerk
Adam 3.3 in CCRL 40/40

Misc

References

^ WB Engine 150, Adam by Dominique Longbien (France) is available by Frank Quisinsky, Winboard Forum, June 05, 2002
^ CHESS WIZARD Champion de France 2003 !
^ Detail of Michelangelo's The Creation of Adam, Fresco Sistine Chapel ceiling ca. 1512, source: Web Gallery of Art, Wikimedia Commons

What links here?

Page	Date Edited
Adam	Feb 24, 2015
Dominique Longbien	Aug 20, 2015
Engines	Mar 10, 2018
FCCC 2003	Jan 26, 2013
FCCC 2004	Jun 16, 2013
Massy 2002	Jan 2, 2018
Massy 2003	Jan 27, 2013
Massy 2004	Oct 27, 2016
Massy 2006	Jan 29, 2013
PixChess	Oct 27, 2016

Up one Level

Anubis

GerdIsenberg — Tue, 29 Sep 2015 19:22:39 GMT

Home * Engines * Anubis

		Anubis, a private WinBoard compliant chess engine by José Carlos Martínez Galán, its development started in 2003 as successor of Averno. Anubis is a bitboard engine, and in its first version generated sliding piece attacks using Kogge-Stone-like algorithms ^[1]. Completely re-written in 2012 ^[2], Anubis played some private tournaments by Sergio Martinez ^[3].
Anubis ^[4]

Forum Posts

Re: Surprising performance {to me} by GLC 3 verses Comet B60 by Jose Carlos, Winboard Forum, April 02, 2003
Endgame test series by Jose Carlos, Winboard Forum, April 08, 2003
Re: Attack table by Jose Carlos, Winboard Forum, October 07, 2004
C++ templates question by José C. Martínez Galán, CCC, January 18, 2012
Re: Ponder=on in cutechess-cli? by José C. Martínez Galán, CCC, April 04, 2012

External Links

References

^ Re: Attack table by Jose Carlos, Winboard Forum, October 07, 2004
^ Re: Ponder=on in cutechess-cli? by José C. Martínez Galán, CCC, April 04, 2012
^ Spain Individual Championship by Sergio Martinez, CCC, October 22, 2012
^ Anubis, the jackal headed god of Ancient Egypt, Image by Jeff Dahl, December 21, 2007, CC BY-SA 4.0, based on New Kingdom tomb paintings, in Richard H. Wilkinson (2003). The complete gods and goddesses of ancient Egypt. Thames & Hudson, Wikimedia Commons, Anubis from Wikipedia

What links here?

Page	Date Edited
Anubis	Sep 29, 2015
Averno	Sep 28, 2015
CXG Sphinx	Jun 23, 2017
Engines	Mar 10, 2018
Influence Quantity of Pieces	Jul 21, 2017
José Carlos Martínez Galán	Feb 19, 2017
Pharaon	Sep 2, 2017
Sfinks	Dec 25, 2017

Up one level

Arachne

GerdIsenberg — Sun, 22 May 2016 20:19:43 GMT

Home * Engines * Arachne

		Arachne, an experimental chess program by Maarten van der Meulen and chess testbed of his research on search algorithms, like Alpha-Beta, and the best-first algorithms SSS, Conspiracy number and Proof-number search, including parallel Conspiracy number search ^[1] for instance in 1988 on a 10-processor system ^[2], and evaluation ^[3]. In his ICCA Journal paper ^[4] , Maarten van der Meulen mentions experiments with cn-search as published in 1988 by David McAllester ^[5] in Arachne not encouraging ^[6] , and introduced a new variation dubbed applied cn-search* ^[7]. Arachne played six consecutive Dutch Computer Chess Championships from 1985 until 1990.
Gustave Doré: Arachne ^[8]

Selected Games

Dappet

DOCCC 1989, round 1, Dappet - Arachne ^[9]

[Event "DOCCC 1989"]
[Site "Leiden NED"]
[Date "1989.10.??"]
[Round "01"]
[White "Dappet"]
[Black "Arachne"]
[Result "1-0"]
 
1.e4 e5 2.Nf3 Nc6 3.Bc4 Nf6 4.Ng5 d5 5.exd5 Nxd5 6.d4 f6
7.dxe5 Ncb4 8.exf6 Nxf6 9.Bf7+ Ke7 10.Qe2+ Kd6 11.Qd2+ Nbd5
12.Bxd5 Qe8+ 13.Ne4+ Ke7 14.O-O Nxe4 15.Bxe4 Qa4 16.Re1 Be6
17.Bd5 Qd7 18.Rxe6+ Kd8 19.Bxb7 Qxd2 20.Nxd2 Rb8 21.Bc6 Be7
22.Nb3 Rf8 23.Be3 Bd6 24.Bxa7 Rb4 25.Rae1 Bxh2+ 26.Kxh2 Rbf4
27.Re8+ Rxe8 28.Rxe8# 1-0

Duck

DOCCC 1989, round 2, Arachne - Duck ^[10]

[Event "DOCCC 1989"]
[Site "Leiden NED"]
[Date "1989.10.??"]
[Round "2"]
[White "Arachne"]
[Black "Duck"]
[Result "1-0"]
 
1.d4 a6 2.e4 Nf6 3.e5 Nd5 4.c4 Nb4 5.Qd2 e6 6.Be2 d5 7.cxd5 Nxd5 8.Nf3 Nc6
9.O-O Be7 10.Nc3 Rf8 11.Qc2 Nxc3 12.bxc3 h5 13.Qh7 g5 14.Qxh5 Rg8
15.Be3 Bd7 16.h3 Na5 17.Qg4 Kf8 18.h4 Bc6 19.Nxg5 Rg7 20.Nxe6+ fxe6
21.Bh6 Bf6 22.exf6 Qxf6 23.Qxg7+ Qxg7 24.Bxg7+ Kxg7 25.Bg4 Rh8
26.h5 Be8 27.Rab1 Bxh5 28.Bxe6 Bg6 29.Rb2 Re8 30.Re1 Bf5 31.Re5 Rxe6
32.Rxf5 b6 33.g3 Re1+ 34.Kg2 Rc1 35.Rf3 Re1 36.Rb4 Re2 37.a3 Ra2 38.a4 Rd2
39.Re3 Kf6 40.Kf3 Kf7 41.g4 Rc2 42.d5 Rd2 43.Rf4+ Kg8 44.c4 c6 45.Re8+ Kg7
46.Re7+ Kg8 47.Rf6 cxd5 48.cxd5 Nc4 49.Rc6 Kf8 50.Re4 b5 51.Re2 Rxd5
52.Rxa6 bxa4 53.Rxa4 Rd4 54.Ra7 Rd5 55.Kf4 Rd6 56.g5 Nb6 57.f3 Nd7
58.Kf5 Rd4 59.Ra8+ Nb8 60.Rxb8+ Kf7 61.g6+ Kg7 62.Re7+ Kh6 63.Rh8# 1-0

Publications

Arachne

Maarten van der Meulen (1988). Parallel Conspiracy-Number Search. M.Sc. thesis, Faculty of Mathematics and Computer Science, Vrije Universteit, Amsterdam.
Maarten van der Meulen (1989). Weight Assessment in Evaluation Functions. Advances in Computer Chess 5
Maarten van der Meulen (1990). Conspiracy-Number Search. ICCA Journal, Vol. 13, No. 1
Maarten van der Meulen, Victor Allis, Jaap van den Herik (1990). A Comment on `Conspiracy-Number Search'. ICCA Journal, Vol. 13, No. 2

Arachne elsewhere

Raphael Finkel, Marvin Solomon (1980). The Arachne Kernel. Version 1.2 Technical Report 380, University of Wisconsin-Madison, pdf
Raphael Finkel, John Philip Fishburn (1980). Parallel Alpha-Beta Search on Arachne. IEEE International Conference on Parallel Processing, pp. 235-243. pdf

External Links

Chess Program

The chess games of Arachne (Computer) from chessgames.com

Misc

Arachne from Wikipedia
Arachne (disambiguation) from Wikipedia
Arachne - Dictionary of Greek Mythology
Myth Man's Arachne Page
Arachnid from Wikipedia
Arachnophobia from Wikipedia
Arachnoid (astrogeology) from Wikipedia
Arachne (web browser) from Wikipedia
Toto Blanke - Lady's Bicycle Seat Smeller, Spider's Dance (1975), YouTube Video
feat. John Lee, Gerry Brown, Joachim Kühn, Charlie Mariano

References

^ Maarten van der Meulen (1988). Parallel Conspiracy-Number Search. M.Sc. thesis, Faculty of Mathematics and Computer Science, Vrije Universteit, Amsterdam
^ Dap Hartmann (1988). Report on the 8th Dutch National Computer-Chess Championship. ICCA Journal, Vol. 11, No. 4 » DOCCC 1988
^ Maarten van der Meulen (1989). Weight Assessment in Evaluation Functions. Advances in Computer Chess 5
^ Maarten van der Meulen (1990). Conspiracy-Number Search. ICCA Journal, Vol. 13, No. 1
^ David McAllester (1988). Conspiracy Numbers for Min-Max Search. Artificial Intelligence, Vol. 35, No. 1, pp. 287-310. ISSN 0004-3702.
^ Dap Hartmann, Peter Kouwenhoven (1989). The 9th Dutch Computer-Chess Championship. ICCA Journal, Vol. 12, No. 4 » DOCCC 1989
^ Maarten van der Meulen, Victor Allis, Jaap van den Herik (1990). A Comment on `Conspiracy-Number Search'. ICCA Journal, Vol. 13, No. 2
^ Illustration by Gustave Doré, 1861, for Dante's Inferno, Cultural depictions of spiders from Wikipedia, Arachne from Wikipedia.de (German)
^ The chess games of Arachne (Computer) from chessgames.com
^ Downloads | Open Dutch Computer Chess Championships | Games

What links here?

Page	Date Edited
Arachne	May 22, 2016
Conspiracy Numbers	Dec 29, 2017
DOCCC 1985	Dec 9, 2016
DOCCC 1986	Dec 9, 2016
DOCCC 1987	Dec 9, 2016
DOCCC 1988	Aug 15, 2015
DOCCC 1989	Aug 15, 2015
DOCCC 1990	Aug 15, 2015
Engines	Mar 10, 2018
m1.0	May 22, 2016
Maarten van der Meulen	Dec 13, 2016
P.ConNerS	Dec 22, 2016
Sun	Jun 7, 2016
Ulysses	Nov 1, 2016
Profile of allusiveness : Arachne and Athena	Nov 21, 2013

Up one Level

Ares

GerdIsenberg — Thu, 09 Jun 2016 09:39:02 GMT

Home * Engines * Ares

		Ares, a chess program of the early 90s by Frans van Gool and Erik Leenders written in ANSI C. Ares played three Dutch Open Computer Chess Championships, the DOCCC 1990, the DOCCC 1991 and the DOCCC 1992, running on a SUN-SPARCstation 670 ^[1] , as well in the C-Language Division of Don Beal's Uniform-Platform Computer Chess Championship in 1992.
Ares ^[2]

Namesake

Ares by Charles Roberson ^[3]

External Links

References

^ Deelnemers NK Computerschaak 1992 by Dennis Breuker
^ Helmeted young warrior, so-called Ares. Roman copy from a Greek original—this is a plaster replica, the original is now stored in the Museum of the Villa Canope at the Villa Adriana in Tivoli, Ares from Wikipedia
^ Ares 1.0 in honor of the NASA Ares I-X Space Rocket by Charles Roberson, CCC, October 31, 2009

What links here?

Page	Date Edited
Ares	Jun 9, 2016
Ares US	Sep 20, 2016
DOCCC 1990	Aug 15, 2015
DOCCC 1991	Aug 15, 2015
DOCCC 1992	Dec 12, 2016
Engines	Mar 10, 2018
Frans van Gool	Nov 4, 2015
UPCCC 1992	Mar 9, 2012

Up one Level

Ares US

GerdIsenberg — Tue, 20 Sep 2016 20:47:18 GMT

Home * Engines * Ares

		Ares, an UCI compliant chess engine by Charles Roberson released in 2009 in honor of the NASA Ares I-X space rocket ^[1]. It runs under Windows and was developed under Linux.
Ares I-X ^[2]

Namesake

Ares by Frans van Gool and Erik Leenders

Forum Posts

Ares 1.0 in honor of the NASA Ares I-X Space Rocket by Charles Roberson, CCC, October 31, 2009
Test tournament: Ares by Harun Taner, CCC, December 22, 2009
Ares 1.004 by Charles Roberson, CCC, April 24, 2010
Ares 1.004 : 2273 - ChessMind 0.80 : 2049 by Patrick Buchmann, CCC, May 01, 2010 » ChessMind
Ares 1.005 available by Charles Roberson, CCC, May 23, 2014
New Ares Coming by Charles Roberson, CCC, October 28, 2015

External Links

Chess Engine

Ares Chess 1.005.2 by Charles Roberson
Ares Chess 1.005 by Charles Roberson
Charles Roberson Ares-Page hosted by Thorsten Czub
Ares 1.005 64-bit in CCRL 40/40

Misc

References

^ Ares 1.0 in honor of the NASA Ares I-X Space Rocket by Charles Roberson, CCC, October 31, 2009
^ Rollout of Ares I-X at Kennedy Space Center Launch Complex 39 secured by four bolts on a mobile launcher platform, Author: NASA/Kim Shiflett, Source: NASA Kennedy Media Gallery, Ares I-X from WIkipedia

What links here?

Page	Date Edited
Ares	Jun 9, 2016
Ares US	Sep 20, 2016
Charles Roberson	Jan 7, 2016
ChessMind	Sep 20, 2016
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Harun Taner	May 17, 2015
NoonianChess	Jan 7, 2016
Telepath	Jul 14, 2014

Up one Level

Argonaut

GerdIsenberg — Tue, 16 Apr 2013 06:58:13 GMT

Home * Engines * Argonaut

		Argonaut, a private chess engine by Ralf Dörr and as successor of Nexus written in Delphi. Argonaut played the IPCCC 2005 b and the ICT 2006 over the board.
Argonauta sp. ^[1]

Photos & Games

Neurosis

ICT 2006, round 4, Argonaut - Neurosis ^[2]

[Event "ICT 2006"]
[Site "Leiden, NED"]
[Date "2006.05.06"]
[Round "04"]
[Result "1-0"]
[White "Argonaut"]
[Black "Neurosis"]
 
1.e4 e5 2.Nf3 Nc6 3.d4 exd4 4.Nxd4 Qh4 5.Nb5 Qxe4+ 6.Be2 Kd8 7.O-O a6 
8.N1c3 Qe5 9.Nd5 axb5 10.Bf4 Qxb2 11.Bxc7+ Ke8 12.Nb6 Qa3 13.Re1 Bb4 
14.Bg4+ Nge7 15.Re3 Qa5 16.Nd5 Qa6 17.Nxb4 Nxb4 18.Bd6 Nbc6 19.Qe2 Ne5 
20.Rd1 Kd8 21.Rxe5 Ng6 22.Rc5 Qb6 23.Qe3 Ra6 24.Qg3 Qxc5 25.Bxc5 Rc6 
26.Bxd7 1-0

Hermann

Volker Annuss and Ralf Dörr in Hermann vs. Argonaut, ICT 2006 ^[3] ^[4]

[Event "ICT 2006"]
[Site "Leiden NED"]
[Date "2006.05.07"]
[Round "08"]
[White "Hermann"]
[Black "Argonaut"]
[Result "1-0"]
 
1.e4 e5 2.d4 exd4 3.c3 dxc3 4.Bc4 cxb2 5.Bxb2 Qe7 6.Nd2 Nc6 7.Ngf3 Nf6
8.O-O Na5 9.e5 Nh5 10.Bd3 Nf4 11.Be4 Nc6 12.Nb3 Qb4 13.Re1 Ne6 14.Qc2 Qb6 
15.h3 Nb4 16.Qc4 a5 17.a3 Nc6 18.Qc2 a4 19.Nc1 Be7 20.Ne2 Qb3 21.Qd2 Nc5 
22.Bf5 O-O 23.Nf4 g6 24.Nh5 1-0

Forum Posts

Pdb.. Argonaut-Shredder 0-1 by Rick Hagen, CCC, December 27, 2005 » IPCCC 2005 b, Shredder
Paderborn: Rybka - Argonaut = 1- 0 by Christian Koch, CCC, December 29, 2005 » Rybka

External Links

Chess Engine

The chess games of Argonaut from chessgames.com

Misc

References

^ Argonauta sp., Drawing by Ewald Rübsamen in Carl Chun (1910). Die Cephalopoden. (German), Argonaut (animal) from Wikipedia
^ Argonaut vs Neurosis from chessgames.com
^ 6th International CSVN Tournament 2006 - Photo Gallery
^ Downloads | CSVN International Computerchess Tournament | Games | ICT Leiden 2006, CSVN site

What links here?

Page	Date Edited
Argonaut	Apr 15, 2013
Engines	Mar 10, 2018
Hermann	Dec 7, 2017
ICT 2006	Oct 14, 2015
IPCCC 2005 b	Apr 15, 2013
Ralf Dörr	Jan 7, 2016
Volker Annuss	Aug 3, 2017

Up one Level

Arion

GerdIsenberg — Fri, 28 Nov 2014 16:22:44 GMT

Home * Engines * Arion

		Arion, an UCI compliant chess engine by Gabriel Guillory, written in C++, first released in December 2004. Arion had its over the board debut at the Seventh French Programmers Tournament, Massy 2005, and otherwise participates at Le Fou numérique and other rating lists.
Arion on a Dolphin ^[1]

Features

^[2]

Bitboards
Legal Move Generation
Iterative Deepening
NegaScout
Aspiration Windows
Transposition Table
Null Move Pruning
Futility Pruning
MVV/LVA
Razoring
Internal Iterative Deepening
History Heuristic
Killer Heuristic
Extensions (Standard & Non-standard)
Static Exchange Evaluation (Simple + Full)
Enhanced Transposition Cutoff
History Pruning
Lazy Evaluation
Adaptive Contempt Factor
Pondering
PGN analyzer
Perft

Forum Posts

questions about the new Arion engine by Dave, Winboard Forum, December 14, 2004
Arion 1.3 : 2359 by Patrick Buchmann, Winboard Forum, March 11, 2005
Arion 1.6 by Gabriel Guillory, Winboard Forum, September 09, 2005
Arion 1.7 + PgnScanner 0.32 by Gabriel Guillory, Winboard Forum, March 07, 2006
New link for Arion and PgnScanner by Gabriel Guillory, Winboard Forum, July 26, 2006

External Links

Chess Engine

Misc

References

^ Arion on a Dolphin, watercolor painting by Matthäus Kern, Illustration for Joseph Christian Freiherr von Zedlitz (1841). Der arme Sänger. (German)
^ based on Arion chess program, slightly edited

What links here?

Page	Date Edited
Arion	Nov 28, 2014
Dolphin	Nov 28, 2014
Engines	Mar 10, 2018
Gabriel Guillory	Sep 9, 2016
Massy 2005	Jan 29, 2013

Up one level

AtlanChess

GerdIsenberg — Thu, 15 Sep 2016 15:41:58 GMT

Home * Engines * AtlanChess

		AtlanChess, a WinBoard chess engine by Grant Osborne. The 32-bit Windows version 3.3 from 2005 is available from Ron Murawski's download site ^[1]. AtlanChess 5.52 played Olivier Deville's ChessWar XVII E in 2010/11 ^[2] ^[3].
Atlantis ^[4]

Forum Posts

AtlanChess problem/bug finally found? by Günther Simon, Winboard Forum, June 29, 2006
Results of Crafty 22.0, Sloppy 0.2.0 and Atlanchess 4.1 by Tony Thomas, CCC, February 24, 2008 » Crafty, Sloppy

External Links

Chess Engine

Misc

References

^ Engine Download List hosted by Ron Murawski
^ ChessWar XVII E 40m/20' - List of participants
^ ChessWar XVII E : final standings by Olivier Deville, OpenChess Forum, December 23, 2011
^ Poems by Janus Djurhuus - Atlantis, Stamp FO 493 of Postverk Føroya, Faroe Islands, September 20, 2004, Artist: Anker Eli Petersen, Wikimedia Commons, Atlantis from Wikipedia

What links here?

Page	Date Edited
AtlanChess	Sep 15, 2016
Embla	Dec 3, 2017
Engines	Mar 10, 2018
Grant Osborne	Dec 2, 2011
Sloppy	Sep 17, 2016

Up one Level

Atlas

GerdIsenberg — Sun, 05 Nov 2017 10:23:37 GMT

Home * Engines * Atlas

		Atlas, an early chess program written in 1967 by Alex Bell at Atlas Computer Laboratory, Chilton. It was basically a resurrected, cleaned up Algol version of Bell's and Barricelli's old program from the early 60s to test evolutionary theories, which had an evaluation function based purely on mobility - at that time the first fully legal chess program to run in England ^[1], and likely also the base of Barricelli's WCCC 1974 entry Freedom. Atlas, running on an ICL Atlas computer ^[2], looked three plies ahead with alpha-beta, and would accept almost any captures in that depth with weighting on swaps of the more powerful pieces, i.e. it would always swap a queen for a queen. If no captures were present it prepared to castle or mini-maximised its mobility. A slight modification prevented it from moving its queen in the first 5 moves ^[3]. Atlas played a few sparring games against Lancaster ^[4], John Scott's program, then dubbed "Scott" ^[5], and largely suffered from horizon effect.
Atlas and the Hesperides ^[6]

Move Generation

A description of Atlas' move generation techniques along with a mate-in-two solver is given with Algol source code listing in Games Playing with Computers, 3.1 Chess ^[7]. Atlas uses two distinct 8x8 boards [1:65] and piece lists [O:16] for white and black man with identical piece coding, passing the boards per reference as 'mymanin' or 'opponents' dependent on side to move. Pre-calculated rook and bishop tables contain one vector of direction increments, i.e. east (+1), west (-1), north (+8), and south (-8) for rooks, and further for each square a vector of ray-direction terminal destination squares. The embedded routine 'rookorbishopmove' in scope of the outer move generation routine loops over all four directions, gets increment and terminal target square from the rook or bishop table, and iterates the destination along the ray. Inside the ray-loop it tests whether the target is occupied by an own man, to terminate the ray-loop, otherwise it stores the move, and then tests to break after a capture or even an illegal king capture with an extra exit 'cutoff'.

procedure rookorbishopmove(rookorbishop);
  integer array rookorbishop;
  begin 
    for j := 0 step 1 until 3 do
    begin 
      k := rookorbishop[j]; k is increment:
      l := rookorbishop[4 * square + j]; l is terminal square
      for i := square + k step k until l do 
      begin 
        if mymanin[i] ≠ 0 then goto newdirection;
        c := c+1;
        moves[c] := i;
        if opponents[i] ≠ 0 then 
        begin
          if opponents[i] = 6 then goto cutoff else goto newdirection
        end
      end;
newdirection:
    end
  end of rookorbishopmove;

Master

In the early 70s, Atlas evolved to Master in collaboration with Peter Kent, and later with John Birmingham and chess expert John Waldron, while Alex Bell finally left Chilton.

Namesake

Atlas by Andrés Manzanares Campillo

Publications

Alex Bell (1972). Games Playing with Computers. Allen & Unwin, index
Alex Bell (1978). The Machine Plays Chess? Pergamon Press, amazon

External Links

Chess Program

Games Playing with Computers | Chapter 3: Board Games, in Alex Bell (1972). Games Playing with Computers. Allen & Unwin
MASTER at IFIPS. Excerpt from Alex Bell (1978). The Machine Plays Chess?. Pergamon Press, hosted by Atlas Computer Laboratory from Rutherford Appleton Laboratory (RAL)

Misc

References

^ MASTER at IFIPS. Excerpt from Alex Bell (1978). The Machine Plays Chess?. Pergamon Press, hosted by Atlas Computer Laboratory from Rutherford Appleton Laboratory (RAL)
^ Atlas Computer Laboratory, hosted by Rutherford Appleton Laboratory (RAL)
^ MASTER at IFIPS. Excerpt from Alex Bell (1978). The Machine Plays Chess?. Pergamon Press, hosted by Atlas Computer Laboratory from Rutherford Appleton Laboratory (RAL)
^ John J. Scott (1969). Lancaster vs. Mac Hack. ACM SIGART Bulletin, Vol. 16
^ Chess programs: Scott from Alex Bell (1972). Games Playing with Computers. Allen & Unwin
^ Atlas and the Hesperides by John Singer Sargent, between circa 1922 and circa 1925, current location: Museum of Fine Arts, Boston, Wikimedia Commons
^ Games Playing with Computers | Chapter 3: Board Games, in Alex Bell (1972). Games Playing with Computers. Allen & Unwin

What links here?

Page	Date Edited
Alex Bell	Mar 1, 2017
AtlanChess	Sep 15, 2016
Atlas	Nov 5, 2017
Atlas (ESP)	Jan 28, 2018
Atlas Computer Laboratory	Feb 10, 2015
Engines	Mar 10, 2018
John J. Scott	Aug 30, 2016
Lancaster	Aug 30, 2016
Master	Dec 28, 2017
Move Generation	Jan 29, 2018
Peter Kent	Jan 7, 2016
Table-driven Move Generation	Feb 19, 2017

Up one Level

Atlas (ESP)

GerdIsenberg — Sun, 28 Jan 2018 09:27:00 GMT

Home * Engines * Atlas

		Atlas, an UCI compliant chess engine by Andrés Manzanares Campillo written in C++, with executables running under Linux and Windows. The development of Atlas started in 2004, initially representing the board as 0x88 vector attacks mailbox along with piece-lists, supporting WinBoard, and written in C. Atlas 2.90 was a complete rewrite released in June 2011, a bitboard approach only supporting UCI ^[1].
Sculpture of Atlas ^[2]

Features

^[3]

Board Representation

Search

Iterative Deepening
Aspiration Windows (unsymmetrical)
Principal Variation Search
Quiescence Search
Null Move Pruning with R==3 and Verification
Futility Pruning
SEE Pruning
Late Move Reductions
Check Extensions
Singular Extensions (3.90)
Transposition Table
History Heuristic

Evaluation

Namesake

Atlas by Alex Bell

Forum Posts

2005 ...

Atlas 2 Winboard Engine crashes in Arena GUI by Marc Darius, Winboard Forum, April 20, 2005
Atlas 2.20 hash usage by Graham Banks, Winboard Forum, August 27, 2006
Confused with Atlas 2.20- Help Appreciated by George Speight, Winboard Forum, January 12, 2007

2010 ...

Atlas 3.60 Release by Andrés Manzanares, CCC, November 18, 2013
Atlas 3.70em Release by Andrés Manzanares, CCC, July 20, 2014

2015 ...

Atlas 3.80 release by Andrés Manzanares, CCC, February 06, 2015
Atlas 3.90 release by Andrés Manzanares, CCC, January 22, 2018
Atlas 3.91 (bugfix version) by Andrés Manzanares, CCC, January 26, 2018

External Links

Chess Engine

Misc

References

^ Progreso - Atlas
^ Sculpture of Atlas, Praza do Toural, Santiago de Compostela, Photo by Luis Miguel Bugallo Sánchez, October 18, 2005, CC BY-SA 3.0, Wikimedia Commons, Atlas (mythology) from Wikipedia
^ Features of Atlas 3.80 based on Atlas - Home and Atlas 3.80 release by Andrés Manzanares, CCC, February 06, 2015
^ Atlas - Home - Agradecimientos

What links here?

Page	Date Edited
Andrés Manzanares Campillo	Nov 6, 2017
Atlas	Nov 5, 2017
Atlas (ESP)	Jan 28, 2018
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018

Up one Level

Averno

GerdIsenberg — Mon, 28 Sep 2015 15:17:59 GMT

Home * Engines * Averno

		Averno, a Chess Engine Communication Protocol aka WinBoard compatible chess engine by José Carlos Martínez Galán written in C++ ^[1]. The development started in 1999, using a simple 8x8 Board representation (board[64]) ^[2], later evolving to 0x88 ^[3]. Averno played the ten first CCT Tournaments from 2000 to 2008. The name Averno refers to Lake Avernus (Lago d'Averno) in the Avernus crate near Naples, that the Romans mythologized as the entrance to the underworld.
Lago d'Averno ^[4]

Forum Posts

Averno by José Carlos, CCC, September 05, 1999
Averno by José Carlos, CCC, September 14, 1999
Averno 0.18b by José Carlos, Winboard Forum, September 27, 1999
Averno's sources by José Carlos, CCC, November 03, 1999
Averno 0.31 is ready for download by José Carlos, CCC, September 24, 2000
Averno 0.31 source code in my web page by José Carlos, CCC, October 08, 2000
First weekend of CCT4 from Averno's viewpoint by José Carlos, CCC, January 21, 2002 » CCT4
Averno in CCT4 - Second weekend by José Carlos, CCC, January 29, 2002

External Links

Chess Engine

Misc

References

^ Re: Engines written in which programming language? by Dann Corbit, Winboard Forum, June 02, 2009
^ Averno by José Carlos, CCC, September 14, 1999
^ Re: Surprising performance {to me} by GLC 3 verses Comet B60 by Jose Carlos, Winboard Forum, April 02, 2003
^ Lake Avernus by Richard Wilson c. 1765, National Gallery of Victoria, Melbourne, Wikimedia Commons, Lake Avernus from Wikipedia

What links here?

Page	Date Edited
Anubis	Sep 29, 2015
Averno	Sep 28, 2015
CCT1	Dec 30, 2012
CCT10	May 5, 2013
CCT2	Sep 7, 2012
CCT3	Feb 14, 2013
CCT4	Apr 22, 2013
CCT5	Feb 22, 2013
CCT6	May 29, 2014
CCT7	Dec 16, 2017
CCT8	Apr 6, 2013
CCT9	Aug 25, 2013
Engines	Mar 10, 2018
José Carlos Martínez Galán	Feb 19, 2017
SCCC 1999	Aug 15, 2015

Up one Level

Bagatur

GerdIsenberg — Sat, 10 Sep 2016 21:15:53 GMT

Home * Engines * Bagatur

		Bagatur, a free open source chess program under the Eclipse Public License ^[1] written in Java by Krasimir Topchiyski from Bulgaria. The project has started around year 2000. The engine is quite strong, for example the ELO of version 1.4d is about 2500 based on CCRL ^[2] . The open source project is hosted at GitHub ^[3] , where one can find everything relevant like downloads and java source code of the program. Under Windows and Linux the program hasn't its own user interface and uses arbitrary UCI user interfaces like Arena. Under Android there is a game called Chess Art For Kids ^[4] with an own GUI, which incorporates Bagatur as a chess engine.
One of Bagatur's Logos

Etymology

Technical Information

Etymology

Bagatur (βαγατουρ or βογοτορ) is a higher rank of proto-Bulgarian warrior. According to some authors the word comes from Turkic (bagadur) and literally means brave, brave man. According to the same in the Russian language will pass as Богатыри - hero.

Technical Information

The programming code is structured in multiple Java modules / APIs, which could be used separately, including modules for experiments with Artificial Intelligence and Machine Learning. More details could be found inside the readme files of each sub-project of the programming code ^[5]. Here are some of the algorithms and heuristics applied in Bagatur:

Selectivity

Tables

Misc
- Board Representation - mix between Arrays and Bitboards
- Opening Book
- Gaviota endgame tablebases

Forum Posts

BagaturChess -an interesting chess engine by Ruxy Sylwyka, CCC, August 11, 2011
BagaturChess 1.2c (Java) by Krasimir Topchiyski by Ruxy Sylwyka, CCC, December 04, 2011
Check Latest Bagatur Version! by George Speight, CCC, September 15, 2012

External Links

Chess Engine

Misc

References

What links here?

Page	Date Edited
Bagatur	Sep 10, 2016
Chess Art For Kids	Sep 13, 2016
Engines	Mar 10, 2018
Krasimir Topchiyski	Sep 9, 2016

Up one Level

Betsabe

GerdIsenberg — Sun, 23 Jul 2017 08:03:33 GMT

Home * Engines * Betsabe

		Betsabe II, (Betsabe, Betsabé II) a Chess Engine Communication Protocol compliant open source chess engine under the GPL written by Juan Benitez in C, able to run under Windows, Linux, Mac OS and Android platforms. Betsabe II is successor of Betsabe, which already played various Spanish Computer Chess Championships in the 90s, notably the SCCC 1993 where it became first Spanish Champion with a 100% score, and the SCCC 1994 as runner-up behind Zeus II. Betsabe was initially based on Dieter Steinwender and Chrilly Donninger's program Minimax ^[1], but differences in search and evaluation are substantial.
Betsabé ^[2]

Description

Board Representation

Betsabe II maintains a 10x12 board as internal board representation and to generate moves. Definition of (part of) the initial position ^[3]:

const int Tablero_Inicio[120] =  {
FUERA, FUERA,  FUERA,  FUERA,  FUERA,  FUERA,  FUERA,  FUERA,  FUERA, FUERA,
FUERA, FUERA,  FUERA,  FUERA,  FUERA,  FUERA,  FUERA,  FUERA,  FUERA, FUERA,
FUERA,  T_B,    C_B ,   A_B ,   D_B ,   R_B ,   A_B ,   C_B ,   T_B,  FUERA,
FUERA,  P_B,    P_B ,   P_B ,   P_B ,   P_B ,   P_B ,   P_B ,   P_B,  FUERA,
FUERA, VACIO,  VACIO,  VACIO,  VACIO,  VACIO,  VACIO,  VACIO,  VACIO, FUERA,
FUERA, VACIO,  VACIO,  VACIO,  VACIO,  VACIO,  VACIO,  VACIO,  VACIO, FUERA,
FUERA, VACIO,  VACIO,  VACIO,  VACIO,  VACIO,  VACIO,  VACIO,  VACIO, FUERA,
FUERA, VACIO,  VACIO,  VACIO,  VACIO,  VACIO,  VACIO,  VACIO,  VACIO, FUERA,
FUERA,  P_N ,   P_N ,   P_N ,   P_N ,   P_N ,   P_N ,   P_N ,   P_N,  FUERA,
FUERA,  T_N,    C_N ,   A_N ,   D_N ,   R_N ,   A_N ,   C_N ,   T_N,  FUERA,
FUERA, FUERA,  FUERA,  FUERA,  FUERA,  FUERA,  FUERA,  FUERA,  FUERA, FUERA,
FUERA, FUERA,  FUERA,  FUERA,  FUERA,  FUERA,  FUERA,  FUERA,  FUERA, FUERA};

Search

Betsabe II applies PVS with transposition table inside an iterative deepening fractional ply framework in conjunction with mate distance pruning, IID, adaptive null move pruning, LMR, razoring, futility pruning, SEE pruning in quiescence, and check- and capture extensions with transitions to pawn endings. Move ordering is enhanced by history- and killer heuristic with two ordinary killer moves and one mate killer per ply.

Evaluation

The evaluation might be lazy using material and piece-square tables with respect to bounds, and otherwise considers mobility, pawn structure, king safety and various piece terms.

Selected Games

SCCC 1999, round 7, Betsabe - Genesis ^[4]

[Event "SCCC 1999"]
[Site "Parets del Valles"]
[Date "29.12.99"]
[Round "7"]
[White "Betsabe"]
[Black "Genesis"]
[Result "1-0"]
 
1.d4 e6 2.e4 d5 3.Nc3 Bb4 4.e5 Bxc3+ 5.bxc3 c5 6.Qg4 g6 7.Nf3 f5 8.Qg5 Qc7 
9.Qd2 Nc6 10.Ba3 b6 11.Rb1 Bb7 12.Bd3 Nge7 13.O-O c4 14.Be2 h6 15.Rb2 Qd7 
16.Rfb1 g5 17.h3 O-O-O 18.Nh2 Ng6 19.Bd6 Nf4 20.Bf3 Qf7 21.Nf1 Rxd6 22.exd6 
Rh7 23.Ng3 Qd7 24.Ne2 Nxe2+ 25.Qxe2 Qxd6 26.a4 Re7 27.Ra1 e5 28.Qd2 e4 29.Bh5 
Na5 30.Rba2 f4 31.Re1 Kb8 32.Qc1 Ka8 33.Qb2 e3 34.Raa1 exf2+ 35.Kxf2 Qf6 
36.Rxe7 Qxe7 37.Re1 Qd7 38.Re8+ Bc8 39.Rf8 Qe6 40.Bg4 Qe3+ 41.Kf1 Kb7 42.Bxc8+ 
Kc7 43.Bg4 Nc6 44.Rc8+ Kb7 45.Rxc6 Kxc6 46.Qb5+ Kb7 47.Qxd5+ Kc7 48.Qd7+  
1-0

Forum Posts

New engine - Betsabé II 1.0 by Tony Mokonen, Winboard Forum, February 18, 2011
Betsabe II 1.47 by Graham Banks, CCC, August 12, 2014
Betsabe II 1.75 released by Graham Banks, CCC, July 22, 2017

External Links

Chess Engine

Index of /chess/engines/Jim Ablett/BETSABE II hosted by Kirill Kryukov
Mac Chess Engines Repository hosted by Julien Marcel
Betsabe II 1.30 64-bit in CCRL 40/40

Misc

References

^ betsabe-II-109-ja-jm/readme.txt
^ Bathsheba holding King David's letter by Willem Drost, 1654, Louvre Museum, Bathsheba from Wikipedia
^ data.h
^ Spanish Championship: Final Round by Sergio Martinez, CCC, December 29, 1999

What links here?

Page	Date Edited
Betsabe	Jul 23, 2017
Che ES	Aug 18, 2015
David	Jul 20, 2016
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Juan Benitez	Dec 27, 2013
Minimax (program)	Dec 27, 2013
SCCC 1993	Dec 15, 2017
SCCC 1994	Dec 15, 2017
SCCC 1998	Dec 15, 2017
SCCC 1999	Aug 15, 2015
Spanish Computer Chess Championship	Aug 15, 2015
Tigran ES	Aug 18, 2015

Up one level

Bruja

GerdIsenberg — Tue, 03 Feb 2015 19:46:25 GMT

Home * Engines * Bruja

		Bruja, a WinBoard compatible chess engine by Dan Honeycutt, written in C++ and first released in March 2004 ^[1] . In the program's readme file, Dan Honeycutt states that Bruja would never had come to be without the contributions of others, and credits Adrien Regimbald, Bruce Moreland, Robert Hyatt, Carlos del Cacho, and Ed Schröder with their respective programs and descriptions as source of inspiration ^[2] . A stripped version of Bruja, called Simon, was published as open source engine ^[3] .
Hans Baldung, Witch and Dragon, 1515 ^[4]

Description

Bruja has a bitboard infrastructure, and uses rotated bitboards to determine sliding piece attacks. It performs strictly legal move generation.

Search

Bruja applies PVS with transposition table inside an iterative deepening fractional ply framework in conjunction with null move pruning, singular, recapture and passed pawn extensions.

Evaluation

Bruja's evaluation initializes attack tables as described in Evaluation in REBEL by Ed Schröder ^[5] , to do hanging piece and static exchange evaluation, and to apply progressive king safety evaluation. Further, Bruja has some pawn structure knowledge and applies piece-square tables ^[6] .

Etymology

Bruja is the Spanish word for Witch and can mean some worse things depending on context ^[7]. The development of Bruja has started on Friday, October 31, 2003, during the Halloween storm when major flares erupted on the Sun with heavy influence on the Earth ^[8] and spectacular aurora with green phantom “northern lights” seen as far south as Texas, Georgia and Florida ^[9].

Forum Posts

Bruja - new engine by Dan Honeycutt, CCC, March 13, 2004
Simon by Dan Honeycutt, CCC, January 26, 2005
Bug in Bruja/Simon by Dan Honeycutt, CCC, June 13, 2005

External Links

Chess Engine

Index of /chess/engines/Jim Ablett/BRUJA by Jim Ablett, hosted by Kirill Kryukov
Bruja 1.9 64-bit JA No-int-book in KCEC
Bruja from WBEC Ridderkerk

Misc

References

^ Bruja from WBEC Ridderkerk
^ Bruja - new engine by Dan Honeycutt, CCC, March 13, 2004
^ Simon by Dan Honeycutt, CCC, January 26, 2005
^ Hans Baldung, Stehende Hexe mit Ungeheuer, 1515; Feder, weiß gehöht, auf braun grundiertem Papier, 295 × 207 mm, Hans Baldung from Wikipedia
^ Evaluation in REBEL (hanging pieces) from How Rebel Plays Chess by Ed Schröder, also available as pdf
^ Bruja - new engine by Dan Honeycutt, CCC, March 13, 2004
^ Bruja - new engine by Dan Honeycutt, CCC, March 13, 2004
^ Giant Halloween Solar Storm Sparked Earth Scares 10 Years Ago (Video) | Space.com
^ The Magnetic Storm of Halloween 2003 | Science Features by Jeffrey J. Love, E. Joshua Rigler, and Jessica K. Robertson, United States Department of the Interior | United States Geological Survey, October 15, 2013

What links here?

Page	Date Edited
Bruja	Feb 3, 2015
Cupcake	May 19, 2016
Dan Honeycutt	Mar 13, 2014
Engines	Mar 10, 2018
Hexxpawn	Oct 22, 2014
Sidonia	May 19, 2016
Simon	Mar 15, 2014
Witchess	Apr 22, 2015

Up one Level

Cassandre

GerdIsenberg — Fri, 05 Jul 2013 15:29:13 GMT

Home * Engines * Cassandre

		Cassandre, an Chess Engine Communication Protocol and UCI compliant open source chess engine under the terms of the GNU General Public License (GPL), written in C++ by Raphael Grundrich, Thomas Adolph and Jean-Francois Romang, first released in March 2003. Cassandre started as a student project at Louis Pasteur University, Strasbourg ^[1]. It is based on bitboards, in particular Rotated bitboards with 256 occupancy states to determine sliding piece attacks, bitscan aka first- and last one by conditional 16-bit lookups, and population count by eight byte lookups credited to Dann Corbit, and uses the alpha-beta algorithm ^[2].
Cassandra ^[3]

External Links

Chess Engine

Misc

References

^ Cassandre - Chess Engine
^ Cassandre - Chess Engine - About
^ Cassandra by Evelyn De Morgan (1898, London). Cassandra in front of the burning city of Troy at the peak of her insanity, Cassandra from Wikipedia

What links here?

Page	Date Edited
Cassandre	Jul 5, 2013
Engines	Mar 10, 2018
Jean-Francois Romang	Oct 23, 2017
Raphael Grundrich	Jul 5, 2013

Up one level

Centaur

GerdIsenberg — Fri, 24 Mar 2017 19:28:28 GMT

Home * Engines * Centaur

		Centaur (Russian: Кентавр), a chess program by primary author Victor Vikhrev and Alexey Manjakhin. Centaur won the First Soviet Computer-Chess Championship 1988 in Ulan-Ude, and further competed at the First International Chess-Computer Tournament in the USSR 1989 in Moscow, at three World Computer Chess Championships, the WCCC 1989 in Edmonton, the WCCC 1992 in Madrid, and the WCCC 1999 in Paderborn, four World Microcomputer Chess Championships ^[1] , two Uniform-Platform Computer Chess Championships, and three Aegon Man-Machine Tournaments ^[2] ^[3] ^[4]. Centaur, along with some code units incorporated from Mirage by Vladimir Rybinkin and Yuri Shpeer, further evolved to the Dragon analysis engine of Convekta's Chess Assistant database ^[5], not to confused with the original Dragon engine by Yuri Shpeer ^[6].
Sandro Botticelli, Pallas and Centaur, 1482 ^[7]

Screenshot

Centaur Screen ^[8]

Photos & Games

WCCC 1999: Centaur vs. Mini, Victor Vikhrev and Harald Prokop

[Event "WCCC 1999"]
[Site "Paderborn, Germany"]
[Date "1999.06.19"]
[Round "7"]
[White "Centaur"]
[Black "Mini"]
[Result "0-1"]
 
1.e4 e5 2.Nf3 Nf6 3.Nxe5 d6 4.Nf3 Nxe4 5.d4 d5 6.Bd3 Nc6 7.O-O Be7 8.Re1 Bg4 9.c4 Nf6
10.cxd5 Bxf3 11.Qxf3 Qxd5 12.Qxd5 Nxd5 13.Nc3 Ndb4 14.Be4 Nxd4 15.Bf4 Ne6 16.a3 Nd3
17.Bxd3 Nxf4 18.Bf5 Kf8 19.Rad1 g6 20.Be4 Ne621.Bd5 Nd8 22.Re2 c6 23.Bc4 b5 24.Bb3 f5
25.Rd7 Bf6 26.a4 a6 27.h3 Rb8 28.Red2 Bg5 29.f4 Bf6 30.axb5 axb5 31.Kh2 Ke8 32.Rc7 h5
33.Rd6 Rf8 34.Nd1 Rb6 35.g3 Rb8 36.Rh7 c5 37.Bd5 c4 38.Rh6 Ke7 39.Ra6 Rc8 40.Rxg6 h4
41.gxh4 Rc5 42.Ra7+ Kd6 43.Bg2 Ne6 44.Kg3 b4 45.Ne3 c3 46.Ra6+ Kd7 47.Bd5 Nc7 48.Rgxf6 
Rxf6 49.Rxf6 Nxd5 50.bxc3 Nxf6 51.cxb4 Rc3 52.Kf2 Ke6 53.b5 Rb3 54.Nc4 Nh5 55.Nd2 Rxb5 
56.Nf3 Rb2+ 57.Ke3 Rb3+ 58.Kf2 Kd5 59.Ng5 Nxf4 60.Nf3 Nxh3+ 61.Ke2 f4 62.Nd2 Re3+ 63.Kd1 
Nf2+ 64.Kc1 Ne4 65.h5 Re1+ 66.Kb2 Re2 67.Kb3 Nxd2+ 68.Kb2 Kc4 69.h6 Nb3+ 70.Ka3 Nc1 
71.Ka4 0-1

Descriptions

1989

based on the WCCC 1989 booklet ^[9] :

Centauer is a new chess-playing program with the heuristic search to consider the decisive series of moves. The algorithms is based on the probability logic and uses a fuzzy value of positions. The depth of the search is not limited. The whole information about all the series of moves is kept in RAM and is used to determine the decisive series of moves. Centaur features a low number of position analyzed. This is compensated with thoroughness of the position evaluation.

1991

from Don Beal's WMCCC 1991 report ^[10] :

`Centaur is the outstanding exception in the current pattern. It uses a much more human like approach, and despite its eventual losses, actually played well most of the time. For instance, it had a draw against Gideon for a long time, only going astray in the endgame.`

Written by Victor Vikhrev and Alexey Manjakhin, and winner of the first Moscow computer-chess tournament, this program is highly unconventional, and does not use alpha-beta, iterative search. Instead, it grows a selective tree, kept fully in memory, on a best-first basis. Position evaluation is not reduced to one number - instead a vector of values is produced from which 3 optimistic and 3 pessimistic evaluations are made under different assumptions. These 6 values determine a probability distribution of results for a position, which is used to guide tree growth and ultimately to choose a move. Victor Vikhrev describes his approach as intermediate between conventional programs and the even more selective approach of Botvinnik's program, Pioneer.

Centaur is the outstanding exception in the current pattern. It uses a much more human like approach, and despite its eventual losses, actually played well most of the time. For instance, it had a draw against Gideon for a long time, only going astray in the endgame.

Written by Victor Vikhrev and Alexey Manjakhin, and winner of the first Moscow computer-chess tournament, this program is highly unconventional, and does not use alpha-beta, iterative search. Instead, it grows a selective tree, kept fully in memory, on a best-first basis. Position evaluation is not reduced to one number - instead a vector of values is produced from which 3 optimistic and 3 pessimistic evaluations are made under different assumptions. These 6 values determine a probability distribution of results for a position, which is used to guide tree growth and ultimately to choose a move. Victor Vikhrev describes his approach as intermediate between conventional programs and the even more selective approach of Botvinnik's program, Pioneer.

1993

from Don Beal's UPCCC 1993 report ^[11] ^[12] :

Written by Victor Vikrev, a nuclear physicist in Moscow, as a major hobby over the past 30 years, plus Alexei Manjakhin. It is remarkable for being very different in design from all the other programs that do well in championships. It explores only a few future positions (instead of millions), but analyses them in more detail. In this respect its thinking is more human-like than any other program. It scored 2 from 5 in the last "unlimited machine" championship, and placed 17.

1999

from the ICGA-site ^[13] :

Centaur is a highly selective program, originated from Kurchatov Institute in Moscow. It is a completely unique program. Despite the lighting speed of its hardware it only examines about 500 positions per second. Centaur has a rating of 2,266 at AEGON97.

Centaur uses 5 values for estimation of chess position (one realistic, two pessimistic and two optimistic). All 5 values of a position are saved in memory of computer and are used for choice of direction of investigation of position.

Last modification of Centaur uses some code units from program Mirage, which is made in Russia. Principles of Centaur are described in ICCA Journal 1996, 2 ^[14]

Publications

Victor Vikhrev (1996) The Choice of a Research Direction. ICCA Journal, Vol. 19, No. 2

Forum Posts

QMW computer chess by Don Beal, rec.games.chess, August 19, 1993 » UPCCC 1993
Re: La Máquina Preservadora. Programas de Ajedrez by Tibono, Meca Foro, October 09, 2015 (Spanish)
Centaur by Fernando, Hiarcs Forum, March 16, 2017

External Links

Centaur's ICGA Tournaments
Кентавр (Russian)
Centaur, translated by Google Translate
Download Chess Programs hosted by Ed Schröder
Advanced Chess from Wikipedia (Centaur chess)
Centaur (disambiguation) from Wikipedia
Centaur from Wikipedia (Greek mythology)

References

^ Centaur's ICGA Tournaments
^ CSVN Aegon 1995 site
^ CSVN Aegon 1996 site
^ CSVN Aegon 1997 site
^ Chess Assistant - ChessOK
^ Заставить работать машину клиента! [20] - Конференция iXBT.com, September 01, 2009
^ Renaissance Art - The Renaissance in Florence: Republican and Medici (15th c.)
^ Septober - Computerschach by Herbert Marquardt
^ Kings Move - Welcome to the 1989 AGT World Computer Chess Championship. Edmonton, Alberta, Canada, Courtesy of Peter Jennings, from The Computer History Museum, pdf
^ Don Beal (1991). Report on the 11th World Microcomputer Chess Championship. ICCA Journal, Vol. 14, No. 2
^ Don Beal (1993). Report on the QMW 1993 Uniform-Platform Computer-Chess Championship. ICCA Journal, Vol. 16, No. 3
^ QMW computer chess by Don Beal, rec.games.chess, August 19, 1993
^ Centaur's ICGA Tournaments
^ Victor Vikhrev (1996) The Choice of a Research Direction. ICCA Journal, Vol. 19, No. 2

What links here?

Page	Date Edited
Aegon 1995	Apr 6, 2017
Aegon 1996	Jan 22, 2017
Aegon 1997	Apr 7, 2017
Alexey Manjakhin	Jan 7, 2016
Algir	Feb 17, 2013
Centaur	Mar 24, 2017
Cheiron	Jan 7, 2016
Chiron	Sep 24, 2017
Dragon (Chess Assistant)	Jul 30, 2013
Dragon RU	Jan 8, 2016
Elektronika IM	Nov 30, 2017
Engines	Mar 10, 2018
First International Chess-Computer Tournament in the USSR 1989	Apr 22, 2018
First Soviet Computer-Chess Championship 1988	Dec 7, 2016
Innovation	Jun 12, 2016
Mini	Jan 7, 2016
Mirage	Jul 12, 2016
Strategist	Jun 13, 2013
UPCCC 1993	Mar 6, 2015
UPCCC 1994	Mar 9, 2012
Victor Vikhrev	Jan 7, 2016
WCCC 1989	Dec 5, 2017
WCCC 1992	Feb 26, 2018
WCCC 1999	Jul 13, 2017
WMCCC 1991	Sep 18, 2016
WMCCC 1993	Dec 30, 2017
WMCCC 1995	Jan 3, 2018
WMCCC 1996	Sep 15, 2016

Up one Level

CHAOS

GerdIsenberg — Thu, 28 Dec 2017 08:49:00 GMT

Home * Engines * CHAOS

		CHAOS was one of the leading programs since it first appeared at ACM 1973 until the mid 80s. CHAOS, which stands facetiously for Chess Heuristics And Other Stuff, has participated in twelve ACM tournaments ^[1] and four world championships ^[2] , runner up in 1974 behind Kaissa, defeating favorite Chess 4.0. In 1980 at the 3rd WCCC, CHAOS was close to becoming champion but lost the playoff against Belle. Its last tournament was the 16th AMC 1985 when it lost two games in a very strong field.
Boldriaan - CHAOS (2006) ^[3]

Duel on the Chessboard

History

CHAOS started in the late 1960s at RCA Systems Programming division in Cinnaminson, NJ with Ira Ruben, Fred Swartz, Victor Berman, Joe Winograd, and William Toikka as first authors. In January 1972, Sperry Univac (1986 Unisys) officially took over the RCA Computer Systems Division and eventually moved everything to Blue Bell, Pennsylvania. Later the program has been affiliated with the Computing Center of the University of Michigan where most of its programmers were staff members ^[4] .

Knowledge vs Search

CHAOS was written in Fortran and required in excess of 3,000,000 words of memory to execute, using most of it for storing the tree. It examines only about 50 nodes/sec (1985 70 nodes/sec ^[5] ) or about 10,000 per move. The reason why CHAOS evaluated so slowly — their programmers did a better job of evaluation! Because every minimax decision is made based on a single evaluation, it seemed plausible that the more accurate this number is, the better the quality of tree searching. However, that comes at the cost of missing deep combinations from brute force search, but CHAOS's strength/nodes-evaluated ratio was impressive. The program carried out a selective search with iterative widening, a bit different from the others. Its book contains about 10,000 lines.

Quotes

Alex Bell

Alex Bell on the CHAOS - Chess 4.0 game 1974 ^[6] :

CHAOS played 16 NxP!! - a move which has been acclaimed as the finest ever made by a computer. White evaluates that his domination of open lines is compensation for a piece. This judgement is absolutely correct. Of course the piece is not sacrificed entirely and play continues in a very similar fashion to MASTER's sacrifice of a bishop to TELL.

rq2k2r/3n1ppp/p2bpnb1/8/Np1N4/1B3PP1/PP2Q2P/R1BR2K1 w kq - 1 16

Duel on the Chessboard

Quote from Computer vs. computer: Duel on the Chessboard ^[7] on ACM 1979:

The biggest and most powerful computers do that very well. In one second, they can examine thousands of possible moves. The problem is, they stop to consider lousy moves that a human player wouldn't waste a fraction of a second on. On the other side of the fence are the slower but "smarter" computer programs. They can't think about zillions of chess moves, so they need a lot of information about chess plugged into them. CHAOS is one of these latter, pumped with chess information from John J. O’Keefe, one of Michigan's top players.

Authors

1973 ^[8]	1976 ^[9]	1978 ^[10]	1983 ^[11]
	Mike Alexander	Mike Alexander	Mike Alexander
Victor Berman	Victor Berman	Victor Berman	Victor Berman
			Mark Hersey
		Tom McBride
			Jack O’Keefe
Ira Ruben	Ira Ruben
Fred Swartz	Fred Swartz	Fred Swartz	Fred Swartz
William Toikka	William Toikka	William Toikka
Joe Winograd	Joe Winograd	Joe Winograd

Photos & Games

CHAOS Team

CHAOS Team circa 1972 with UNIVAC 1108 Computer in Cinnaminson, NJ
From left, Fred Swartz (rear), Vic Berman (front), Bill Toikka, Ira Ruben (seated), Joe Winograd ^[12]

WCCC 1974

Slate, Swartz, and Berman in CHAOS vs Chess 4.0, WCCC 1974 ^[13] ^[14]

[Event "WCCC 1974"]
[Site "Stockholm, Sweden"]
[Date "1974.08.06"]
[Round "2"]
[White "Chaos"]
[Black "Chess 4.0"]
[Result "1-0"]
 
1.d4 d5 2.c4 dxc4 3.Nf3 Nf6 4.e3 e6 5.Bxc4 c5 6.Qe2 a6 7.O-O b5 8.Bb3 Bb7
9.Rd1 Nbd7 10.Nc3 Bd6 11.e4 cxd4 12.Nxd4 Qb8 13.g3 b4 14.Na4 Bxe4 15.f3 Bg6
16.Nxe6 fxe6 17.Qxe6+ Be7 18.Re1 Qd8 19.Bf4 Kf8 20.Rad1 Ra7 21.Rc1 Ng8 22.Rcd1
a5 23.Bd6 Bxd6 24.Qxd6+ Ne7 25.Nc5 Bf5 26.g4 Qe8 27.Ba4 b3 28.gxf5 bxa2 29.Bxd7
a1=Q 30.Rxa1 Ra6 31.Nxa6 Qd8 32.Kf2 Kf7 33.Qe6+ Kf8 34.Qxe7+ Qxe7 35.Rxe7 Kxe7
36.Nc5 Rb8 37.Rxa5 Rxb2+ 38.Kg3 g6 39.fxg6 hxg6 40.Ra6 Rc2 41.Re6+ Kf8 42.Re5 Rc1
43.Rg5 Kf7 44.Be6+ Kf6 45.h4 Rxc5 46.Rxc5 Kxe6 47.Rg5 Kf6 48.Kg4 Kf7 49.Rc5 Ke6
50.Kg5 Kd6 51.Ra5 Kc6 52.f4 Kb6 53.Ra1 Kc5 54.Rd1 Kb4 55.Kxg6 Kc3 56.Rd8 Kb4
57.Rc8 Kb5 58.h5 Kb6 59.Rc1 Kb5 60.h6 Ka4 61.Rb1 Ka3 62.f5 Ka2 63.Rb8 Ka3 64.f6
Ka4 65.Rb7 Ka5 66.Rb8 Ka4 67.Rb1 Ka3 68.Rb7 Ka4 69.Rb8 Ka5 70.Kg7 Ka4 71.Rb7 Ka5
72.Rb2 Ka4 73.Rb8 Ka5 74.Kg8 Ka4 75.h7 Ka5 76.h8=Q Ka4 77.Qh4+ Ka5 78.Qb4+ Ka6
79.Qa4# 1-0

WCCC 1980

Belle vs CHAOS, WCCC 1980, Thompson, Friedel, Berman ^[15] , Swartz, Donskoy ^[16] ^[17]

[Event "WCCC 1980"]
[Site "Linz, Austria"]
[Date "1980.09.29"]
[Round "5 (playoff)"]
[White "Belle"]
[Black "Chaos"]
[Result "1-0"]
 
1.e4 Nf6 2.e5 Nd5 3.d4 d6 4.Nf3 dxe5 5.Nxe5 g6 6.g3 Bf5 7.c4 Nb4 8.Qa4+ N4c6
9.d5 Bc2 10.Qb5 Qd6 11.Nxc6 Nxc6 12.Nc3 Bg7 13.Qxb7 O-O 14.Qxc6 Qb4 15.Kd2 Be4
16.Rg1 Rfb8 17.Bh3 Bh6+ 18.f4 Qa5 19.Re1 f5 20.Qe6+ Kf8 21.b3 Bg7 22.Bb2 Bd4
23.g4 Rb6 24.Qd7 Rd6 25.Qa4 Qb6 26.Ba3 Bxc3+ 27.Kxc3 Rdd8 28.Rad1 Qf2 29.gxf5
Qc2+ 30.Kd4 gxf5 31.Qc6 Qf2+ 32.Ke5 Kg8 33.Rg1+ Kh8 34.Bxe7 Qb2+ 35.Rd4 Qg2
36.Qf6+ Kg8 37.Bxg2 Rxd5+ 38.Ke6 h6 39.Qxh6 Re5+ 40.fxe5 Rf8 41.Bf3# 1-0

Forum Posts

Old programs CHAOS and USC by Eugene Piercy, CCC, July 11, 2015

External Links

Chess Program

Misc

Chaos in a Miniature by Edward Winter
Chaos (cosmogony) from Wikipedia
Chaos theory from Wikipedia
Sun Ra - Cosmic Chaos, from The Heliocentric Worlds of Sun Ra, Vol. 2 (1965), YouTube Video

References

^ North American Computer-Chess Championships, complete History of Tournament Results and Games, prepared by Theo van der Storm, Nov. 23rd, 2002, secretary of the CSVN
^ Chaos' ICGA Tournaments
^ Schaakkunst van Boldriaan
^ The Eleventh ACM's North American Computer Chess Championship as pdf reprint from The Computer History Museum
^ David .E. Welsh (1986). ACM's Sixteenth North American Computer Chess Championship. ICCA Journal, Vol. 8, No. 4.
^ Alex Bell (1978). MASTER at IFIPS. from Atlas Computer Laboratory, hosted by Rutherford Appleton Laboratory (RAL), excerpt from A. G. Bell (1978). The Machine Plays Chess. Pergamon Press, ISBN-13: 978-0080212227, from amazon
^ Computer vs. computer: Duel on the Chessboard, Boca Raton News - November 27. 1979 from Google News on ACM 1979
^ Monroe Newborn (1975). Computer Chess. Academic Press, New York, N.Y. Chapter IX. The Fourth United States Computer Chess Championship » ACM 1973
^ pp. 52, Table I. History of the ACM Tournaments from
Ben Mittman, Monroe Newborn (1980). Computer chess at ACM 79: the tournament and the man vs. man and machine match. Communications of the ACM, Vol. 23, Issue 1, pdf from The Computer History Museum » ACM 1976
^ David Levy (1978). ACM '78. ICCA Newsletter, Vol. 1, No. 1 » ACM 1978
^ Chaos' ICGA Tournaments
^ Photo courtesy Joe Winograd
^ Photo by Monroe Newborn from The Computer History Museum
^ Stockholm 1974 - Chess - Round 2 - Game 6 (ICGA Tournaments)
^ Militärischer Wert Der Spiegel 24/1982, pdf (German)
^ Photo by Monroe Newborn from The Computer History Museum
^ Linz 1980 - Chess - Round 5 - Game 1 (ICGA Tournaments)

What links here?

Page	Date Edited
ACM 1973	Jan 19, 2018
ACM 1974	Jan 19, 2018
ACM 1975	Jan 19, 2018
ACM 1976	Dec 27, 2017
ACM 1977	Dec 22, 2017
ACM 1978	Dec 23, 2017
ACM 1979	Apr 3, 2017
ACM 1980	Dec 25, 2017
ACM 1981	Jan 19, 2018
ACM 1982	Jul 19, 2016
ACM 1984	Jul 19, 2016
ACM 1985	Jun 21, 2017
AMDAHL 470	Jul 19, 2016
Awit	Dec 22, 2017
Belle	Jan 18, 2018
Carey Bloodworth	Jul 19, 2016
CHAOS	Dec 28, 2017
Ches	Jan 3, 2018
Chess (Program)	Dec 22, 2017
Dart	Jan 19, 2018
David Cahlander	Dec 22, 2017
David Levy	Jan 3, 2017
Duchess	Dec 22, 2017
Engines	Mar 10, 2018
Evaluation Overlap	Jul 19, 2016
Fred Swartz	Jul 19, 2016
Frederic Friedel	Jan 6, 2018
Freedom	Dec 28, 2017
Ira Ruben	Jul 19, 2016
Jack O’Keefe	Jul 19, 2016
Jerusalem CC Tournament 1978	Jan 3, 2018
Joe Winograd	Jul 19, 2016
Mark Hersey	Jul 19, 2016
Mike Alexander	Jul 19, 2016
Nuchess	Apr 3, 2017
Shy	Jul 19, 2016
SPOC	Jun 21, 2017
Tom Truscott	Dec 22, 2017
Type B Strategy	Jul 19, 2016
UNIVAC 1100	Jul 21, 2016
University of Michigan	Jul 19, 2016
Victor Berman	Jul 19, 2016
WCCC 1974	Jan 19, 2018
WCCC 1977	Dec 22, 2017
WCCC 1980	Dec 25, 2017
WCCC 1983	Jan 20, 2018
William Toikka	Aug 12, 2016

Up one level

Cheiron

GerdIsenberg — Thu, 07 Jan 2016 17:48:55 GMT

Home * Engines * Cheiron

		Cheiron, a computer chess program written by Ulf Lorenz. It played the 8th World Computer Chess Championship 1995 in Shatin, Hong Kong and the 13th World Microcomputer Chess Championship 1995 in Paderborn, and the IPCCC 1994 and IPCCC 1997.
Chiron and Achilles ^[1]

Description

from the ICGA-site ^[2]:

In Greek mythology, Cheiron was the wisest of all centaurs and the teacher of many heroes. The program Cheiron is written in C. It is an alpha-beta program using most of the known state-of-the-art heuristics including killer heuristics, transposition table, aspiration search, plausible move ordering, iterative deepening, selective deepening etc. Null moves, however, are not used. The quiescence search is quite large and examines some tactical motifs, particularly mating and promotion threats.

Apart from the move generator, the evaluation function is the most expensive part of the program. It examines the pawn structure, king's security, static positions of the pieces, everlasting knights etc. as well as special situations in the endgame (e.g. there are positions when two pawns are more worth than a rook).

On a Pentium 90MHz the program will search about 10.000 nodes per second. Cheiron is more a positional playing than a tactical playing program. Cheiron uses an opening book containing about 12,000 positions to get a good start into the game. Using the Bednorz-Toennissen test, Cheiron has an estimated rating of 2100 ELO on a 50MHz PC. Tournament results against humans supports this number. Originally, the program was developed for Unix boxes, but a version has been developed with a graphical interface using Turbo C in a DOS-Windows 3.1 environment.

External Links

Chess Program

Cheiron's ICGA Tournaments

Misc

Chiron (Mythology) from Wikipedia

References

What links here?

Page	Date Edited
Achilles	Dec 31, 2015
Aegon 1996	Jan 22, 2017
Aegon 1997	Apr 7, 2017
Burkhard Monien	Dec 19, 2016
Centaur	Mar 24, 2017
Cheiron	Jan 7, 2016
Chiron	Sep 24, 2017
Engines	Mar 10, 2018
IPCCC 1994	Jul 31, 2013
IPCCC 1997	Aug 24, 2013
Ulf Lorenz	Dec 22, 2016
University of Paderborn	Aug 17, 2014
WCCC 1995	Jul 12, 2017
WMCCC 1995	Jan 3, 2018

Up one Level

Wikispaces : chessprogramming - items matching description

Abyss

Table of Contents

Description

Basics

Misc

Abyss' ICGA Tournaments

See also

Publications

External Links

Engine

Misc

References

What links here?

Achilles

Table of Contents

See also

Forum Posts

External Links

Chess Engine

Misc

References

What links here?

Adam

Table of Contents

See also

Forum Posts

External Links

Chess Engine

Misc

References

What links here?

Anubis

Table of Contents

See also

Forum Posts

External Links

References

What links here?

Arachne

Table of Contents

Selected Games

Dappet

Duck

See also

Publications

Arachne

Arachne elsewhere

External Links

Chess Program

Misc

References

What links here?

Ares

Table of Contents

Namesake

See also

External Links

References

What links here?

Ares US

Table of Contents

Namesake

See also

Forum Posts

External Links

Chess Engine

Misc

References

What links here?

Argonaut

Table of Contents

Photos & Games

Neurosis

Hermann

See also

Forum Posts

External Links

Chess Engine

Misc