Wikispaces : chessprogramming - items matching description

AnMon

GerdIsenberg — Fri, 17 Nov 2017 20:37:38 GMT

Home * Engines * AnMon

		AnMon, a chess program by Christian Barreteau, one of the first engines which supported WinBoard aka the Chess Engine Communication Protocol, later also UCI. AnMon was available as Young Talent by ChessBase running under the Fritz6 GUI ^[1] , and is Arena partner engine ^[2] . It is a tactically very strong MTD(f) searcher. AnMon participated at various French Computer Chess Championships and had its debut at the FCCC 1995, further the WMCCC 1997 in Paris, and multiple Massy French Programmers Tournaments, winning Massy 2000, Massy 2005 and Massy 2006.
Floor mosaic of Chigi Chapel ^[3] ^[4]

Photos & Games

Massy 2002, GNU Chess - AnMon, Pascal Tang, Dominique Longbien, Christian Barreteau, Jean-Philippe Louguet ^[5]

[Event "Massy 2002"]
[Site "Massy, France"]
[Date "2002.05.26"]
[Round "1"]
[White "GNU Chess"]
[Black "AnMon521_UCI"]
[Result "0-1"]
 
1.e4 e5 2.Nf3 Nc6 3.Bb5 g6 4.c3 d6 5.d4 Bd7 6.Qb3 Na5 7.Bxd7+ Qxd7 8.Qd5 Nc6
9.dxe5 dxe5 10.Qxd7+ Kxd7 11.O-O Nf6 12.Nbd2 a5 13.Nc4 Re8 14.Re1 h6 15.a4 Kc8
16.b3 Nd7 17.Nfd2 Nc5 18.Ba3 Nd3 19.Re3 Rd8 20.Rf3 Bxa3 21.Rxa3 Nc5 22.Ra1 Rhf8
23.Rh3 Rd7 24.f3 h5 25.Rg3 Ne6 26.Ra2 Rd3 27.Rc2 Rfd8 28.Nf1 h4 29.Rg4 h3
30.Rh4 hxg2 31.Kxg2 Nf4+ 32.Kf2 R3d1 33.Rh7 Nd3+ 34.Kg1 Ne1 35.Rf2 Rf8 36.Ncd2 Nd3
37.Rg2 Rc1 38.c4 Nd4 39.Rg4 Rc3 40.Rgh4 Ne1 41.R4h3 Nexf3+ 42.Kg2 Ne1+ 43.Kh1 Nd3
44.R7h8 Rxh8 45.Rxh8+ Kd7 46.Rf8 Ke6 47.Re8+ Kf6 48.Kg2 Nc5 49.h4 c6 50.h5 gxh5
51.Rh8 Ncxb3 52.Nxb3 Nxb3 53.Ng3 Rxc4 54.Rh6+ Kg5 55.Rh7 h4 56.Rg7+ Kf6 0-1

Description

given in 1997 from the ICGA site ^[6] :

The program AnMon (half ANgel, half deMON) is written in C and run under Windows NT. It was developed as a hobby for 8 years. AnMon participated in the 1995, and 1996 French Microcomputer Chess Championship. It is based on MTD(f) and uses null-move pruning, selective extensions, transposition tables, killer heuristic, and quiescence search. AnMon is a tactical program.

AnMon uses an opening book containing about 100.000 positions. It was established by the program. AnMon search about 50.000 nodes per second on a Pentium 2 at 233 MHz.

Forum Posts

AnMon 4.25 download ! by Frank Quisinsky, CCC, June 22, 1999
Anmon is Really Very Strong by Fernando Villegas, CCC, June 22, 1999
Anmon question ! Is anmon using alpha-beta ? by Thorsten Czub, CCC, August 16, 1999
AnMon 5.06 for Download by Đorđe Vidanović, CCC, February 01, 2000
ANMON won the computer chess tourney in Massy ! by Frank Quisinsky, Winboard Forum, May 23, 2000
UCI AnMon 5.19 by Christian Barreteau available! by Frank Quisinsky, CCC, February 26, 2002
Re: SCOTD (AnMon 5.21) by Kurt Utzinger, CCC, October 11, 2003
AnMon 5.40 by Christian Barreteau is available ... long text! by Frank Quisinsky, CCC, August 14, 2004
Changes in AnMon ... by Frank Quisinsky, CCC, August 15, 2004
AnMon 5.60 UCI available by Michael Diosi, CCC, January 30, 2006
New version of AnMon since 3 years ... by Leo Dijksman, CCC, February 03, 2009
AnMon 5.66 : 2436 by Patrick Buchmann, CCC, February 04, 2009
AnMon 5.75 : 2452 by Patrick Buchmann, CCC, July 24, 2009

External Links

Chess Engine

Misc

References

^ Support - ChessBase, May 28th, 2000
^ Arena Chess GUI 3.0 - AnMon
^ Santa Maria del Popolo in Rome, Italy: Chigi Chapel. Incrustated floor with the coats of arms of the House of Chigi hold by the Death, Photo by Bernd Brägelmann, Agostino Chigi from Wikipedia
^ Angels & Demons from Wikipedia
^ Massy 2002/05/26 - Tournoi de programmes d'Echecs from LUDOCHESS - Les jeux d'Echecs 100% pur Java by Stéphane Nguyen
^ AnMon's ICGA Tournaments

What links here?

Page	Date Edited
Amyan	Dec 10, 2013
AnMon	Nov 17, 2017
Arena	Mar 16, 2018
Bernard Brioit	Jan 10, 2015
Capture (program)	Jan 8, 2016
ChessBase	Nov 25, 2017
Christian Barreteau	Jan 8, 2016
Eigenmann Endgame Test	Jun 1, 2017
Engines	Mar 10, 2018
FCCC 1995	Jul 27, 2015
FCCC 1996	Jul 25, 2014
FCCC 1998	Oct 22, 2012
FCCC 1999	Jan 29, 2013
FCCC 2000	Jan 26, 2013
FCCC 2004	Jun 16, 2013
Fernando Villegas	Aug 15, 2016
French Programmers Tournament	Jan 26, 2013
Fruit	Sep 27, 2016
Massy 2001	Jan 28, 2013
Massy 2002	Jan 2, 2018
Massy 2004	Oct 27, 2016
Massy 2005	Jan 29, 2013
Massy 2006	Jan 29, 2013
WMCCC 1997	Apr 4, 2017

Up one Level

Chess Tiger

GerdIsenberg — Thu, 07 Jan 2016 17:59:26 GMT

Home * Engines * Chess Tiger

		Chess Tiger, a chess engine by Christophe Théron. Chess Tiger and the version dubbed Gambit Tiger ^[1] competed the WMCCC 1997, WCCC 1999, WMCCC 2000 (3rd place) and the WMCCC 2001, won three times the French Computer Chess Championship, three times the French Programmers Tournament, two times the Spanish Computer Chess Championships, three times the Dutch Open Computer Chess Championship, and the BELCT 2001. As once mentioned by Christophe, Chess Tiger uses a resource friendly 16x16 Board Vector Attack approach ^[2]. Chess Tiger is suited to run on various platforms, an UCI compatible PC version is available from Lokasoft ^[3] , and Chess Tiger 15 from ChessBase ^[4] . Recent versions focus on PDAs, Tablet computers, and Smartphones, such as the free Palm version ^[5] , and the releases for Apple's iPhone, iPod touch, and iPad, all running under Apples iOS Mobile operating system ^[6], also incorporated in Apple's Chess Pro - with coach ^[7].
Jean-Léon Gérôme - Tiger on the Watch ^[8]

Descriptions

from the ICGA tournament site ^[9]

1997

The only tiger playing chess in the world! This program, developed under the Caribbean sun, is a blitz specialist. Recently it has greatly been improved and rewritten for 32 bits processors, bringing its level close to the best "state of the art" PC computer chess.

1999

Chess Tiger used to be a very good tactical program, but has been improved to include more positional knowledge and is now a more balanced chess player. Chess Tiger is still developed under the sun, in Guadeloupe (French West Indies).

Screenshots

MS-DOS

Early Chess Tiger GUI ^[10]

iOS

Chess Tiger for iOS ^[11]

Selected Games

DOCCC 2001, round 8, Chess Tiger - Fritz ^[12]

[Event "DOCCC 2001"]
[Site "Leiden NED"]
[Date "2001.11.03"]
[Round "08"]
[White "Chess Tiger 14.6"]
[Black "Fritz"]
[Result "1-0"]
 
1.e4 c5 2.Nf3 d6 3.Bb5+ Bd7 4.Bxd7+ Qxd7 5.c4 Nc6 6.Nc3 Nf6 7.d4 cxd4 
8.Nxd4 g6 9.Nde2 Bg7 10.f3 O-O 11.O-O a6 12.a4 Qd8 13.Be3 Nd7 14.b3 Qa5 
15.Qd2 Rfd8 16.Rab1 e6 17.Bg5 Nf6 18.Rfd1 Rd7 19.Bh6 Rad8 20.Bxg7 Kxg7 
21.Nf4 Ne5 22.Rb2 h6 23.Rbb1 Qc7 24.Re1 Qc5+ 25.Kf1 Qb4 26.Red1 Qc5 
27.Qe1 b6 28.Rd2 Kh7 29.Nd3 Qd4 30.Ne2 Qe3 31.Rbd1 Nxf3 32.gxf3 Qxf3+ 
33.Qf2 Qh1+ 34.Qg1 Qf3+ 35.Ke1 Nxe4 36.Rc2 d5 37.Ne5 Qxb3 38.Nd4 Qxa4 
39.Nxd7 Rxd7 40.Qe3 e5 41.Nb3 Qc6 42.Rb2 d4 43.Qf3 Rc7 44.Rdb1 Nc3 
45.Qxc6 Rxc6 46.Ra1 Rxc4 47.Nd2 Ra4 48.Rxa4 Nxa4 49.Rc2 Kg7 50.Nf3 Kf6 
51.Re2 Kf5 52.Rxe5+ Kf4 53.Kf2 d3 54.Re7 f5 55.Ne5 Ke4 56.Ke1 Kd4 57.Kd2
Nc5 58.Nxd3 Nb3+ 59.Ke2 b5 60.Re6 a5 61.Rxg6 h5 62.Rd6+ Ke4 63.Nf2+ Ke5 
64.Rb6 Nd4+ 65.Kd3 a4 66.Rb8 a3 67.Kc3 a2 68.Ra8 b4+ 69.Kc4 b3 70.Nd3+ 
Ke4 71.Nc5+ Ke3 72.Nxb3 Nxb3 73.Kxb3 f4 74.Kc2 Ke2 75.Rxa2 h4 76.Kc1+ 
Ke1 77.Ra4 f3 78.Rxh4 Ke2 79.Rf4 1-0

Forum Posts

1998 ...

Chess Tiger on LCT2 by Christophe Théron, CCC, March 26, 1998 » LCT II
How Can I buy Chess Tiger ? by Arctor, CCC, September 26, 1999
Chess Tiger on the SSDF: the story by Christophe Théron, CCC, September 27, 1999 » SSDF
Open proposition to the SSDF about Chess Tiger 12.0 by Christophe Théron, CCC, September 29, 1999
Chess Tiger 12.0 wins the FCCC together with Capture by Christophe Théron, CCC, October 10, 1999 » FCCC 1999
To Chrisophe Theron, about Chess Tiger and Genius and Rebel by Heiko Mikala, CCC, October 18, 1999
Chess Assistant 5.0 (Chess Tiger 12.0 is included) in January, 2000 by Victor Zakharov, December 18, 1999 » Chess Assistant

2000 ...

Chess Tiger question ... by Frank Quisinsky, CCC, October 18, 2000
tiger's play too risky ? by Ulrich Türke, CCC, April 06, 2001
Chess Tiger for Palm, free text mode version available by Christophe Théron, CCC, May 19, 2001 » Palm
Chess Tiger and Rebel, the first programs to win against the Internet by Ed Schröder, CCC, May 28, 2001 » Rebel
Chess Tiger 14.5 for Palm... by Christophe Théron, CCC, July 10, 2001
Chess Tiger 14.6 Dutch Open Champion 2001!! by Kevin Strickland, CCC, November 04, 2001 » DOCCC 2001
Longer analysis with Chess Tiger 14.0 ? by Gian-Carlo Pascutto, CCC, February 20, 2002
Chess Tiger 14.9 for Palm available - just great! by Kurt Utzinger, CCC, April 03, 2002
Open Dutch CC: Chess Tiger champion by Theo van der Storm, CCC, October 27, 2002 » DOCCC 2002
Chess Tiger 15 in the Chessbase (Fritz) GUI by Christophe Théron, CCC, April 06, 2003 » Fritz
Chess Tiger 15.1 free update by Christophe Théron, CCC, September 15, 2003
New version of Chess Tiger delayed because of a serious bug by Christophe Théron, CCC, July 26, 2004

2005 ...

Chess Tiger on PPC by Mark Rawlings, CCC, June 17, 2005
Chess Tiger 2007.1 has just been released by Christophe Théron, CCC, April 15, 2007
Gambit Tiger by Marek Soszynski, CCC, April 25, 2008
To Jeroen and interested minds, re. Tiger node count by Christophe Théron, CCC, August 15, 2008
Chess Tiger 2009 for Palm by Kaj Soderberg, CCC, October 18, 2008

2010 ...

Chess Tiger 2004 by David Shanholtzer, CCC, February 13, 2010
Re: DeepTiger by Christophe Théron, CCC, May 21, 2010
Daily iPhone chess programs releases by Julien Marcel, CCC, March 08, 2011
Help: I need testers for the iOS version of Chess Tiger by Christophe Théron, CCC, May 09, 2011
Chess Tiger for iOS has been updated by Christophe Théron, CCC, May 25, 2011
Strange error in "Chess Pro - with coach" by Jens Bæk Nielsen, CCC, August 13, 2013

External Links

Chess Tiger

Misc

References

What links here?

Page	Date Edited
Ant	Jun 1, 2015
BELCT 2001	Apr 4, 2017
Caligula	May 22, 2016
Capture (program)	Jan 8, 2016
CCT9	Aug 25, 2013
Chess Assistant	Jul 16, 2017
Chess Tiger	Jan 7, 2016
ChessBase	Nov 25, 2017
Christophe Théron	Jan 7, 2016
Didzis Cirulis	Dec 25, 2015
DOCCC 1999	Aug 15, 2015
DOCCC 2000	Aug 15, 2015
DOCCC 2001	Aug 15, 2015
DOCCC 2002	Nov 24, 2017
DOCCC 2003	Aug 17, 2016
DOCCC 2004	Nov 19, 2016
Dutch Open Computer Chess Championship	Sep 25, 2014
Eigenmann Endgame Test	Jun 1, 2017
Engines	Mar 10, 2018
Ernest Bonnem	Jan 26, 2014
FCCC 1996	Jul 25, 2014
FCCC 1998	Oct 22, 2012
FCCC 1999	Jan 29, 2013
FCCC 2000	Jan 26, 2013
FCCC 2002	Aug 4, 2013
FCCC 2003	Jan 26, 2013
FCCC 2004	Jun 16, 2013
French Computer Chess Championship	Jan 29, 2013
French Programmers Tournament	Jan 26, 2013
Gambit Fruit	Mar 29, 2013
Gandalf	Jan 21, 2018
Hans van der Zijden	Dec 13, 2016
ICT 2001	Oct 14, 2015
ICT 2002	Nov 19, 2016
ICT 2003	Aug 18, 2016
ICT 2004	Aug 17, 2016
IPCCC 1998	Feb 25, 2018
Jeroen Noomen	Jul 21, 2017
Jester	Sep 15, 2017
Julien Marcel	Oct 19, 2016
LCT II	Feb 25, 2018
Lokasoft	Jul 14, 2012
Massy 2001	Jan 28, 2013
Massy 2002	Jan 2, 2018
Massy 2003	Jan 27, 2013
Massy 2004	Oct 27, 2016
Massy 2006	Jan 29, 2013
Mephisto Vancouver	Sep 2, 2017
Nejmet	Mar 7, 2015
Nullmover	Jul 21, 2013
Oracle	Sep 4, 2016
Pharaon	Sep 2, 2017
Raptor	Jul 20, 2015
Rebel	Feb 25, 2018
SCCC 1998	Dec 15, 2017
SCCC 1999	Aug 15, 2015
Spanish Computer Chess Championship	Aug 15, 2015
The Crazy Bishop	Jan 7, 2016
Ulrich Türke	Jan 8, 2016
WCCC 1999	Jul 13, 2017
Who's Who	Sep 6, 2017
WMCCC 1997	Apr 4, 2017
WMCCC 2000	Feb 27, 2018
WMCCC 2001	Jul 25, 2017

Up one Level

Comet

GerdIsenberg — Fri, 08 Jan 2016 15:52:38 GMT

Home * Engines * Comet

		Comet, a Chess Engine Communication Protocol compatible chess program by Ulrich Türke. Comet is written in C and therefor available for several platforms ^[1]. Comet played various over the board tournaments, Aegon Tournaments ^[2]^[3], three World Microcomputer Chess Championships, 1995, 1996 and 1997, multiple International Paderborn Computer Chess Championships, CCT Tournaments, and the ICT 2002.
Story of a Comet ^[4]

Screenshot

Comet DOS GUI ^[5]

Description

given in 1997 from the ICGA site ^[6]:

design and implementation in 1991 originally guided by GNU Chess 3.0
standard - search algorithm: Minimax + Alpha-Beta including "Aspiration-Window"; no minimal window search.
good tactical strength by conventional extensions and threat detection by null-move heuristic
use of a sophisticated, domain-dependent evaluation window technique
considerable knowledge implemented in evaluation modules evaluation in 3 passes:
1. scan and evaluation of pawn structure
2. piece and king evaluation depending on the results of pass 1
3. evaluation of global positional characteristics
implementation of various classes of killer moves
selectivity:
a) Razoring , modified fail high reduction at depth 1
b) null move search, partly with reduced search depth
c) quiescence cut-offs as in GNU-Chess
opening book with 120000 positions

Selected Games

WMCCC 1997, round 11, Comet - The Crazy Bishop ^[7]

[Event "WMCCC 1997"]
[Site "Paris, France"]
[Date "1997.11.02"]
[Round "11"]
[White "Comet"]
[Black "The Crazy Bishop"]
[Result "1-0"]
 
1.e4 c5 2.Nf3 Nc6 3.d4 cxd4 4.Nxd4 Nf6 5.Nc3 e5 6.Ndb5 d6 7.Bg5 a6 8.Na3 Be7 
9.Bc4 O-O 10.Bxf6 Bxf6 11.Bd5 Rb8 12.O-O Nd4 13.Nc4 b5 14.Ne3 Bg5 15.Ne2 Bxe3 
16.fxe3 Ne6 17.Ng3 Qb6 18.Qd2 Nc7 19.Bb3 Be6 20.Nf5 Bxf5 21.Rxf5 Ne8 22.Raf1 
Nf6 23.Rxf6 gxf6 24.Rxf6 a5 25.Qf2 Kh8 26.Rh6 Rg8 27.Bxf7 Rg7 28.Bd5 Qd8 29.Rf6
Rc7 30.c3 b4 31.c4 a4 32.Qf5 Re7 33.Bf7 Qd7 34.Be6 Qd8 35.c5 Rg7 36.c6 a3 37.b3
Qe7 38.c7 Qxc7 39.Rf8+ Rg8 40.Bxg8 Rxf8 41.Qxf8 Qg7 42.Qxg7+ Kxg7 43.Bd5 1-0

Forum Posts

1997 ...

Comet A.75 in test by Jouni Uski, CCC, November 30, 1997
Comet A 82 by Fernando Villegas, CCC, January 25, 1998
Comet_against_Humans by Ulrich Türke, CCC, May 05, 1998
Comet A90 by Thorsten Czub, CCC, May 16, 1998
Comet A.90 on Winboard by Earl H. Castillo, CCC, August 15, 1998
New Comet B02 Version! by Christian Goralski, CCC, May 30, 1999

2000 ...

Paderborn : A "human" pawn sac by Comet ! by Côme, CCC, February 11, 2000 » IPCCC 2000
Re: Comet B18 Whats new? by Ulrich Türke, CCC, March 24, 2000 » Passed Pawn, Bad bishop
Comet B.31 by Dr. Ulrich Türke is available ! by Frank Quisinsky, CCC, March 10, 2001
Paderborn Comet by Edward Seid, CCC, March 02, 2002 » IPCCC 2002
xboard/Linux version of Comet B.46 available! by Leo Dijksman, CCC, June 10, 2002
Comet B48 under Chess Partner 5.2 by Shaun Brewer, CCC, September 13, 2002
Re: Comet 62b, where I look for it? by Ulrich Türke, CCC, October 21, 2003
Testposition from Comet-The Baron by Richard Pijl, CCC, February 15, 2004 » The Baron, IPCCC 2004
Re: Comet B68 a little question... by Ulrich Türke, CCC, March 21, 2004

2005 ...

What happened to Comet? by Fernando Villegas, CCC, December 16, 2005
OT - Comet 17P Holmes by Charles Roberson, CCC, October 31, 2007 » Holmes ^[8]
A Propos "Comet" by Fernando Villegas, CCC, October 13, 2009

2010 ...

Comet B15, Amy 0.6 Green Light Chess 2.07a available ... by Frank Quisinsky, CCC, February 04, 2010 » Amy, Green Light Chess
More about Comet B68 by Fernando Villegas, CCC, August 06, 2011

External Links

Chess Engine

Comet's ICGA Tournaments
Comet from WBEC Ridderkerk
Index of /chess/engines/Norbert's collection/Comet (Compilation) by Norbert Raimund Leisner, hosted by Kirill Kryukov
Comet B68 in CCRL 40/40

Comet

References

What links here?

Page	Date Edited
Aegon 1996	Jan 22, 2017
Aegon 1997	Apr 7, 2017
Amy	May 9, 2017
CCT4	Apr 22, 2013
CCT5	Feb 22, 2013
CCT6	May 29, 2014
Comet	Jan 8, 2016
Daniel Mehrmann	Dec 13, 2015
Engines	Mar 10, 2018
Gazebo	May 21, 2017
Green Light Chess	Jan 21, 2018
Heiner Matthias	Mar 8, 2016
Holmes	Apr 24, 2014
ICT 2002	Nov 19, 2016
IPCCC 1997	Aug 24, 2013
IPCCC 1998	Feb 25, 2018
IPCCC 1999	Dec 21, 2012
IPCCC 2000	Dec 21, 2012
IPCCC 2001	Jan 9, 2014
IPCCC 2002	May 31, 2014
IPCCC 2003	Aug 17, 2016
IPCCC 2004	Dec 1, 2014
Karsten Bauermeister	Sep 6, 2015
King of Kings	Sep 4, 2013
The Baron	Jan 8, 2018
Ulrich Türke	Jan 8, 2016
WMCCC 1995	Jan 3, 2018
WMCCC 1996	Sep 15, 2016
WMCCC 1997	Apr 4, 2017

Up one Level

Crafty

GerdIsenberg — Sun, 28 Jan 2018 09:05:11 GMT

Home * Engines * Crafty

		Crafty, ^[1] a portable open source engine supporting the Chess Engine Communication Protocol written by Robert Hyatt in ANSI C starting in the early 90s, loosely derived from Cray Blitz, winner of the 1983 and 1986 World Computer Chess Championships ^[2]. Crafty pioneered in using Rotated bitboards , parallel search and probing Nalimov Tablebases. It performs a principal variation search, null move pruning, LMR as well as a SEE swap algorithm for move ordering and to prune "bad" captures in quiescence search. In 2006/2007, Crafty switched from rotated to Magic bitboards ^[3], according to Robert Hyatt because it was not faster but simpler ^[4]. Crafty 25.1, released in October 2016, not only includes an increase in playing strength ^[5] but support for Syzygy bases by Ronald de Man aided by the coding contributions of Basil Falcinelli ^[6]. Crafty 25.3 features playing strength adjustment between 800 and 2600 Elo ^[7].
Crafty Owl ^[8]

Leading or Trailing Zeros

Team Members

as mentioned at WCRCC 2010 ^[9] and CCT15, 2013 ^[10]

Peter Berger, Crafty's book author at WCCC 2004, WCCC 2005 and WCCC 2006
Michael Byrne
Robert Hyatt
Tracy Riegle
Peter Skinner

Tournaments

Crafty participated at four World Microcomputer Chess Championships, the WMCCC 1996, WMCCC 1997, WMCCC 2000, and WMCCC 2001, three World Computer Chess Championships, the WCCC 2004, WCCC 2005 and WCCC 2006, the ACCA Americas' Computer Chess Championships, the ACCA World Computer Rapid Chess Championships, CCT and various other tournaments. Crafty won the CCT1 in 2000, CCT5 in 2003 and CCT6 in 2004. At the Fifth Annual ACCA Americas' Computer Chess Championships in 2010 Crafty was runner-up behind Thinker ^[11] .

Descriptions

1997

from the ICGA page ^[12] :

Crafty is a "bitmapper" using 64 bit words to represent the chess board, along the lines of the famous Chess 4.x program from Northwestern University. It uses a traditional alpha/beta search with the PVS (null-window) enhancement, along with null-moves (R=2) and lots of search extensions including "fractional ply extensions" to drive the search deeper along interesting lines. It has a very simple quiescence search that only considers capture moves and is fairly selective about which captures are included. It does a full endpoint evaluation, with no root pre-processing nor incrementally updated scoring terms. It is currently about 37,000 lines of ANSI C with about 3,000 lines of that being evaluation.

Since Crafty uses bitmaps, much of the evaluation is significantly shorter than it would be in a more traditional (array-based) board representation, so that this 3,000 lines of code is somewhat misleading (for example, to ask "can this pawn run and promote before the opposing king can get there?" only takes one line of code in Crafty. It is still very fast, searching around 100,000 moves per second. At 60 seconds per move, it solves 297/300 of the Win At Chess tactical positions. It has a large opening database composed from 250,000 GM games, and uses 3-4-5 piece endgame databases during the search (not just at the root of the tree.) It has played over 100,000 games during the past two years, playing on various chess servers around the world, and has maintained ratings on these servers that are always near the very top.

2008

from a CCC post ^[13] :

Crafty's basic search is pretty simple. Just PVS + null-move + LMR + check extension (all others have been removed after testing showed they hurt performance rather than helped), + simple q-search checks (I am playing with this as I write this however and it might change) + simple q-search. I've used killers and hashing since middle 70's so those are not new. Bitboards were around in the middle 70's so that's not new. I don't think there is anything remarkable in my evaluation, certainly nothing we were not doing 15 years ago or longer, other than tuning adjustments.

As far as tuning goes on LMR and null-move, I have not gone very far afield there. I use R=3 everywhere. LMR is a 1-ply reduction although I have plans to try a variable reduction so that for moves that look really ugly I reduce them even further (white playing Na1 for example, with king on the other side of the board, no passed pawns, etc...)

I have even run without the check extension, the only one that is left. Many think the purpose of this extension is to find deep mates. That's wrong. The purpose is to try to expose horizon-effect moves and avoid them when possible. I also want to test a restricted check extension, where it is only applied in the last N plies where the horizon effect is most notable, where right now I apply them everywhere with no limit, always +1 ply added to depth.

Generation II

Crafty 25.0, Generation II, December 2015 ^[14]

This version contains a major rewrite of the parallel search code, now referred to as Generation II. It has a more lightweight split algorithm, that costs the parent MUCH less effort to split the search. The key is that now the individual "helper" threads do all the work, allocating a split block, copying the data from the parent, etc., rather than the parent doing it all. Gen II based on the DTS "late-join" idea so that a thread will try to join existing split points before it goes to the idle wait loop waiting for some other thread to split with it. In fact, this is now the basis for the new split method where the parent simply creates a split point by allocating a split block for itself, and then continuing the search, after the parent split block is marked as "joinable". Now any idle threads just "jump in" without the parent doing anything else, which means that currently idle threads will "join" this split block if they are in the "wait-for-work" spin loop, and threads that become idle also join in exactly the same way. This is MUCH more efficient, and also significantly reduces the number of split blocks needed during the search. We also now pre-split the search when we are reasonably close to the root of the tree, which is called a "gratuitous split. This leaves joinable split points laying around so that whenever a thread becomes idle, it can join in at these pre-existing split points immediately. We now use a much more conservative approach when dealing with fail highs at the root. Since LMR and such have introduced greater levels of search instability, we no longer trust a fail-high at the root if it fails low on the research. We maintain the last score returned for every root move, along with the PV . Either an exact score or the bound score that was returned. At the end of the iteration, we sort the root move list using the backed-up score as the sort key, and we play the move with the best score. This solves a particularly ugly issue where we get a score for the first move, then another move fails high, but then fails low and the re-search produces a score that is actually WORSE than the original best move. We still see that, but we always play the best move now. One other efficiency trick is that when the above happens, the search would tend to be less efficient since the best score for that fail-high/fail-low move is actually worse than the best move/score found so far. If this happens, the score is restored to the original best move score (in Search()) so that we continue searching with a good lower bound , not having to deal with moves that would fail high with this worse value, but not with the original best move's value.
We also added a new method to automatically tune the new SMP parameters. The command is autotune and "help autotune" will explain how to run it.
In addition , we did a complete re-factor of pawn evaluation code. There were too many overlapping terms that made tuning difficult. Now a pawn is classified as one specific class, there is no overlap between classes, which simplifies the code significantly. The code is now easier to understand and modify. In addition, the passed pawn evaluation was rewritten and consolidates all the passed pawn evaluation in one place. The evaluation used to add a bonus for rooks behind passed pawns in rook scoring, blockading somewhere else, etc. All of this was moved to the passed pawn code to make it easier to understand and modify.
Added a limited version of late move pruning (LMP) for the last two plies. Once a set number of moves have been searched with no fail high, non-interesting moves are simply skipped in a way similar to futility pruning.
We had a minor change to history counters that now rely on a "saturating counter" idea. I wanted to avoid the aging idea, and it seemed to not be so clear that preferring history moves by the depth at which they were good was the way to go. I returned to a history counter idea I tested around 2005 but discarded, namely using a saturating counter. The idea is that a center value (at present 1024) represents a zero score. Decrementing it makes it worse, incrementing it makes it better. But to make it saturate at either end, I only reduce the counter by a fraction of its distance from the saturation point so that once it gets to either extreme value, it will not be modified further avoiding wrap-around. This basic idea was originally reported by Mark Winands in 2005. It seems to provide better results (slightly) on very deep searches. One impetus for this was an intent to fold this into a move so that I could sort the moves rather than doing the selection approach I currently use. However, this had a bad effect on testing, since history information is dynamic and is constantly changing, between two moves at the same ply in fact. The sort fixed the history counters to the value at the start of that ply. This was discarded after testing, but the history counter based on the saturating counter idea seemed to be OK and was left in even though it produced minimal Elo gain during testing.
We change to the way moves are counted, to add a little more consistency to LMR. Now Next*() returns an order number that starts with 1 and monotonically increases, this order number is used for LMR and such decisions that vary things based on how far down the move list something occurs. Root move counting was particularly problematic with parallel searching, now things are at least "more consistent". The only negative impact is that now the move counter gets incremented even for illegal moves, but testing showed this was a no-change change with one thread, and the consistency with multiple threads made it useful.
Added the "counter-move" heuristic for move ordering (Jos Uiterwijk, IJICCA) which simply remembers a fail high move and the move at the previous ply. If the hash, captures or killer moves don't result in a fail high, this move is tried next. No significant cost, seems to reduce tree size noticeably. Added a follow-up idea based on the same idea, except we pair a move that fails high with the move two plies back, introducing a sort of "connection" between them. This is a sort of "plan" idea where the first move of the pair enables the second move to fail high. The benefit is that this introduces yet another pair of good moves that get ordered before history moves, and is therefore not subject to reduction. I have been unable to come up with a reference for this idea, but I believe I first saw it somewhere around the time Fruit showed up, I am thinking perhaps in the JICCA/JICGA. Any reference would be appreciated.
A minor change to the way the PV and fail-hi/fail-low moves are displayed when pondering .
Crafty now adds the ponder move to the front of the PV enclosed in parentheses so that it is always visible in console mode. The depths are reaching such extreme numbers the ponder move scrolls off the top of the screen when running in console mode or when "tail -f" is used to watch the log file while a game is in progress. This is a bit trickier than you might think since Crafty displays the game move numbers in the PV.
The penalty for pawns on same color as bishop now only applies when there is one bishop.

Leading or Trailing Zeros

Crafty had always mapped square-index 0 to square 'a1', 7 to 'h1', and 63 to 'h8' respectively, but recently (crafty-20.6) reversed the bit-index versus square-index mapping from leading to trailing zero count based little-endian rank-file (LERF), using bitscan forward (LSB) to retrieve squares in a1-h8 order, as most often used in CPW bitboard samples.

LSB

Trailing zero count aka bitscan forward for non empty sets as used in bitboard serialization for move generation and evaluation purposes, is implemented with x86-64 bsf instruction via intrinsic or inline assembly if available (there are also 32-bit x86 bsf versions), and a conditional 16-bit byte lookup approach otherwise - Windows 64, Linux 64 and lookup versions with preprocessor instructions for conditional compiles omitted ^[15]:

int LSB(BITBOARD arg1) {
  unsigned long index;
  if (_BitScanForward64(&index, arg1))
    return index;
  else
    return 64;
}
 
int static __inline__ LSB(long word)
{
  long dummy, dummy2;
 
asm("          bsfq    %1, %0     " "\n\t"
    "          jnz     1f         " "\n\t"
    "          movq    $64, %0    " "\n\t"
    "1:                           " "\n\t"
:   "=&r"(dummy), "=&r" (dummy2)
:   "1"((long) (word))
:   "cc");
  return (dummy);
}
 
unsigned char lsb[65536];
 
int LSB(BITBOARD arg1) {
  if ( arg1        & 65535) return (lsb[ arg1        & 65535]);
  if ((arg1 >> 16) & 65535) return (lsb[(arg1 >> 16) & 65535] + 16);
  if ((arg1 >> 32) & 65535) return (lsb[(arg1 >> 32) & 65535] + 32);
  return (lsb[arg1 >> 48] + 48);
}

Last One

Earlier Crafty versions prior to 20.6 had a leading zero count compliant, big-endian rank-file mapping. Left-bottom square (from White's point of view) 'a1' with square-index 0 was mapped to the leftmost, arithmetical most significant bit of an unsigned 64-bit integer with bit-index 63, while square 'h8' with square-index 63, was mapped to the rightmost, arithmetical least significant bit with bit-index 0. Bitscan forward and found index reversal was used in LastOne, to retrieve squares in h8-a1 order ^[16]:

int LastOne(BITBOARD arg1)
{
  unsigned long index;
  if (_BitScanForward64(&index, arg1))
    return 63 - index;
  else
    return 64;
}

This one was found in 15.17 with MAC OS support ^[17]

int LastOne(register BITBOARD a)
{
  register unsigned long i;
  if (i = a & 0xffffffff)
    return(__cntlzw(i ^ (i - 1)) + 32);
  if (i = a >> 32)
    return(__cntlzw(i ^ (i - 1)));
  return(64);
}

Selected Games

WCCC 2004

WCCC 2004, round 9, Falcon - Crafty ^[18]

[Event "WCCC 2004"]
[Site "Ramat Gan, Israel"]
[Date "2004.07.11"]
[Round "9"]
[White "Falcon"]
[Black "Crafty"]
[Result "0-1"]
 
1.e4 e5 2.Nf3 Nc6 3.Bb5 Nf6 4.Nc3 Bd6 5.O-O O-O 6.d3 h6 7.Be3 a6 8.Ba4 b5 
9.Bb3 Na5 10.d4 exd4 11.Bxd4 Be7 12.e5 Ne8 13.Nd5 Nxb3 14.axb3 c5 15.Be3 
Bb7 16.b4 Bxd5 17.Qxd5 Nc7 18.Qb7 Rb8 19.Qe4 cxb4 20.Rfd1 Qc8 21.Nd4 Re8 
22.Nf5 Bf8 23.Qg4 Kh7 24.Bxh6 gxh6 25.Qh5 Kg8 26.Rd3 Re6 27.Rg3+ Rg6 28.Rxg6+ 
fxg6 29.Qxg6+ Kh8 30.Nxh6 Bxh6 31.Qxh6+ Kg8 32.Qg6+ Kf8 33.Rd1 Ne6 34.Rd3 
Ke7 35.Qf6+ Ke8 36.Rg3 Qc5 37.Rg8+ Nf8 38.Rg7 Rb6 39.Qf7+ Kd8  40.Rg8 Kc7 
41.Qxf8 Qxf8 42.Rxf8 a5 43.Ra8 a4 44.g3 Rb8 45.Ra7+ Rb7 46.Ra5 Kb6 47.Ra8 
Ra7 48.Rb8+ Kc6 49.Rc8+ Kd5 50.e6 dxe6 51.Rd8+ Kc5 52.Rc8+ Kb6 53.Re8 a3 
54.Rxe6+ Kc5 55.bxa3 0-1

WCCC 2006

WCCC 2006, round 8, Diep - Crafty ^[19]

[Event "WCCC 2006"]
[Site "Turin, Italy"]
[Date "2006.05.30"]
[Round "8"]
[White "Diep"]
[Black "Crafty"]
[Result "0-1"]
 
1.e4 e5 2.Nf3 d6 3.d4 exd4 4.Nxd4 Nf6 5.Nc3 Be7 6.Bf4 O-O 7.Qd2 c6 8.O-O-O b5 
9.f3 b4 10.Nce2 c5 11.Nb3 Nc6 12.Bxd6 c4 13.Nc5 Qa5 14.Bxe7 Nxe7 15.Qd6 Nf5 
16.exf5 Qxa2 17.g4 a5 18.Rd4 Re8 19.Kd1 Qxb2 20.Nc1 b3 21.cxb3 cxb3 22.Bd3 a4 
23.Re1 Rxe1+ 24.Kxe1 Qxc1+ 25.Ke2 Bb7 26.Qd8+ Ne8 27.Qe7 Bc6 28.Bc4 Nf6 29.Bxf7+ 
Kh8 30.Nd3 b2 31.Rd8+ Rxd8 32.Qxd8+ Be8 33.Bxe8 Qc2+ 34.Ke3 Nd5+ 35.Kd4 Qc3+ 
36.Ke4 Qc7 37.Qxc7 Nxc7 38.Nxb2 a3 39.Bf7 axb2 40.Ba2 Nb5 41.Kd3 Na3 42.g5 b1=B+ 
43.Bxb1 Nxb1 44.h4 Kg8 45.h5 Kf8 46.f4 Ke7 47.Kd4 Nd2 48.Ke3 Nc4+ 49.Kd4 Nd6 
50.Ke5 Nf7+ 51.Kd5 h6 52.f6+ gxf6 53.g6 Nd8 54.f5 Nb7 55.Kc6 Na5+ 0-1

Copyright

Many programmers did not grasp Crafty's Copyright statement, but apparently took remarks by Robert Hyatt like in his reply to Ren Wu, January 26, 1999, concerning code reuse and not reinventing the wheel as alibi for their chess programming ^[20] :

This is a basic tenet of software engineering called 'code reuse'. Why should I pay you to write something from scratch and take a year, if you can take something that exists and modify it to do the same thing in a month? And then I don't have as much trouble debugging and testing, since it is mostly already done...

that's not a bad side to this... Of course occasionally starting over is a good thing. But not starting from 'scratch'. IE if you don't know what has already been tried, you will re-invent the same bad wheels over and over and probably follow the same footsteps many before you did... software engineering wants to avoid that 'reinvention' problem...

Robert Hyatt further on the copyright problem ^[21] :

My primary requirement is that if something is done to crafty to make it 'better', then that 'something' must be as public as the original code was. Because many have contributed bits and pieces... Eugene, George, Steffen, Mark, SJE, and many others that are to numerous to mention. Seems unfair that they modify what I did, then they make their stuff public, and then someone else takes _all_ of this and purports it to be 'original'.

I suppose it has to do with 'national morals' or whatever, ie the software piracy problem in China, to name but one.

Crafty Clones

1. Bionic Impakt
2. Brause
3. Chinito
4. Fafis
5. Gunda-1
6. Kaissa (BY)
7. LaGrande
8. LaPetite
9. Patriot
10. Voyager

Publications

Robert Hyatt, Monroe Newborn (1997). CRAFTY Goes Deep. ICCA Journal, Vol. 20, No. 2
Ernst A. Heinz (2001). Modeling the “Go Deep” Behaviour of CRAFTY and DARK THOUGHT. Advances in Computer Games 9 » Depth, DarkThought
Levente Kocsis, Jos Uiterwijk, Eric Postma, Jaap van den Herik (2002). The Neural MoveMap Heuristic in Chess. CG 2002, pdf » Neural MoveMap Heuristic
Albert Xin Jiang (2003). Implementation of Multi-ProbCut in Chess. CPSC 449 Thesis, pdf
Jan Renze Steenhuisen (2005). New Results in Deep-Search Behaviour. ICGA Journal, Vol. 28, No. 4, pdf
Matej Guid, Ivan Bratko (2007). Factors affecting diminishing returns for searching deeper. CGW 2007 » Crafty, Rybka, Shredder, Diminishing Returns
Matej Guid, Ivan Bratko (2007). Factors affecting diminishing returns for searching deeper. ICGA Journal, Vol. 30, No. 2, pdf
Matej Guid, Aritz Pérez, Ivan Bratko (2007). How trustworthy is Crafty's analysis of world chess champions? CGW 2007
Matej Guid, Aritz Pérez, Ivan Bratko (2008). How trustworthy is Crafty's analysis of world chess champions? ICGA Journal, Vol. 31, No. 3, pdf
Robert Hyatt (2014). A Solution to Short PVs Caused by Exact Hash Matches. ICGA Journal, Vol. 37, No. 3 » Transposition Table, Separate TT for the PV
Monroe Newborn, Robert Hyatt (2014). Computer Chess Endgame Play with Pawns: Then and Now. ICGA Journal, Vol. 37, No. 4 » Peasant, Pawn Endgame
Guy Haworth (2015). Chess Endgame News. ICGA Journal, Vol. 38, No. 1 » FinalGen

Forum Posts

1995 ...

Re: Crafty version 8.7 by Robert Hyatt, rgcc, October 05, 1995
Crafty V9.22 by Robert Hyatt, rgcc, April 05, 1996
Crafty V9.26 by Robert Hyatt, rgcc, May 08, 1996
Crafty's opening book - technical details by Robert Hyatt, rgcc, October 04, 1996
Crafty 11.15 by Robert Hyatt, rgcc, January 30, 1997
Repetitions in Crafty by Martin Borriss, rgcc, January 30, 1997 » Repetitions
quiescence search by Andrew Tridgell, rgcc, April 16, 1997 » Quiescence Search, Check
Crafty and fastest Cray: question to Bob by Jouni Uski, CCC, December 01, 1997
Parallel Crafty by Robert Hyatt, CCC, March 19, 1998
Current Crafty strength on SMP? by Charlton Harrison, rgcc, April 29, 1998
crafty copyright problem by Robert Hyatt, rgcc, February 17, 1999 » Voyager
Crafty Modifications MUST be made available to Robert Hyatt by KarinsDad, CCC, February 17, 1999
Crafty implications ... by Chris Whittington, rgcc, March 4, 1999
Do have the Crafty the Assembler written core? by Leonid, CCC, November 01, 1999

2000 ...

Crafty internal iterative deepening by Tijs van Dam, CCC, January 26, 2000 » Internal Iterative Deepening
Crafty 17.13 - re-importing FEN files? by Wieland Belka, CCC, November 02, 2000
Crafty 17.13 - using game archives by engines? by Wieland Belka, CCC, November 02, 2000
razoring in crafty version 16.9, mid 1999 by Vincent Diepeveen, August 21, 2002
Crafty SMP questions by Matthew Hull, CCC, August 05, 2003 » SMP
Crafty 19.08 SE 2004 released ... by Michael Byrne, Winboard Forum, January 01, 2004 » Wb2UCI
Re: Crafty 1910 SE vs Ruffian2 I hate this , but by Peter Skinner, CCC, February 04, 2004 » Ruffian
is this a sign of broken smp by Michael Byrne, CCC, March 09, 2004 » SMP
Question about Crafty and Bishop Pair by Renze Steenhuisen, CCC, July 13, 2004 » Bishop Pair

2005 ...

Re: need help in compiling Crafty by Joshua Haglund, CCC, February 19, 2005
Crafty and assembly code by Alain Zanchetta, CCC, May 08, 2005
Re: BitBoard Tests Magic v Non-Rotated 32 Bits v 64 Bits by Robert Hyatt, CCC, August 25, 2007 » Magic Bitboards
crafty-22.0 by Robert Hyatt, CCC, February 18, 2008
Crafty questions by Pablo Vazquez, CCC, May 16, 2008
Re: Lemming Poll by Robert Hyatt, CCC, September 22, 2008 » Tapered Eval, LearningLemming
Crafty - no analysis output near mate? by cyberfish, December 03, 2008

2010 ...

old crafty vs new crafty on new hardware by Robert Hyatt, CCC, September 11, 2010
Crafty tests show that Software has advanced more by Don Dailey, CCC, September 12, 2010
Final results - Crafty - hardware vs software by Robert Hyatt, CCC, September 13, 2010
hardware doubling number for Crafty by Robert Hyatt, CCC, September 15, 2010

2011

On Crafty... by Robert Hyatt, CCC, May 22, 2011
Re: Robert - How did you came up with the name Crafty by Robert Hyatt, CCC, June 16, 2011
Re: Still waiting on Ed by BB+, OpenChess Forum, July 07, 2011 » on 22.1 vs. 23.4. differences
Re: Still waiting on Ed by Robert Hyatt, OpenChess Forum, July 07, 2011 » on 22.1 vs. 23.4. differences
ICGA rule #2 / opening books / Diep-Crafty, Turino 2006 by Peter Berger, CCC, October 22, 2011 » Opening Book, WCCC 2006

2012

Crafty source by Robert Hyatt, CCC, September 26, 2012

2013

Crafty 23.6 released by Peter Skinner, CCC, June 20, 2013
interesting SMP bug by Robert Hyatt, CCC, September 24, 2013 » Parallel Search
Crafty 23.8 by Robert Hyatt, CCC, November 11, 2013

2014

Crafty 24.0 by Robert Hyatt, CCC, May 26, 2014
Crafty 24.1 by Daniel José Queraltó, CCC, October 01, 2014
Threads test incl. Crafty 24.1 by Andreas Strangmüller, CCC, October 15, 2014 » Thread, Parallel Search

2015 ...

Grafty vs Crafty by Marcel van Kervinck, Rybka Forum, April 21, 2015 » Stockfish
parallel speedup and assorted trivia by Robert Hyatt, CCC, June 05, 2015 » Parallel Search
Crafty UCI version by Marek Soszynski, July 10, 2015 » UCI
An interesting parallel search non-bug by Robert Hyatt, CCC, November 05, 2015 » Parallel Search
Crafty 25.0 Release by Michael B, CCC, December 25, 2015
Crafty 25.0 announcement by Robert Hyatt, CCC, December 28, 2015

2016

crafty eval cache by Alvaro Cardoso, CCC, January 01, 2016 » Evaluation Hash Table
NUMA 101 by Robert Hyatt, CCC, January 07, 2016 » NUMA
Crafty 25.0.1 by Robert Hyatt, CCC, January 15, 2016
Crafty's four hash tables by Louis Zulli, CCC, January 17, 2016 » Hash Table
Crafty c questions by J. Wesley Cleveland, CCC, March 10, 2016 » C
Crafty chess engine by Krzysztof Grzelak, CCC, March 20, 2016
Crafty SMP measurement by Robert Hyatt, CCC, April 04, 2016 » Parallel Search
Around Crafty dev. ... by Frank Quisinsky, CCC, August 31, 2016
Re: Around Crafty dev. ... by Robert Hyatt, CCC, September 01, 2016
Crafty 25.1 Release by Michael B, CCC, October 04, 2016
Crafty v25.2 Release by Michael B, CCC, October 29, 2016

2017

Crafty Play By Elo ( Crafty v25.3) by Michael B, CCC, January 23, 2017 » Playing Strength

External Links

Chess Engine

GitHub - MichaelB7/Crafty
Crafty Chess managed by Tracy Riegle
Index of /downloads/source
Crafty from Wikipedia
Crafty Documentation
Crafty's ICGA Tournaments
The chess games of Crafty (Computer) from chessgames.com
Crafty from WBEC Ridderkerk
How Far We've Come: 20 Years of Personal Computing by Blake Linton Wilfong, November 05, 2000 » ACM 1981, Sargon, Cray Blitz
186.crafty: SPEC CPU2000 Benchmark Description
Crafty Versions at CCRL 40/40

Misc

crafty - Wiktionary
Craft from Wikipedia
American craft from Wikipedia
Arts and Crafts movement from Wikipedia
American Craftsman from Wikipedia
Guitar Craft from Wikipedia
Robert Fripp and the League of Crafty Guitarists, YouTube Video

References

^ Re: Robert - How did you came up with the name Crafty by Robert Hyatt, CCC, June 16, 2011
^ Crafty from Wikipedia
^ Re: Fastest Magic Move Bitboard Generator ready to use by Robert Hyatt, Winboard Forum, November 09, 2006
^ Re: BitBoard Tests Magic v Non-Rotated 32 Bits v 64 Bits by Robert Hyatt, CCC, August 25, 2007
^ Crafty Chess managed by Tracy Riegle
^ Crafty 25.1 Release by Michael B, CCC, October 04, 2016
^ Crafty Play By Elo ( Crafty v25.3) by Michael B, CCC, January 23, 2017
^ Two Girls Being Crafty: Owl Pin Cushion
^ 2010 Fourth Annual ACCA World Computer Rapid Chess Championships - Participants
^ CCT 15 Participants | CCT Events
^ The 2010 Fifth Annual ACCA Americas' Computer Chess Championships - Results
^ Crafty's ICGA Tournaments
^ Re: Hardware vs Software - test result by Robert Hyatt, CCC, December 03, 2008
^ Crafty 25.0 Release by Michael B, CCC, December 25, 2015
^ Index of /downloads/source crafty-23.5.zip, inline64.h, boolean.c
^ Index of /downloads/source, crafty-20.5.zip, boolean.c
^ Index of /downloads/source, crafty-15.17.zip, boolean.c
^ Ramat-Gan 2004 - Chess - Round 9 - Game 3 (ICGA Tournaments)
^ Turin 2006 - Chess - Round 8 - Game 5 (ICGA Tournaments)
^ Re: Bionic v Crafty - a possible solution by Robert Hyatt, CCC, January 26, 1999
^ Re: crafty copyright problem by Robert Hyatt, rgcc, February 17, 1999

What links here?

Page	Date Edited
ACCA 2006	Jul 14, 2014
ACCA 2007	Jul 14, 2014
ACCA 2008	Jul 14, 2014
ACCA 2009	Jul 14, 2014
ACCA 2010	Jul 14, 2014
ACCA 2011	Jul 14, 2014
ACCA 2012	Jul 14, 2014
Alain Zanchetta	Feb 20, 2018
Albert Xin Jiang	Jun 22, 2015
Albrecht Heeffer	Sep 6, 2016
Alexander Naumov	Sep 19, 2014
Alvaro Cardoso	Jan 12, 2018
Amyan	Dec 10, 2013
Andreas Strangmüller	May 15, 2017
Andrew Tridgell	Aug 3, 2015
APHID	Jun 26, 2017
Arasan	Apr 8, 2018
Aritz Pérez	Jan 2, 2017
Artem Petakov	Jan 14, 2017
Aspiration Windows	Nov 1, 2017
AtlanChess	Sep 15, 2016
Bad bishop	Jun 22, 2015
Bionic	May 27, 2013
Bionic Impakt	Sep 6, 2014
Bishop Pair	Sep 10, 2017
Bishops of Opposite Colors	Aug 22, 2012
BitScan	Sep 10, 2017
Book Learning	Jan 1, 2017
Bookbuilder	Feb 4, 2018
Bookup	Feb 4, 2018
Bratko-Kopec Test	Jun 1, 2015
Brause	Aug 30, 2017
C	Feb 19, 2018
CCT Tournaments	Jan 29, 2017
CCT1	Dec 30, 2012
CCT10	May 5, 2013
CCT11	Feb 17, 2015
CCT12	Jan 28, 2018
CCT13	Dec 6, 2013
CCT14	Aug 23, 2012
CCT15	Oct 21, 2014
CCT16	May 13, 2014
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
Centipawns	Aug 9, 2016
CGW 2007	Jan 2, 2017
Check	Feb 1, 2018
Check Extensions	Apr 19, 2018
Chess Assistant	Jul 16, 2017
Chess Wizard	Dec 22, 2014
Chezzz	Jan 20, 2013
Chinito	Jan 7, 2016
Cluster Toga	Jan 7, 2016
Copy-Make	May 23, 2017
Crafty	Jan 28, 2018
Cray Blitz	Dec 25, 2017
Cutechess-cli	Jan 6, 2018
DanChess	Jun 17, 2012
DEC Alpha	Aug 15, 2015
Deep Sjeng	Jan 7, 2016
Dennis Sceviour	Feb 14, 2018
Depth	Feb 25, 2018
DOCCC 2001	Aug 15, 2015
Dreamer	Aug 5, 2015
Edwards' Tablebases	Sep 26, 2016
Eigenmann Endgame Test	Jun 1, 2017
Endgame Tablebases	Mar 6, 2018
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Equinox	Dec 12, 2016
Ethereal	Mar 20, 2018
Eugen	Jan 7, 2016
Eugenio Castillo Jiménez	Jul 23, 2017
Evaluation Hash Table	Dec 4, 2016
Evaluation of Pieces	Jan 8, 2018
Fafis	May 17, 2016
Fernando Villegas	Aug 15, 2016
FinalGen	Aug 14, 2016
Firefly	Oct 23, 2017
Fortress (Engine)	Oct 19, 2017
Frank Phillips	Sep 26, 2016
Frédéric Louguet	Aug 4, 2013
Gabriele Müller	Jan 22, 2012
Gavon	Apr 30, 2018
Gazebo	May 21, 2017
Ghost	Feb 2, 2018
GridChess	Jul 13, 2016
GridGinkGo	Jul 13, 2016
GridProtector	Jul 13, 2016
Guido Schimmels	Apr 23, 2013
Gunda-1	Jan 8, 2016
Guy Haworth	Nov 20, 2017
Hakkapeliitta	Apr 26, 2016
Hans Secelle	Nov 2, 2012
Hardware	Jan 20, 2018
Harun Taner	May 17, 2015
Hash Table	Jan 1, 2018
Hidden Passed Pawn	Nov 11, 2017
Historical Examples	Jan 16, 2017
Hossa	Jan 7, 2016
Houdini	Apr 14, 2018
ICGA Journal	Dec 21, 2017
InterChess	Jan 8, 2016
Internal Iterative Deepening	Feb 5, 2018
IsiChess	Jan 7, 2016
Itanium	Aug 29, 2015
Ivan Bratko	Aug 16, 2017
Jan Renze Steenhuisen	Sep 10, 2017
John Merlino	Feb 26, 2015
Jouni Uski	Sep 28, 2017
Junior	Feb 27, 2018
Kaissa (BY)	May 16, 2016
King of Kings	Sep 4, 2013
King Safety	Feb 14, 2018
Knowledge	Jul 22, 2017
LaGrande	Jan 22, 2012
LaPetite	Jan 22, 2012
Leila	May 8, 2017
Leonid Liberman	May 23, 2015
List (Program)	Jan 7, 2016
Logging	Jan 20, 2018
Louis Zulli	Feb 18, 2015
Magic Bitboards	Apr 13, 2018
Marcel van Kervinck	Dec 6, 2017
Martin Thoresen	Apr 29, 2015
Match Statistics	Mar 31, 2018
Matej Guid	Jan 6, 2018
Mathematician	Apr 9, 2018
Matthew Lai	Dec 6, 2017
MBChess	Sep 29, 2012
Michael Byrne	Jun 23, 2017
Michel Langeveld	Feb 4, 2018
Monroe Newborn	Dec 23, 2017
Movei	Jan 7, 2016
Nalimov Tablebases	Dec 23, 2016
Naum	Nov 23, 2017
Neural MoveMap Heuristic	Sep 24, 2015
Novag Best-Publication Awards to Include	Jan 2, 2014
Null Move Pruning	Dec 2, 2017
NUMA	Mar 29, 2017
OliThink	May 19, 2017
Open Source Engines	Jul 14, 2015
Opponent Model Search	Aug 14, 2017
Outside passed pawn	Jun 7, 2012
Pablo Vazquez	Apr 11, 2014
Parallel Search	Dec 30, 2017
Patriot	Sep 27, 2016
Pawn Endgame	Oct 11, 2017
Pawn Race	Dec 16, 2017
Peasant	May 21, 2015
Pepito	Nov 27, 2014
Perft	Sep 26, 2017
Perft Results	Feb 10, 2018
Persistent Hash Table	Dec 31, 2017
Peter Berger	Feb 29, 2016
Peter Skinner	Oct 30, 2016
Playing Strength	Mar 31, 2018
Plisk	Dec 31, 2014
Point Value by Regression Analysis	Aug 26, 2017
PowerPC	Oct 6, 2017
Principal Variation Search	Oct 22, 2017
ProbCut	Mar 25, 2016
Protector	Oct 12, 2017
Protocols	Jan 20, 2018
PVS and aspiration	Oct 8, 2014
PyChess	Dec 28, 2017
Quantifying Evaluation features	Jun 6, 2012
Quiescence Search	Aug 19, 2017
Rafael Peña	Nov 9, 2011
Razoring	Oct 5, 2015
RedQueen	Nov 13, 2017
Relative History Heuristic	Jun 8, 2015
Rémi Coulom	Feb 5, 2018
Ren Wu	Jul 23, 2017
Repetitions	Jan 16, 2018
Robert Houdart	Dec 8, 2017
Robert Hyatt	Dec 25, 2017
Rudolf Huber	Jan 7, 2016
Rybka	Mar 27, 2017
Rybka Controversy	Jan 18, 2018
Sargon	Dec 25, 2017
Searcher	Sep 26, 2016
SEE - The Swap Algorithm	Jun 5, 2017
Severi Salminen	May 7, 2015
Shredder	Jan 21, 2018
Sloppy	Sep 17, 2016
SMP	Dec 26, 2017
Software	Jul 28, 2017
Steffen A. Jakob	Jan 7, 2016
Stockfish	Apr 7, 2018
Strategic Test Suite	Dec 19, 2016
Suryadi Harmanto	Mar 21, 2015
Tapered Eval	Jan 9, 2018
TCEC Season 5	Jun 2, 2014
TCEC Season 6	Dec 2, 2014
TCEC Season 7	Jan 23, 2015
TCEC Season 8	Nov 30, 2015
Thread	Apr 22, 2018
Tijs van Dam	Feb 27, 2017
Tony Hedlund	Jun 19, 2017
UCI	Mar 4, 2018
University of Alabama at Birmingham	Jul 14, 2014
Unmake Move	Jun 10, 2017
Vladimir Yelin	May 16, 2016
Voyager	Aug 12, 2012
Wb2UCI	Feb 1, 2018
WCCC 1999	Jul 13, 2017
WCCC 2004	Jan 28, 2018
WCCC 2005	Dec 27, 2016
WCCC 2006	Jan 28, 2018
WCRCC 2007	Nov 21, 2016
WCRCC 2008	Nov 21, 2016
WCRCC 2009	Jul 14, 2014
WCRCC 2010	Jul 14, 2014
WCRCC 2011	Oct 21, 2014
WCRCC 2012	Jul 14, 2014
WCRCC 2014	Jul 27, 2014
WCRCC 2015	Jul 19, 2015
WCRCC 2016	Jun 27, 2017
Weak Pawns	Dec 19, 2013
Who's Who	Sep 6, 2017
Wieland Belka	Jul 13, 2013
Win at Chess	Sep 25, 2017
Wing	Oct 26, 2017
WMCCC 1996	Sep 15, 2016
WMCCC 1997	Apr 4, 2017
WMCCC 2000	Feb 27, 2018
WMCCC 2001	Jul 25, 2017
World Computer Chess Championship	Mar 6, 2018
Xiphos	Apr 22, 2018
Zappa	Oct 24, 2017
Đorđe Vidanović	Feb 20, 2017

Up one level

Doctor?

GerdIsenberg — Tue, 07 Jun 2016 13:07:33 GMT

Home * Engines * Doctor?

		Doctor?, is the commercial successor of Bobby II by Hans-Joachim Kraas and Günther Schrüfer. It was market by ChessBase as 16-bit engine in 1995 as analysis engine for ChessBase/Windows 1.0, and in 1998 as 32-bit add-on engine of the Fritz 5.32 package ^[1]^[2]. Doctor? was written in C and is therefor available for various hardware platforms and operating systems.
Doctor Who ^[3]

Program Characteristics

Program Characteristics

^[4]

STC-Search (solution tree cost oriented search) ^[5]
Ample chess knowledge in evaluation function and search heuristics.
positional playing style with tactical surprises.
written fully in C
implemented on Atari ST, PC (Unix, Win3.x, Win95/98, WinNT), Mac, Sun, BiiN

Forum Posts

Doctor module for Fritz/Chessbase? by MLK and RJP, rgcc, December 07, 1997
Doctor 3.0? by Swaminathan Natarajan, CCC, April 01, 2009

External Links

Refererences

^ Fritz 5.32 - mehr als nur ein Update! by Peter Schreiner (German), Schachclub Leinzell
^ Doctor? 2.0 / Engine MacIntosh from Schachversand Niggemann
^ Doctor Who from Wikipedia
^ Doctor? by Dr. Hans-Joachim Kraas and Dr. Gunther Schrüfer
^ Günther Schrüfer (1988). Minimax-Suchen : Kosten, Qualität und Algorithmen. Braunschweig : Technische Universität. (German)

What links here?

Page	Date Edited
Aegon 1996	Jan 22, 2017
Bobby	Jan 7, 2016
Doctor?	Jun 7, 2016
Engines	Mar 10, 2018
Günther Schrüfer	Jan 7, 2016
Hans-Joachim Kraas	Jan 7, 2016

Up one Level

Fritz

GerdIsenberg — Mon, 26 Feb 2018 11:33:20 GMT

Home * Engines * Fritz

		Fritz (early versions called Knightstalker in the USA), a series of chess programs published by ChessBase, until Fritz 13 the engine developed by primary author Frans Morsch and Mathias Feist, Deep Fritz 14 released in November 2013 by Gyula Horváth ^[1], and Fritz 15 in November 2015 by Vasik Rajlich ^[2] ^[3]. Fritz 1-13 were based on Frans Morsch's program Quest, and was first marketed by ChessBase in 1991 as MS-DOS program with its own Graphical User Interface ^[4] . Since version 4, released in 1996, Fritz ran on Windows, and is until today one the world’s most popular and successful chess programs. At the WCCC 1995, Fritz became World Computer Chess Champion, winning a notable game versus Deep Blue prototype ^[5] and the playoff ^[6] against Star Socrates.
Unser Fritz 2/3, protego sundial and machine hall ^[7]

Etymology

The given name Fritz originated as a German nickname for Friedrich, or Frederick (der "Alte Fritz" was a nickname for King Frederick II of Prussia, and of Frederick III, German Emperor ^[8]), as well as for similar names including Fridolin. Fritz was also a name given to German troops by the British and others in the first and second world wars, equivalent to Tommy, as the British troops were called by German and other troops ^[9] . Creative ChessBase partner Olaf Oldigs ^[10] had suggested the name Fritz for the chess program ^[11] .

Selected Games

WCCC 1995, round 5, Deep Blue Prototype - Fritz ^[12]

[Event "WCCC 1995"]
[Site "Chinese University HKG"]
[Date "1995.05.29"]
[Round "5"]
[White "Deep Blue Prototype"]
[Black "Fritz"]
[Result "0-1"]
 
1.e4 c5 2.Nf3 Nc6 3.d4 cxd4 4.Nxd4 Nf6 5.Nc3 e5 6.Ndb5 d6 7.Bg5 a6 8.Na3 b5
9.Bxf6 gxf6 10.Nd5 f5 11.Bd3 Be6 12.Qh5 f4 13.O-O Rg8 14.Kh1 Rg6 15.Qd1 Rc8
16.c4 Qh4 17.g3 Qh3 18.Qd2 f3 19.Rg1 Rh6 20.Qxh6 Qxh6 21.cxb5 Bxd5 22.exd5
Nb4 23.Bf5 Rc5 24.bxa6 Nxa6 25.Nc2 Qd2 26.Ne1 Rxd5 27.Nxf3 Qxf2 28.Be4 Ra5
29.Rg2 Qe3 30.Re1 Qh6 31.Bc6+ Kd8 32.a3 f5 33.Rc2 Rc5 34.Rxc5 Nxc5 35.Rf1
Be7 36.a4 f4 37.gxf4 Qxf4 38.Rg1 Nxa4 39.b4 Qxb4 0-1

Null Move

Frans Morsch, as well as other Dutch computer chess programmers like Bart Weststrate and Dap Hartmann ^[13] , did early experiments with recursive null move pruning in the late 80s, likely after it was discussed at the panel workshop during the WCCC 1986 after Don Beal's talk covering null move ^[14] ^[15] . Frans Morsch told Chrilly Donninger about recursive null move, who popularized it by his Null Move and Deep Search paper in the ICCA Journal 1993 ^[16] .

Descriptions

from the ICGA tournament page ^[17] :

1995

Fritz is built around a selective search technique known as null-move search. As part of its search, Fritz allows one side to move twice (the other side does a null-move). If the position after the null-move does not return a high value in the evaluation function, then clearly the first of the two moves did not contain a threat. This applies to 95% of the moves in a search. Detecting such moves before they are searched to the full depth is an excellent method to speed-up the search. In its latest version, Fritz manages a 10-times speed-up over a version without the null-move search. Selective search unavoidably introduces oversights, but these are few. In tournaments against humans and other programs, Fritz has proven to be a tough opponent when defending difficult positions.

1997

Fritz won the ICCA chess computer world championship in Hong Kong 1995 beating a prototype of the Deep Blue chess computer. It obtained the best computer result in the 1996 man-computer Aegon tournament. Fritz is build around a selective search technique known as the null-move search. Move generators, evaluation functions and data structures have been designed specially to maximise the effectiveness of the null-move search. If anything, Fritz is fast. The search engine is written in highly optimised assembly language. The present version searches at a rate of one thousand processor cycles per position. The openings book was constructed from grandmaster games. Fritz learns from his games and adjusts the probability weights in the openings book automatically.

1999

Fritz is build around a selective search technique known as the null-move search. As part of its search, Fritz allows one side to move twice (the other side does a null-move). This allows the program to detect weak moves before they are searched to their full depth. Move generators, evaluation functions and data structures have been designed to maximize the effectiveness of the null-move search. Fritz is the winner of the previous computerchess world championship in Hong Kong 1995. 1993 Fritz tied for 1st place in a Blitz tournament in Munich with the complete world elite. It scored the best computer result in the 1996 man-computer Aegon tournament. In 1998 Fritz was leading the prestigious Swedish rating list. It won an active chess tournament Frankfurt 1998 with a full point ahead of 36 grandmasters.

Deep Fritz

Deep Fritz is the engine designed for multiprocessing and parallel search, it first appeared as Deep Fritz 6 in 2000. Since version 14 by Gyula Horváth, Deep is obligatory.

Fritz SSS

A Fritz version called SSS ^[18] or even SSS* ^[19] that played the Dutch Chess Championship 2000 in Rotterdam, becoming third with 7/11 behind Loek van Wely, and Jeroen Piket, shared with Sergei Tiviakov and Paul van der Sterren ^[20], was not related to the SSS* search algorithm, but to the three primary sponsors of the event ^[21] ^[22].

Pocket Fritz

Pocket Fritz is a chess program for PocketPC Personal digital assistants (PDAs). Pocket Fritz 4 is based on Hiarcs by Mark Uniacke, Pocket Fritz 2 used a port of Shredder by Stefan Meyer-Kahlen ^[23] .

Fritz User Interface

Fritz 1

The original Fritz MS-DOS Graphical User Interface from 1991 ^[24]

Fritz 5

Fritz 5 Windows Graphical User Interface ^[25]

Deep Fritz 14

Recent Deep Fritz GUI is suited to run other ChessBase or UCI engines with either using its own proprietary protocol, as well as the UCI protocol.

Deep Fritz 14 GUI ^[26]

Authors

Book Authors

Release Dates

Frans Morsch

Fritz 1.0 : 1991
Fritz Deluxe : 1992
Fritz 2.0 : 1992 or 1993
Fritz 2.51 : 1994
Fritz 3.0 : 1994 or 1995
Fritz 4.0 : 1995 or 1996
Fritz 5.0 : 1997 or 1998
Fritz 5.32 : 1998 or 1999
Fritz 6 : 2000
Deep Fritz : 2000
Fritz 7 : July 2001
Fritz Bahrain : November 2002
Deep Fritz 7.0 : 2003
Fritz 8 : September 2003
X3D Fritz : November 2003
Fritz 8 Bilbao : December 2004
Deep Fritz 8.0 : 2005
Fritz 9 : December 2005
Fritz 10 : October 2006
Deep Fritz 10 : December 2006
Fritz 11 : November 2007
Deep Fritz 11 : November 2008
Fritz 12 : October 2009
Deep Fritz 12 : July 2010
Fritz 13 : October 2011
Deep Fritz 13 : June 2012

Gyula Horváth

Deep Fritz 14 : November 2013

Vasik Rajlich

Fritz 15 : November 2015
Fritz 16 : November 2017

Matches

Publications

Fabian Mäser (1995). Fritz vs.Deep Blue: Opening Book vs, Opening Book. Computer Chess Reports, Vol. 5, No. 2, pp. 22 » WCCC 1995
Robert Hyatt (1995). Still more Fritz vs. Deep Blue: Opening Book vs, Opening Book. Computer Chess Reports, Vol. 5, No. 2, pp. 22
Larry Kaufman (1995). Does Fritz deserve to be World Champion? Selective Search 60, pp 3, pdf hosted by Mike Watters
Karsten Müller (2002). The Clash of the Titans: Kramnik – Fritz Bahrain. ICGA Journal, Vol. 25, No. 4 » Kramnik versus Deep Fritz 2002
Matthias Wüllenweber (2002). The Match from Fritz' View Point. ICGA Journal, Vol. 25, No. 4
David Levy (2003). Kasparov vs X3D Fritz. ICGA Journal, Vol. 26, No. 4 » Kasparov versus X3D Fritz 2003
Christian Liebert (2005). Fritz 9: Der König ist zurück. Computerschach und Spiele Online, pdf (German)
Christian Liebert (2006). Fritz die Zehnte. Computerschach und Spiele Online, pdf (German)
Matthias Wüllenweber, Frederic Friedel, Mathias Feist (2006). Kramnik vs. Deep Fritz 10: Computer wins match by 4-2. ICGA Journal, Vol. 29, No. 4 » Kramnik versus Deep Fritz 2006
Eric Hallsworth (2007). Vladimir Kramnik (World Champion) v Deep Fritz 10. Selective Search 128, pp. 14-24, pdf hosted by Mike Watters

Forum Posts

1991 ...

Commercial Chess Programs by Mike Valvo, rgc, July 19, 1991 » ChessMachine, MChess, Zarkov
KnightStalker Demo by Benjamin Lin, rgc, December 29, 1992
ChessBase for Windows and/or Fritz 3 Review by Johannes Fürnkranz, rgc, September 06, 1994 » ChessBase (Database)
Fritz 3 ELO on different computers by Moritz Berger, rgc, September 19, 1994

1995 ...

Fritz 3 Makes IM Norm by Michel Behna, rgc, January 31, 1995
Deep Thought /WCCC Round 5 vs Fritz by Robert Hyatt, rec.games.chess, May 31, 1995 » WCCC 1995
Fritz 4 and the SSDF by Moritz Berger, rgcc, June 27, 1996 » SSDF
LCT II results of Reb9, F5, and H6 on K6/233 by Albert Silver, CCC, January 03, 1998 » LCT II, Rebel, Hiarcs
Fritz 5 by Didzis Cirulis, CCC, February 06, 1998
Multi-Fritz with Boss versus IM R. Vasquez by Ingo Althöfer, CCC, March 09, 1999 ^[27]
Tactical monsters: Fritz5.32 and Goliath 2.05 by Jouni Uski, CCC, August 03, 1999

2000 ...

How make Fritz execute brute force search? by Leonid, CCC, July 26, 2000
Junior chess program. Just version of Fritz 5? by Leonid, CCC, July 29, 2000 » Junior
Re: Fritz protocol by Odd Gunnar Malin, Winboard Forum, April 14, 2002 » Wb2UCI
Re: Something new about Fritz? English by Sven Reichard, CCC, June 23, 2002
Re: Something new about Fritz? English, part 2 by Sven Reichard, CCC, June 24, 2002 » Eduard Nemeth
Request for link to Eduard Nemeth messages about Fritz 8.0.0.23 by Javier Ros Padilla, CCC, March 17, 2003 » Eduard Nemeth
Re: Shredder 8 secret: search depth? by Vasik Rajlich, CCC, March 23, 2004 » Depth, Shredder, Junior

2010 ...

Fritz 12 by Alexander Schmidt, CCC, May 31, 2011
Fritz and Naum shown as Rybka/Strelka clones by Kai Laskos, CCC, October 17, 2011
Deep Fritz 11 eval by BB+, OpenChess Forum, October 23, 2011
Are Fritz and Naum Rybka/Strelka clones? by SR, Rybka Forum, November 09, 2011
New Fritz author? by John Hartmann, CCC, November 19, 2013
Re: New Fritz author? by Albert Silver, CCC, November 20, 2013
Re: First Impressions (Deep Fritz 14)? by Albert Silver, CCC, November 22, 2013
Allegations that Deep Fritz 14.... by Dr.Wael Deeb, CCC, Engine Origins, December 03, 2013
Fritz 11 by Rebel, OpenChess Forum, December 10, 2013 ^[28]
ChessBase / Fritz interface running on Ubuntu? by Norbert Raimund Leisner, CCC, December 17, 2013 » Linux

2015 ...

Fritz 15 (Vas Rajlich?) by Graham Banks, CCC, July 24, 2015 » Vasik Rajlich
Fritz 15.0 by Tim Shackel, CCC, November 20, 2015
"Sampled search" ? by albitex, Rybka Forum, February 23, 2016
Fritz 16 by David Shanholtzer, CCC, November 12, 2017

External Links

Chess Engine

Purchase

ChessBase News

Fritz Defends to Draw Game 8 and the Match! Final Score: 4-4 The Brains in Bahrain Man-Machine match is over, from ChessBase News, October 19, 2002
Kasparov vs X3D Fritz match finishes 2-2 after game four draw from ChessBase News, November 19, 2003
Deep Fritz 8 review by Steve Lopez, ChessBase News, December 27, 2003
Mate search in Fritz by Steve Lopez, ChessBase News, August 07, 2004
Fritz 9 3D boards – part 1 by Steve Lopez, ChessBase News, January 10, 2006
Fritz 9 3D boards – part 2 by Steve Lopez, ChessBase News, January 17, 2006
Fritz 9 3D boards – part 3 by Steve Lopez, ChessBase News, January 25, 2006
Man vs machine shocker: Kramnik allows mate in one, Bonn, November 27, 2006
Kramnik vs Deep Fritz: Computer wins match by 4:2, ChessBase News, December 05, 2006
Deep Fritz 12 – an interview with the author, ChessBase News, February 17, 2010
Fritz 13 is now available – let's check who needs it!, ChessBase News, October 13, 2011
Deep Fritz 13 with blow-your-mind functions, ChessBase News, June 08, 2012
Deep Fritz 14: Faster, better, cheaper, ChessBase News, November 20, 2013
Deep Fritz 14 – Elo 3150 on your computer by Sean Marsh, ChessBase News, January 28, 2014
From Chess Challenger to Deep Fritz 14 by Ken Blake, ChessBase News, February 27, 2014 » Chess Challenger
Analyzing your games with Fritz (Part one) by Albert Silver, ChessBase News, June 02, 2014
Analyzing your games with Fritz (Part two) by Albert Silver, ChessBase News, June 04, 2014
Analyzing your games with Fritz (Part three) by Albert Silver, ChessBase News, June 07, 2014
Deep Fritz 14 now with ChessBase for Android by Albert Silver, ChessBase News, February 23, 2015 » Android
Using Deep Fritz 14 on a smartphone by A. Ganesan, ChessBase News, April 13, 2015 » Android
Come and get it – Fritz 15 released!, ChessBase News, November 25, 2015
Fritz 15 engine - questions and answers by Albert Silver, ChessBase News, January 04, 2016
Using your home chess engine anytime, anywhere by Albert Silver, ChessBase News, May 09, 2017
Fritz 16 – your companion and trainer, ChessBase News, November 12, 2017
Fritz 16 — a fun and instructive opponent by Albert Silver, ChessBase News, December 11, 2017

Rating Lists

Misc

References

^ New Fritz author? by John Hartmann, CCC, November 19, 2013
^ Fritz 15 - English Version, ChessBase Shop
^ Fritz 15 engine - questions and answers by Albert Silver, ChessBase News, January 04, 2016
^ Christmas dinner on a train – meet the ChessBase team from ChessBase News, December 23, 2003
^ Fabian Mäser (1995). Fritz vs. Deep Blue: Opening Book vs, Opening Book. Computer Chess Reports Vol. 5 No. 2 pp. 22, WCCC 1995
^ Shatin 1995, Chess, Round 6, Game 1
^ Former coal mine Unser Fritz 2/3 in Herne, North Rhine-Westphalia, Germany, now artist-studio, exhibition and event space, and part of The Industrial Heritage Trail of the Ruhr area - Image of protegohaube (flame arrester) as gnomon of a sundial and machine halls behind by Gerd Isenberg, bike tour, September 16, 2016. Unser Fritz/Crange is further district of Herne (Wanne), famous for its funfair Cranger Kirmes, and SV Unser Fritz the local chess club - eponym of the coal mine was Frederick III, German Emperor, see also Künstlerzeche Unser Fritz 2/3 - Chronik (German) and 2011 Image by Frank Vincentz
^ Der alte Fritz (1928) Wikipedia.de (German)
^ Fritz from Wikipedia
^ Olaf Oldigs - Google+
^ The ChessBase Christmas Party – part 1, ChessBase News, December 28, 2010
^ Shatin 1995, Chess, Round 5, Game 4
^ Chrilly Donninger (1994). Die Kunst des Nichtstuns. CSS 2/94, pdf (German)
^ Re: SOMA by Ed Schroder, CCC, August 26, 2009
^ Re: Search or Evaluation? by Mark Uniacke, Hiarcs Forum, October 14, 2007
^ Chrilly Donninger. (1993). Null Move and Deep Search: Selective-Search Heuristics for Obtuse Chess Programs. ICCA Journal, Vol. 16, No. 3, pp. 137-143
^ Fritz' ICGA Tournaments
^ Comp Fritz SSS chess games - 365Chess.com
^ Jaap van den Herik (2000). De toekomst van het schaaken. Schaakmagazine, 5/2000, pdf hosted by Hein Veldhuis
^ NED-ch 2000 - 365Chess.com Tournaments
^ Fritz SSS uses *SSS? by Bas Hamstra, CCC, May 15, 2000
^ Re: Fritz SSS uses *SSS? by Robert Hyatt, CCC, May 15, 2000
^ Chess Programs for Pocket PC and Palm devices by Dr. Axel Schumacher
^ Septober - Computerschach by Herbert Marquardt
^ Septober - Computerschach by Herbert Marquardt
^ Deep Fritz 14 from ChessBase
^ Rodrigo Vásquez Schroder - Wikipedia
^ Measuring similarity native ChessBase engines by Ed Schröder

What links here?

Page	Date Edited
3D Graphics Board	Sep 23, 2017
Aegon 1991	Mar 26, 2017
Aegon 1993	Mar 26, 2017
Aegon 1994	Mar 26, 2017
Aegon 1995	Apr 6, 2017
Aegon 1996	Jan 22, 2017
Aegon 1997	Apr 7, 2017
Albert Silver	Feb 25, 2018
Albrecht Heeffer	Sep 6, 2016
Alex Kure	Aug 27, 2016
Alexander Schmidt	May 17, 2016
Anaconda	Jul 4, 2015
Ananse	Jan 8, 2016
Android	Jan 9, 2018
AnMon	Nov 17, 2017
Aquarium	Dec 4, 2016
Arena	Mar 16, 2018
Atari ST	Dec 7, 2016
BikJump	Aug 11, 2014
Blondie25	Dec 7, 2017
Bobby	Jan 7, 2016
Bruce Moreland	Jan 20, 2016
Brute-Force	Jul 27, 2017
Brutus	Dec 24, 2016
Bryan Whitby	Jan 2, 2017
CCT Tournaments	Jan 29, 2017
CCT3	Feb 14, 2013
CCT4	Apr 22, 2013
Chess Tiger	Jan 7, 2016
ChessBase	Nov 25, 2017
ChessBase (Database)	Feb 26, 2018
Chessica	Nov 22, 2013
ChessMachine	Feb 26, 2018
ChessPartner	Nov 13, 2017
Cilkchess	Jan 21, 2016
Cock de Gorter	Nov 3, 2015
Connection Machine	Oct 12, 2016
CTG	Aug 22, 2016
Deep Blue	Aug 1, 2017
Deep Fritz versus Deep Junior 2007	Oct 15, 2016
Deep<9>	Nov 28, 2013
Depth	Feb 25, 2018
DGT Board	Feb 21, 2018
Didzis Cirulis	Dec 25, 2015
Diep	Jan 28, 2018
DOCCC 2001	Aug 15, 2015
Doctor?	Jun 7, 2016
Don Dailey	Dec 7, 2016
Eduard Nemeth	Nov 22, 2014
Eigenmann Endgame Test	Jun 1, 2017
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Entering Moves	Sep 7, 2017
Eric Schiller	Dec 5, 2016
Federico Andrés Corigliano	Feb 13, 2014
Fischerle	Aug 21, 2017
Frans Morsch	Jun 23, 2017
Fridolin	Jun 27, 2017
Fritz	Feb 26, 2018
Fruit	Sep 27, 2016
GK 2100	Jun 11, 2016
Gromit	Apr 5, 2017
GUI	Mar 16, 2018
Gyula Horváth	Jan 7, 2016
Hagrid	Apr 12, 2016
Harvard Cup 1992	Mar 26, 2017
Hiarcs	Feb 25, 2018
ICGA Journal	Dec 21, 2017
ICT 2001	Oct 14, 2015
ICT 2002	Nov 19, 2016
ICT 2003	Aug 18, 2016
Ingo Althöfer	May 4, 2017
International CSVN Tournament	Jan 8, 2018
IPCCC	Jan 20, 2017
IPCCC 2000	Dec 21, 2012
IPCCC 2001	Jan 9, 2014
IPCCC 2002	May 31, 2014
IPCCC 2003	Aug 17, 2016
IPCCC 2004	Dec 1, 2014
IsiChess	Jan 7, 2016
Iweta Rajlich	Sep 23, 2017
Javier Ros Padilla	Sep 2, 2015
Johannes Fürnkranz	Feb 26, 2018
Jonny	Nov 4, 2017
Junior	Feb 27, 2018
Kai Laskos	Jan 21, 2018
Kasparov versus X3D Fritz 2003	Aug 17, 2016
King of Kings	Sep 4, 2013
Knowledge	Jul 22, 2017
Komodo	Mar 6, 2018
Kramnik versus Deep Fritz 2002	Oct 16, 2017
Kramnik versus Deep Fritz 2006	Nov 28, 2017
LCT II	Feb 25, 2018
Leonid Liberman	May 23, 2015
List (Program)	Jan 7, 2016
Man vs Machine Team Championship	Aug 21, 2016
Mathias Feist	Aug 27, 2016
MChess	Feb 26, 2018
Michael Valvo	Feb 26, 2018
Moritz Berger	Feb 25, 2018
Nimzo	Dec 30, 2017
Norbert Raimund Leisner	Jul 28, 2016
Novag Citrine	Aug 19, 2015
Novag Universal Electronic Chess Board	Feb 24, 2017
Now	Jan 7, 2016
Null Move Pruning	Dec 2, 2017
Oracle	Sep 4, 2016
Patzer	Apr 5, 2017
Peter Mysliwietz	Mar 5, 2017
Phalanx	May 2, 2016
Piece-Square Tables	Mar 31, 2018
PT 45	May 19, 2014
Quest	Mar 26, 2017
Rebel	Feb 25, 2018
Robert Hyatt	Dec 25, 2017
Rybka	Mar 27, 2017
Saitek Brute Force	Oct 9, 2015
Saitek PC Auto Chessboard	Jun 11, 2016
Saitek President	Jun 11, 2016
Shredder	Jan 21, 2018
SOS	Apr 5, 2017
SSDF	Feb 25, 2018
Stefan Meyer-Kahlen	Jun 19, 2017
Steve Lopez	Dec 4, 2016
Sven Reichard	Dec 28, 2016
Syzygy Bases	Apr 19, 2018
TASC SmartBoard	Feb 25, 2018
TCEC Season 11	Apr 18, 2018
The King	Jan 21, 2018
Thompson's Databases	Dec 24, 2014
Tony Hedlund	Jun 19, 2017
UCI	Mar 4, 2018
USB Chess Board	Apr 21, 2015
Vasik Rajlich	Sep 23, 2017
Wb2UCI	Feb 1, 2018
WCCC 1992	Feb 26, 2018
WCCC 1995	Jul 12, 2017
WCCC 1999	Jul 13, 2017
WCCC 2002	Nov 24, 2017
WCCC 2003	Apr 2, 2017
WCCC 2004	Jan 28, 2018
WCCC 2005	Dec 27, 2016
Windows	Nov 2, 2017
WMCCC 1995	Jan 3, 2018
WMCCC 1996	Sep 15, 2016
WMCCC 1997	Apr 4, 2017
WMCCC 2000	Feb 27, 2018
World Computer Chess Championship	Mar 6, 2018
Yace	Dec 31, 2017
Zappa	Oct 24, 2017
Zappa versus Rybka 2007	Nov 25, 2017
Zarkov	Feb 26, 2018

Up one Level

Goliath

GerdIsenberg — Wed, 05 Apr 2017 19:58:31 GMT

Home * Engines * Goliath

		Goliath, a family of chess programs running under Windows, written by Michael Borgstädt, who in early 1996 found a possibility to include knowledge regarding planning and strategic thinking together with a reliable tactical searcher, first instantiated as Goliath's forerunner InterChess, which played the WMCCC 1996 in Jakarta ^[1] ^[2] ^[3]. Beside the knowledge based private program, announced to be available in March/April 1997 by Gambit-Soft ^[4], but never released ^[5] , the less knowledgeable but very fast Little Goliath (LG) was a formidable Blitz player. LG versions were distributed as WinBoard and later UCI compliant LG Gold, LG 2000, also commercially released as ChessBase native Young Talent Goliath Light 1.5 ^[6] ^[7] , and Goliath Blitz as native Chess Academy engine ^[8], as Goliath Mate, LG Nemesis, LG Revival, LG Evolution and Goliath Pro/XP.
David and Goliath ^[9]

Tournament Play

Goliath played the WMCCC 1997 in Paris, operated by Wolfgang Traudes, the WMCCC 2001 where it won the title of the World Microcomputer Speed-Chess Champion ^[10] , and the WCCC 2002, both in Maastricht operated by book author Erdogan Günes, further the ICT 2001, and the CCT1 and CCT4 on-line tournaments.

Photos & Games

Gandalf 1997

WMCCC 1997, round 3, Goliath - Gandalf ^[11]

[Event "WMCCC 1997"]
[Site "Paris, France"]
[Date "1997.10.27"]
[Round "3"]
[White "Goliath"]
[Black "Gandalf"]
[Result "1-0"]
 
1.Nf3 d5 2.g3 e6 3.d4 c5 4.Bg2 Nc6 5.O-O cxd4 6.Nxd4 Bc5 7.Nb3 Bb6 8.Nc3 Nf6 
9.Bg5 O-O 10.e4 dxe4 11.Nxe4 Qxd1 12.Rfxd1 Nxe4 13.Bxe4 f6 14.Be3 Bxe3 15.fxe3 
Ne5 16.Rab1 Rb8 17.h3 b6 18.Nd4 Bd7 19.Kf2 Rbd8 20.b3 f5 21.Bg2 Nf7 22.Ne2 e5 
23.Bd5 h5 24.Rd3 g6 25.Rbd1 Kg7 26.Bxf7 Rxf7 27.Rd6 g5 28.R6d5 Kf6 29.a4 g4 
30.h4 Re7 31.Rd6+ Kg7 32.R1d5 Kf7 33.Rd1 Kg7 34.c4 Rf7 35.R1d5 Re7 36.a5 bxa5 
37.c5 Kf7 38.c6 Bxc6 39.Rxd8 Bxd5 40.Rxd5 Kf6 41.Rxa5 Rb7 42.Ra6+ Kg7 43.Nc1 
Rc7 44.Nd3 Rc2+ 45.Kf1 Rc3 46.Rxa7+ Kf6 47.Ra6+ Kg7 48.Ke2 Rc2+ 49.Kf1 Rc3 
50.Ra7+ Kf6 51.Ke2 Rc2+ 52.Ke1 Rg2 53.Ra6+ Kg7 54.Nxe5 Rxg3 55.Kf2 Rh3 56.Ng6 
Rf3+ 57.Ke2 Rh3 58.b4 Rh2+ 59.Kd3 Rb2 60.Nf4 Rb3+ 61.Kd2 Rxb4 62.Nxh5+ Kh7 
63.Nf6+ Kg7 64.Nd5 Rb2+ 65.Kd3 Rh2 66.Ne7 Rf2 67.Nd5 Rh2 68.Ra7+ Kg6 69.Nf4+ 
Kf6 70.Ra6+ Kf7 71.h5 Rh1 72.Kd4 g3 73.Ke5 g2 74.Nxg2 Rxh5 75.Ra7+ Ke8 76.Nf4 
Rh6 77.Kxf5 Kd8 78.e4 Kc8 79.e5 Kb8 80.Rf7 Rh8 81.Ng6 Rh5+ 82.Kf6 Rh1 83.e6 
Rf1+ 84.Kg7 Re1 85.e7 Rxe7 86.Rxe7 1-0

Tao 2001

ICT 2001, Tao - Goliath X, Leen Ammeraal kibitzing, Bas Hamstra and Erdogan Günes ^[12] ^[13]

[Event "ICT 2001"]
[Site "Leiden NED"]
[Date "2001.05.18"]
[Round "02"]
[White "Tao"]
[Black "Goliath Chess X"]
[Result "1-0"]
 
1.e4 c5 2.d4 cxd4 3.c3 dxc3 4.Bc4 cxb2 5.Bxb2 Qb6 6.Qc2 Nf6 7.e5 Ne4 8.Nf3 Nc6 
9.O-O e6 10.Nc3 Nxc3 11.Bxc3 Qc5 12.Be2 d5 13.exd6 Bxd6 14.Rab1 a6 15.Nd2 Bf4 
16.Ne4 Qf8 17.Rfd1 f5 18.Bh5+ g6 19.Nf6+ Kf7 20.Nd7 Qe8 21.Bxh8 Qxh8 22.Bf3 Nd4 
23.Qc5 Nxf3+ 24.gxf3 b6 25.Rxb6 Be3 26.Ne5+ 1-0

Rebel 2001

WMCCC 2001, round 5 (Blitz), Goliath - Rebel ^[14]

[Event "WMCCC 2001 (Blitz)"]
[Site "Maastricht, The Netherlands"]
[Date "2001.08.21"]
[Round "5"]
[White "Goliath"]
[Black "Rebel"]
[Result "1-0"]
 
1.e4 d6 2.d4 Nf6 3.Nc3 g6 4.Nf3 Bg7 5.Be2 O-O 6.O-O c6 7.a4 Nbd7 8.h3 e5 
9.dxe5 dxe5 10.Be3 Qe7 11.Qd3 Nh5 12.a5 Nf4 13.Qc4 Qf6 14.Rfd1 Re8 15.b4 
Nf8 16.Bxf4 exf4 17.e5 Qe7 18.a6 bxa6 19.Qxf4 Nd7 20.Ne4 Nxe5 21.c3 Nxf3+ 
22.Bxf3 Bb7 23.Rd3 Rad8 24.Re3 Be5 25.Qh6 Qc7 26.Nc5 Bc8 27.Rae1 Bh2+ 
28.Kh1 Rxe3 29.Qxe3 Bd6 30.Rd1 Bf8 31.Rxd8 Qxd8 32.Nb3 Qf6 33.Nd4 c5 
34.bxc5 Qe7 35.Qxe7 Bxe7 36.c6 Kg7 37.g4 Bd8 38.Kg2 Ba5 39.Ne2 Bc7 40.Nd4 
Kf6 41.Kf1 Ba5 42.Ne2 Ke5 43.Ke1 f5 44.Kd2 Bb6 45.Nc1 Kf4 46.Ke2 Kg5 
47.Nb3 Kh4 48.gxf5 gxf5 49.Bg2 a5 50.Nd4 a4 51.Kd3 a5 52.Kc2 h6 53.Kb2 Bc5
54.c7 Bb6 55.Nb5 a3+ 56.Ka2 f4 57.Bf1 h5 58.Kb3 Bd7 59.Nd4 Kg5 60.h4+ Kh6 
61.Nb5 f3 62.Bd3 Bc8 63.Be4 Bxf2 64.Bxf3 Bc5 65.Nxa3 Bd6 66.Nb5 Bc5 67.Bc6 
Bb6 68.c4 Bc5 69.Ka4 Kg6 70.Be8+ Kh6 71.Kxa5 Be6 72.Nc3 Bf2 73.Kb5 Bxh4 
74.Kc6 Bg3 75.Bd7 Bxd7+ 76.Kxd7 Bxc7 77.Kxc7 Kg5 78.Kd6 h4 79.Ke5 h3 80.Ne4+ 
Kg4 81.Nf2+ Kg3 82.Nxh3 Kxh3 83.c5 Kg4 84.c6 Kf3 85.c7 Ke3 86.c8=Q 1-0

Forum Posts

1997 ...

Re: WMCCC by Michael Borgstädt, CCC, October 05, 1997 » WMCCC 1997
Re: WMCCC by Michael Borgstädt, CCC, October 05, 1997 » WMCCC 1997
Goliath vs. Eugen by Howard Exner, CCC, October 30, 1997 » WMCCC 1997
FREE ENGINE FOR WINBOARD (GOLIATH LIGHT) by Michael Borgstädt, CCC, August 25, 1998
Little Goliath / Download by Michael Borgstädt, CCC, September 01, 1998
Little Goliath Update available by Michael Borgstädt, CCC, September 07, 1998
Coming soon: Little Goliath Gold 2.0 FINAL RELEASE by CLiebert, CCC, April 29, 1999
Tactical monsters: Fritz5.32 and Goliath 2.05 by Jouni Uski, CCC, August 03, 1999
Little Goliath 2000 available ! by Frank Quisinsky, CCC, September 20, 1999
Page Update: Little Goliath 2000 A for Download by Đorđe Vidanović, CCC, September 30, 1999
Little Goliath 2000 V2.0 by CLiebert, CCC, November 28, 1999

2000 ...

Goliath Light in "Young Talents" CD? by Francesco Di Tolla, CCC, May 03, 2000
Goliath Light's speed is stunning!! by Jouni Uski, CCC, September 25, 2000
WMCC: Goliath Blitz-WCh?! by Eduard Nemeth, CCC, August 21, 2001
Goliath Light, Gromit, Patzer, SOS, etc. commercially sold by Theo van der Storm, CCC, August 28, 2001
Little Goliath UCI will come by CLiebert, CCC, January 21, 2002
Goliath Light 1.5 by Mike Hood, CCC, February 22, 2002
Little Goliath Nemesis by Jouni Uski, CCC, June 17, 2003
New mate solver "Goliath Mate Beta2" (UCI) available by Manfred Meiler, CCC, August 31, 2003
Goliath Blitz by Bob Riley, CCC, September 21, 2003
Playing Little Goliath Evolution by Fernando Villegas, CCC, May 14, 2005
Final review of Goliath Evolution. Warning: Complete and exhaustive by Fernando Villegas, CCC, May 14, 2005
CSS-Online-Masters: great news for "good-old-goliath" fans by CLiebert, CCC, Novemver 07, 2005
Little Goliath Evolution Standardgauntlet after 100 / 200 games played by Karl-Heinz Söntges, CCC, March 07, 2006

External Links

Misc

Goliath

References

^ Ratih Dewanti (1996). Report on the 14th World Microcomputer Chess Championship. ICCA Journal, Vol. 19, No. 4
^ Thorsten about Jakarta 2 by Dirk Frickenschmidt, rgcc, October 10, 1996
^ Re: WMCCC by Bruce Moreland, CCC, September 25, 1997
^ Re: WMCCC by Michael Borgstädt, CCC, October 05, 1997 » WMCCC 1997
^ Re: FREE ENGINE FOR WINBOARD (GOLIATH LIGHT) by Bert Seifriz, CCC, August 29, 1998
^ Young Talents from Support - ChessBase, May 28, 2000
^ Goliath Light, Gromit, Patzer, SOS, etc. commercially sold by Theo van der Storm, CCC, August 28, 2001
^ Chess Academy Goliath Blitz
^ David and Goliath, a colour lithograph by Osmar Schindler (c. 1888), Goliath from Wikipedia
^ 18th World Microcomputer Chess Championship (Blitz) - Maastricht 2001 (ICGA Tournaments)
^ Paris 1997 - Chess - Round 3 - Game 11 (ICGA Tournaments)
^ Leiden 2001 by László Szalai
^ Downloads | CSVN International Computerchess Tournament | Games
^ Maastricht 2001 - Chess (Blitz) - Round 5 - Game 3 (ICGA Tournaments

What links here?

Page	Date Edited
CCT1	Dec 30, 2012
CCT4	Apr 22, 2013
Chess Academy	Jan 15, 2014
ChessBase	Nov 25, 2017
David	Jul 20, 2016
Eduard Nemeth	Nov 22, 2014
Eigenmann Endgame Test	Jun 1, 2017
Engines	Mar 10, 2018
Erdogan Günes	Jul 7, 2017
Fernando Villegas	Aug 15, 2016
Gerold Fischer	Jan 24, 2016
Goliath	Apr 5, 2017
Heureka	Jan 8, 2016
ICT 2001	Oct 14, 2015
InterChess	Jan 8, 2016
Michael Borgstädt	Jan 24, 2016
Searcher	Sep 26, 2016
WCCC 2002	Nov 24, 2017
WMCCC 1997	Apr 4, 2017
WMCCC 2001	Jul 25, 2017
Wolfgang Traudes	Jan 8, 2016

Up one Level

Gromit

GerdIsenberg — Wed, 05 Apr 2017 19:55:11 GMT

Home * Engines * GromitChess

		GromitChess, an UCI compatible chess engine by Frank Schneider and Kai Skibbe. Gromit, later renamed to GromitChess, was initially written by Frank. In 1999 former tester Kai Skibbe joined the development. Gromit and GromitChess played several IPCCCs, the WMCCC 1995, WCCC 1999 in Paderborn and the WMCCC 2001 in Maastricht, where it won the title of the Amateur World Microcomputer Chess Champion. It was available as Young Talent by ChessBase running under the Fritz6 GUI ^[1]. GromitChess is the predecessor of the chess engine Anaconda ^[2].
Wallace & Gromit ^[3]

Description

given in 1999 from the ICGA tournament site ^[4]:

GromitChess is a C++-program, developed in a Linux-environment (Emacs, gcc). It searches about 25000 to 50000 nodes per second on a K6/200 and tries to be intelligent rather than fast. Attacktables are the primary datastructure (16 bit for every square and player; bit n is set if piece n attacks the square). The search uses iterative deepening, PVS, transposition tables, killer- and history heuristic, nullmove (R=2), about 10 chess-specific extensions and some pruning heuristics. The quiescence uses a static exchange evaluator and includes some checks and other threatening moves. Parts of the evaluation are initialized at the root but most of the work is done at the leafnodes. You can find more information and executables in the WWW.

Copy Make

Frank Schneider on Gromit's Copy-Make approach ^[5]:

I think it depends on your program and the board representation . Gromit uses copy+update and >1KB is copied every move (which is maybe too much). When I decided to do it that way (on an Amiga) I only considered clock cycles, but on a PC the low memory-bandwidth is the real problem. Since Gromit's evaluation and search heuristics use most of the processor time I never tried update+take back, because I guess it would give me less than 10% speedup, probably being slower than copy+update. There are some advantages of copy+update: - it is easy to program - it is easier to do some 'clever' things that would be difficult to take back - you can compare the current position with previous positions in the search tree An alternative would use a mix of copied and static data structures.

Forum Posts

Re: Unmake move v copy the board by Frank Schneider, CCC, January 24, 1999
Gromitchess bookcheating (for Vincent DIEPEVEEN) by Gian-Carlo Pascutto, CCC, August 23, 2001
Goliath Light, Gromit, Patzer, SOS, etc. commercially sold by Theo van der Storm, CCC, August 28, 2001
The Crazy Bishop 0046 and Gromit 3.8.2 by Federico Corigliano, CCC, August 31, 2001 » The Crazy Bishop

External Links

References

^ Support - ChessBase, May 28th, 2000
^ Anaconda Chess Home Page
^ Wallace & Gromit - The Official Site
^ GromitChess' ICGA Tournaments
^ Re: Unmake move v copy the board by Frank Schneider, CCC, January 24, 1999

What links here?

Page	Date Edited
Anaconda	Jul 4, 2015
ChessBase	Nov 25, 2017
Edwards' Tablebases	Sep 26, 2016
Engines	Mar 10, 2018
Frank Schneider	Jan 7, 2016
Gromit	Apr 5, 2017
IPCCC 1997	Aug 24, 2013
IPCCC 1999	Dec 21, 2012
IPCCC 2000	Dec 21, 2012
IPCCC 2001	Jan 9, 2014
IPCCC 2002	May 31, 2014
Kai Skibbe	Jan 7, 2016
PocketGrandmaster	Sep 17, 2015
Rabbit	Oct 5, 2014
The Crazy Bishop	Jan 7, 2016
WCCC 1999	Jul 13, 2017
WMCCC 1995	Jan 3, 2018
WMCCC 2001	Jul 25, 2017

Up one level

Hiarcs

GerdIsenberg — Sun, 25 Feb 2018 17:01:29 GMT

Home * Engines * Hiarcs

		Hiarcs (HIARCS), a chess engine written by Mark Uniacke. HIARCS is an acronym for Higher Intelligence Auto Response Chess System, and its history of development lasts over 30 years now. Because Hiarcs is written portable in C, it is available for multiple platforms such as Pocket PC, Palm, Apple iPhone & iPod Touch, PDAs, PC and Macintosh computers. Hiarcs opening book authors over the time were Eric Hallsworth, Sebastian Böhme and Harvey Williamson, who is also operating Hiarcs regular at various computer chess tournaments. Hiarcs won the Gold medal at the 4th Computer Olympiad 1992 in London, the WMCCC 1993 in Munich, the IPCCC 2007, after the Rybka disqualification in 2011, the WCCC 2008 in Beijing, the ICT 2009, the WCSC 2011 in Tilburg, the WCSC 2013 in Yokohama ^[1], and the PT 51.
Macintosh Sigma Chess 6.2 HIARCS 13 ^[2] ^[3]

History

Hiarcs 1 for MS-DOS, 1991 ^[4] , download from the Hiarcs site ^[5]

Basic

The very first version of Hiarcs was already written 1980 in PDP-11 Basic, when Mark was a 15 year old schoolboy ^[6] . Subsequent versions (5 aka 0.5) were still written in interpreted Basic as well, and to compensate that speed disadvantage, Hiarcs used to be smart rather than fast. Mark Uniacke from Now Walking, 1982-1983: HIARCS 5 ^[7] :

The inspiration for the new HIARCS search was sought from the book Chess Skill in Man and Machine and in particular the article "The heuristic search: An alternative to the alpha-beta minimax procedure" by Larry Harris from Dartmouth College ^[8] . HIARCS was still written in the relatively primitive BASIC programming language and being interpreted it meant the program was rather slow. To compensate for this I developed some heuristics to help guide the search and evaluation in a more targeted way.

C

End of the 80s Hiarcs was rewritten in C. In 1991 Hiarcs 1.0 was released for PCs and the MS-DOS operatig system. Subsequent Hiacs versions were compiled to run under various processors and operating systems, such as x86 and PowerPC under Windows and Mac OS, as well as mobile devices.

Achievements

The rewritten Hiarcs soon competed in computer chess tournaments, in 1989 the 1st Computer Olympiad, and the WMCCC 1991 in Vancouver where Hiarcs won the title of the World Amateur Microcomputer Chess Champion. Hiarcs won the gold medal (shared) at the 4th Computer Olympiad, and became World Microcomputer Chess Software Champion at the WMCCC 1993 in Munich. Hiarcs won several other tournaments or got top rankings, it won the IPCCC 2007, after Rybka's disqualification in June 2011 the WCCC 2008, and the ICT 2009 ^[9]. Further, Hiarcs is two time World Chess Software Champion, succeeding at the WCSC 2011 in Tilburg, and the WCSC 2013 in Yokohama.

Man-Machine

Descriptions

from the ICGA tournament site ^[10] :

1999

HIARCS is written entirely in 'C' on a very spare time basis.

HIARCS searches around an order of magnitude less positions per second (av. 18,000) than most of its competitors. However, it makes up for this apparent slow speed by clever searching and accurate evaluation. HIARCS uses many selective search extension heuristics to guide the search and incorporates a sophisticated tapered search to resolve tactical uncertainties while finding positionally beneficial lines.

HIARCS won the title of World Microcomputer Chess Software Champion in 1993 in Munich, Germany and has won numerous other computer and human tournaments. HIARCS 7.0 is currently the top rated chess program on the SSDF and Selective Search rating lists.

In April 1997, HIARCS 6.0 became the first PC chess program to win a match played at tournament time controls over a FIDE International Master. This great achievement was further built on when HIARCS won the Godesberg Open ahead of Grandmasters and International Masters.

The version competing in this tournament is a new experimental version. The program will be a 32bit Windows version of Hiarcs and will support tablebases. It is expected that all 4 piece and most 5 piece endgame tablebases will be available.

2008

HIARCS is one of the few original PC chess programs still competing in top level chess competition. It has been in development over the last twenty years and since 1991 has always been among the top chess programs in the world. In this time it has led world computer rating lists and won World Championship titles. It was the first PC chess program to defeat a FIDE International Master in a match and has been a favourite of a number of World Chess Champions. So much so that Garry Kasparov said towards the end of his match with Deep Blue2 that "HIARCS is much better positionally than Deep Blue". HIARCS is available on a number of platforms including PC, Macintosh and handheld devices. The handheld Palm version has won multiple matches against GMs and even won a GM/IM tournament in the Philippines. HIARCS' playing style is now very aggressive with a distinctive liking for attacking the opponent's king. This often leads to dynamic exciting games which are often played on a knife-edge. HIARCS is now capable of taking advantage of multi-processors/cores to improve its chess performance making it a very dangerous opponent.

Commerce

Hiarcs is commercially available since 1991. PC- and Windows versions until 12.0 were market as ChessBase engine in conjunction with the Fritz GUI ^[11] , PC Chess Hiarcs 13 UCI is purchased as download product from its own site ^[12] , and requires a Windows PC and an external GUI supporting the UCI protocol. Hiarcs 12.1 and 13 are the chess engines of Pocket Fritz by ChessBase ^[13] ^[14] .

Chess Explorer

Since August 2012, Hiarcs has its own GUI. The Hiarcs Chess Explorer is bundled with Hiarcs 14, based on the program which won the WCSC 2011, and can further be used with any UCI compatible chess engine ^[15] .

Release Dates

Hiarcs 1 : 1992
Hiarcs 2 : 1993
Hiarcs 2.1 : 1993
Hiarcs 3 : 1994
Hiarcs 4 : 1995
Hiarcs 5 : 1996
Hiarcs 6 : 1997
Hiarcs 7 : 1998
Hiarcs 7.32 : 1999
Hiarcs 8 : 2002
Hiarcs 9: 2003
Hiarcs 9.6 : 2004
Hiarcs 10 : 2005
Hiarcs X50 :
Hiarcs X54 :
Hiarcs 11 : 2006
Hiarcs 11.1 : 2007
Hiarcs 11.2 : 2007
Hiarcs Paderborn 2007-12
Hiarcs 12.1 : 2008
Hiarcs 13 : 2009
Hiarcs 13.1 : 2010
Hiarcs 13.2 : 2010
Hiarcs 14 : 2011

HIARCS Chess Strength ^[16]

Publictions

Eric Hallsworth (1992). HIARCS for PC's. Selective Search 43, pp. 2, pdf hosted by Mike Watters
Jan van Reek, Jos Uiterwijk (2003). The Match Bareev vs. Hiarcs X. ICGA Journal, Vol. 26, No. 1 » Bareev versus Hiarcs 2003
Eric Hallsworth (2003). HIARCS 8X v Evgeny Bareev. Selective Search 104, pp. 20, pdf hosted by Mike Watters
Eric Hallsworth (2003). HIARCS 8X v Evgeny Bareev - The Final Game. Selective Search 105, pp. 11, pdf hosted by Mike Watters
Thorsten Czub (2003). Mark Uniacke interviewed - Programming HIARCS 9. Selective Search 108, pp. 12, pdf hosted by Mike Watters

Forum Posts

1993 ...

Challenger to MCh/CG by Mark Uniacke, rec.games.chess, August 25, 1993
QMW computer chess by Don Beal, rec.games.chess, August 19, 1993 » UPCCC 1993
HIARCS 2.0 Chess Program by Bryant Fujimoto, rec.games.chess, December 5, 1993

1995 ...

Announcing HIARCS 4.0 for PC and MAC by Mark Uniacke, rgcc, December 19, 1995
Hiarchs Mac: First Impressions by Eric Schiller, rgcc, January 27, 1996
HIARCS 5 Maximum Search Depth by Kevin Miller, rgcc, January 7, 1997
AEGON 97/ 1st round: HIARCS lost by Enrico, rgcc, April 16, 1997
[REVIEW] HIARCS 6.0 Macintosh (long) by Richard A. Fowell, rgcc, December 12, 1997
LCT II results of Reb9, F5, and H6 on K6/233 by Albert Silver, CCC, January 03, 1998 » LCT II, Rebel, Fritz
Horrible move! by Tony Hedlund, CCC, May 07, 1998 » Fifty-move Rule

2000 ...

HIARCS 11.1 SP / MP Macintosh has arrived! by rafowell, CCC, Apr 03, 2007 » Macintosh
Re: Search or Evaluation? by Mark Uniacke, Hiarcs Forum, October 14, 2007
World Computer Chess Championship 2008 Hiarcs wins! by Harvey Williamson, Hiarcs Forum, September 06, 2008 » WCCC 2008
World Computer Chess Championship 2008 Hiarcs wins! by Harvey Williamson, Hiarcs Forum, December 16, 2011

2010 ...

World Computer Software Championship 2011 - Hiarcs wins!! by Harvey Williamson, Hiarcs Forum, November 26, 2011 » WCSC 2011
Hiarcs World Computer Software Champion 2013! by Harvey Williamson, Hiarcs Forum, June 04, 2013 » WCSC 2013
The Future of Hiarcs by Fernando Villegas, Hiarcs Forum, July 05, 2016 » WCCC 2016, WCSC 2016

External Links

HIARCS Chess Software for PC, Mac, Pocket PC, iPhone, iPod and Palm Chess
Hiarcs' ICGA Tournaments
HIARCS from Wikipedia
Hiarcs Fan Page by Thorsten Czub
Hiarcs 9 by Thorsten Czub
HIARCS 13 – the Professional Openings Book by Mark Uniacke, ChessBase New, March 10, 2011 » Opening Book
Hiarcs King March – Brilliancy Prize? | Denton Chess Club Blog by Ivan Urwin, October 14, 2013 » TCEC Season 5
Hiarcs Forum

References

^ Hiarcs' ICGA Tournaments
^ Macintosh Chess: Sigma Chess HIARCS Chess Software Program
^ Sigma Chess & HIARCS
^ Hiarcs Fan Page by Thorsten Czub
^ Free HIARCS Chess Software Programs
^ HIARCS: Where It All Began
^ Now Walking, 1982-1983: HIARCS 5
^ Larry R. Harris (1974). Heuristic Search under Conditions of Error. Artificial Intelligence, Vol. 5, No. 3, pp. 217-234. ISSN 0004-3702. Also published (1977) under the title: The heuristic search: An alternative to the alpha-beta minimax procedure. Chess Skill in Man and Machine (ed. Peter W. Frey), pp. 157-166. Springer-Verlag, New York, N.Y. ISBN 0-387-07957-2
^ HIARCS Milestone Achievements
^ Hiarcs' ICGA Tournaments
^ ChessBase Shop - Hiarcs 12 from ChessBase
^ HIARCS for PC Chess Software
^ HIARCS Chess Software: What's New
^ HIARCS from Wikipedia
^ HIARCS Chess Explorer - World class chess database and chess playing program
^ HIARCS Chess Strength - from the official Hiarcs site

What links here?

Page	Date Edited
1st Computer Olympiad	Jul 25, 2017
2nd Computer Olympiad	Jul 12, 2017
4th Computer Olympiad	Jul 15, 2017
ABK	Feb 1, 2017
Aegon 1993	Mar 26, 2017
Aegon 1994	Mar 26, 2017
Aegon 1995	Apr 6, 2017
Aegon 1996	Jan 22, 2017
Aegon 1997	Apr 7, 2017
Aegon Tournaments	Jan 22, 2017
Albert Silver	Feb 25, 2018
Bareev versus Hiarcs 2003	Aug 18, 2016
Basic	Jan 3, 2018
Bryan Whitby	Jan 2, 2017
CCT Tournaments	Jan 29, 2017
CCT10	May 5, 2013
CCT12	Jan 28, 2018
CCT3	Feb 14, 2013
CCT4	Apr 22, 2013
CCT6	May 29, 2014
CCT8	Apr 6, 2013
CCT9	Aug 25, 2013
ChessBase	Nov 25, 2017
Cilkchess	Jan 21, 2016
Cluster Toga	Jan 7, 2016
Computer Chess Forums	Nov 26, 2017
Computer Olympiad	Mar 6, 2018
Contempt Factor	Mar 10, 2018
CSVN Programmers Tournament	Apr 25, 2018
CTG	Aug 22, 2016
Didzis Cirulis	Dec 25, 2015
DOCCC 2006	Aug 27, 2016
DOCCC 2007	Aug 15, 2015
DOCCC 2008	Aug 15, 2015
DOCCC 2010	Aug 15, 2015
Don Dailey	Dec 7, 2016
E6P	Dec 17, 2016
Eigenmann Endgame Test	Jun 1, 2017
Engines	Mar 10, 2018
Erdogan Günes	Jul 7, 2017
Eric Hallsworth	Jan 7, 2016
Eric Schiller	Dec 5, 2016
Fifty-move Rule	Aug 9, 2017
Fritz	Feb 26, 2018
Fritz Reul	Nov 28, 2016
Fruit	Sep 27, 2016
Genesis NL	Dec 12, 2016
GridProtector	Jul 13, 2016
Gyula Horváth	Jan 7, 2016
Hans van der Zijden	Dec 13, 2016
Harun Taner	May 17, 2015
Harvard Cup 1994	Apr 21, 2014
Harvey Williamson	Jan 7, 2016
Hiarcs	Feb 25, 2018
Hiarcs Chess Explorer	Sep 10, 2014
ICT 2007	Sep 14, 2015
ICT 2008	Sep 14, 2015
ICT 2009	Sep 14, 2015
ICT 2010	Sep 14, 2015
International CSVN Tournament	Jan 8, 2018
IPCCC	Jan 20, 2017
IPCCC 2007	May 30, 2016
Ivan Urwin	Feb 8, 2014
Jonny	Nov 4, 2017
Junior	Feb 27, 2018
Karsten Bauermeister	Sep 6, 2015
Kasparov versus Deep Junior 2003	Mar 18, 2017
King of Kings	Sep 4, 2013
Knowledge	Jul 22, 2017
Ktulu	May 16, 2015
LCT II	Feb 25, 2018
Mac OS	Mar 25, 2016
Macintosh	Dec 7, 2016
Mark Uniacke	Dec 12, 2016
Mephisto	Dec 18, 2017
Mephisto Wundermaschine	Sep 2, 2017
Mikko Aarnos	Mar 14, 2015
Mirage	Jul 12, 2016
Monsoon	Feb 8, 2015
Nimzo	Dec 30, 2017
Novag Citrine	Aug 19, 2015
Opening Book	Feb 26, 2018
Pandix	Feb 4, 2017
PowerPC	Oct 6, 2017
Protector	Oct 12, 2017
PT 49	Oct 22, 2015
PT 50	May 3, 2017
PT 51	Oct 5, 2017
Raptor LU	Oct 5, 2016
Rebel	Feb 25, 2018
Revelation	Jul 15, 2016
Revelation II	Jan 8, 2018
Rybka Controversy	Jan 18, 2018
Sebastian Böhme	Jan 7, 2016
Selective Search	Oct 24, 2016
Shannon Trophy	Jul 7, 2017
Shredder	Jan 21, 2018
Spark	Oct 19, 2017
Steve Blincoe	Mar 31, 2013
TASC SmartBoard	Feb 25, 2018
TCEC Season 5	Jun 2, 2014
TCEC Season 6	Dec 2, 2014
Thorsten Czub	Aug 18, 2016
Timo Haupt	Jan 8, 2016
Uniform-Platform Computer Chess Championship	Mar 25, 2011
UPCCC 1993	Mar 6, 2015
UPCCC 1994	Mar 9, 2012
Vladimir Rybinkin	Jan 8, 2016
Volker Annuss	Aug 3, 2017
WCCC 1992	Feb 26, 2018
WCCC 1999	Jul 13, 2017
WCCC 2008	Jan 3, 2017
WCCC 2009	Apr 2, 2017
WCCC 2011	Jan 7, 2017
WCCC 2013	Dec 7, 2016
WCCC 2015	Jun 13, 2017
WCCC 2016	Sep 18, 2017
WChess	Jan 7, 2016
WCRCC 2007	Nov 21, 2016
WCRCC 2008	Nov 21, 2016
WCRCC 2009	Jul 14, 2014
WCSC 2011	Jan 7, 2017
WCSC 2013	Aug 17, 2016
WCSC 2015	Jun 13, 2017
WCSC 2016	Sep 18, 2017
Who's Who	Sep 6, 2017
WMCCC 1991	Sep 18, 2016
WMCCC 1993	Dec 30, 2017
WMCCC 1995	Jan 3, 2018
World Chess Software Championship	Mar 6, 2018
World Computer Chess Championship	Mar 6, 2018
World Microcomputer Chess Championship	Jan 7, 2016

Up one level

Houdini

GerdIsenberg — Sat, 14 Apr 2018 20:08:20 GMT

Home * Engines * Houdini

		Houdini, a chess engine by Robert Houdart, which appeared in 2010 as closed source engine, free for non-commercial use. In January 2011, Houdini 1.5 was leading Ingo Bauer's IPON rating list ^[1] . Houdini 2, released in September 2011, is commercial and bundled with a number of ChessOK products, such as Aquarium, Chess Assistant ^[2], and since December 2011, Chess King ^[3]. Houdini 1.5a remains available as a free download ^[4]. Houdini 3, released in October 2012, has further improved by more than 50 Elo points ^[5] . According to its author, Houdini 3 applies a accelerated principal variation search, also dubbed "Smart" Fail-High. If a different move becomes best at very high search depths at the root, re-searches to determine its exact score and the new principal variation are done faster due to a reduced search depth, presumably in conjunction with extensions along the PV ^[6] . Since November 2012, Houdini 3 is available as ChessBase engine ^[7] . Houdini 4, released in November 2013, was about 50 Elo stronger than its predecessor, and features 6-men Syzygy bases.
The Grim Game ^[8]

Houdini 5

Released about three years after the previous version, in November 2016, Houdini 5 is vastly improved being about 200 Elo stronger than Houdini 4. It has a completely rewritten evaluation with more aggressive king safety and sophisticated piece mobility, features a more selective search, exploring critical variations significantly deeper, and for hardware with multiple processors, Lazy SMP. Houdini 5 Pro supports up to 128 threads, up to 128 GiB of hash memory, large memory pages, NUMA-architecture, and Nalimov tablebases to find the shortest path to mate.

A development version of Houdini 5 qualified for TCEC Season 9 Superfinal, and even won the TCEC Season 9 Rapid tournament. The final release version of Houdini 5 is about 30 Elo stronger than the engine that played in the TCEC tournament so far. But that was apparently not enough for Stockfish 8 in long time control matches - Houdini 5 lost the 100 game Superfinal with 45½ - 54½.

Houdini 6

Released in September 2017, Houdini 6 again improved in search and evaluation to add another 50-60 Elo in strength, which roughly corresponds to doubling the computational power of the computer ^[9]. Houdini 6.03 won the TCEC Season 10 Superfinal versus Komodo 1970.00, a successor of Komodo 11, with 53 - 47 (+15=76-9) ^[10] ^[11].

Houdini's Origin

Robert Houdart claims his engine is original ^[12] , and admits taking ideas from the open source programs Ippolit/Robbolito, Stockfish and Crafty ^[13] . Other programmers and forum members raised suspicions that Robert took ideas from the controversial Ippolit/Robbolito source code too literally as initial base of his program ^[14] ^[15] ^[16] ^[17] .

Sources of Inspiration

Robert Houdart on the origins of Houdini in CCC, June 08, 2010 ^[18]

From the start I have very clearly acknowledged the different sources of inspiration for Houdini (Ippo/Robbo, Stockfish and Crafty) and have shown every respect for the hard work of others, be it on my web site, in the readme file, or in this forum...

Houdini and the Ippo family have lots of high-level similarities, but zillions of low-level subtle differences.

Claims have been made that I "just changed a couple of resource strings", "made a cheap compile" or "grabbed some free code", but, in truth, none of you have any clue about the effort that was invested in Houdini.

It is funny that I would not be called a "real" chess engine author, when I am both a professional software developer and a reasonably strong chess player (peak 2280 rating), who has been writing chess engines for over 25 years now in a variety of programming languages.

It is sad that on the one hand you request that everybody demonstrates respect for the hard work of others, but on the other hand you seem to be unable to extend the same courtesy (or even the benefit of the doubt) to Houdini.

Material Table

The idea to index the material table in the same manner as Robbolito, with combined counters of queens, rooks, light and dark bishops, knights and pawns, and to calculate piece counters from that table-index by a sequence of mod/div operations by {2,2,3,3,2,2,2,2,3,3,9,9} might be considered obvious after studying the mentioned source code, and if applying that scheme, there is hardly anything to avoid a sequence of almost identical x86 machine code with same constants for reciprocal multiplication ^[19] .

Strelka 5

Robert Houdart on Strelka 5, December 04, 2011 ^[20]

Strelka 5 is Houdini 1.5 RE, not Houdini 2. I share your fears, any #1 engine will be RE'd in a matter of months. For Houdini 1.5 it's taken about 6 months.

Reply by Richard Vida ^[21]

You mean 6 months until Strelka has been released to public. You do not know how much time did Yuri Osipov spent on RE, neither when he did start his RE project. For me it took barely one week. As Milos S. pointed out ^[22] , you made RE very very easy because of starting your project from Robbolito codebase... Personally I see no problem with that (other than you not telling the truth).

Release Dates

Houdini 1.0 : May 15, 2010
Houdini 1.5 : December 15, 2010
Houdini 2.0 : September 01, 2011
Houdini 3 : October 15, 2012
Houdini 4 : November 25, 2013
Houdini 5: November 09, 2016
Houdini 6: September 17, 2017

Publications

Harry Houdini

Harry Houdini, et al. (1906, 2012). The Right Way to Do Wrong: An Exposé of Successful Criminals. CreateSpace, amazon.com
Harry Houdini (2007). The Right Way to Do Wrong. Librivox audio recording from the Internet Archive
Harry Houdini, Harry Houdini Collection (1908). The unmasking of Robert-Houdin. New York : Publishers Printing Co. ^[23]
Walter Brown Gibson, Morris N. Young (1953). Houdini on Magic. Dover Publications

Chess Engine

Diogo R. Ferreira (2012). Determining the Strength of Chess Players based on actual Play. ICGA Journal, Vol. 35, No. 1
Arno Nickel (2012). Die schöne neue Welt der Schachengines. SCHACH 2,3,5,6 2012, pdf (German) ^[24]
Matej Guid, Ivan Bratko (2012). Detecting Fortresses in Chess. Elektrotehniški vestnik, Vol. 79, Nos. 1-2, pdf » Rybka, Houdini
Diogo R. Ferreira (2013). The Impact of the Search Depth on Chess Playing Strength. ICGA Journal, Vol. 36, No. 2

Forum Posts

2010 ...

Re: Costeff Study 1979 by Robert Houdart, CCC, May 16, 2010
Houdini - a cheap compile of Ippo/Robo by Lance Perkins, CCC - Computer Chess Club: Engine Origins, May 29, 2010 (requires login)
Re: question on draw evaluation by Robert Houdart, CCC, June 07, 2010 » Draw Evaluation
Houdini 1.03 is available by Robert Houdart, CCC, July 15, 2010
Re: Mate in 17 revisited by Robert Houdart, CCC, July 16, 2010 » Zugzwang
Houdini 1.03a bug-fix is available by Robert Houdart, CCC, July 17, 2010
Houdini 1.03a tests by Harun Taner, CCC, July 18, 2010
Why Is Houdini Not Entered In The WCCC?? by Sean Evans, Open Chess Forum, August 03, 2010
Re: Plain and fancy magic on modern hardware by Robert Houdart, CCC, August 26, 2010 » Magic Bitboards
Gaviota EGTB in Houdini 1.5 + contacting Eugene Nalimov by Robert Houdart, CCC, December 01, 2010
Houdini 1.5 is released by Robert Houdart, CCC, December 15, 2010
Houdini 1.5 with Large Page support and 8-cores for w32 by Robert Houdart, CCC, December 19, 2010
Houdini 1.5: one mystery/question by Jouni Uski, CCC, December 21, 2010
Houdini and Chessbase GUI engine matches by Robert Houdart, CCC, December 27, 2010

2011

Houdini Engine Origins by Jeremy Bernstein, OpenChess Forum, January 18, 2011
a Telltale position by Larry Kaufman, CCC, 12 February, 2011
Re: Why are the Ippo derivative stronger than Stockfish? by Richard Vida, CCC, 25 February, 2011
Re: Hash usage percent display (in Arena) by Robert Houdart, CCC, March 24, 2011
Re: Houdini, Fire, IvanHoe, (and Rybka?) are 'clones'...? by Jury Osipov, CCC, May 12, 2011
Some news about Houdini 2.0 by Robert Houdart, CCC, July 22, 2011
Houdini 2 is released by Robert Houdart, CCC, September 02, 2011
Houdini 2 Aquarium released by Robert Houdart, CCC, October 09, 2011
Computer Chess Biggest Liar by kingliveson, OpenChess Forum, October 09, 2011
how far is too far: houdini for sell? by Joseph, CCC, October 11, 2011
Houdini with 1:1 Robbolito-code? by Dr. Alexander Schmidt, CCC, October 12, 2011
Re: Houdini with 1:1 Robbolito-code? by Norman Schmidt, CCC, October 12, 2011
Strelka 5 by Yuriy Osipov by Slavik Pavloff, CCC, October 15, 2011 » Strelka
New:Houdini 2 Chess Benchmarks are Acceptable! by Sedat Canbaz, CCC, November 26, 2011
Re: Any plans for Houdini 3? by Robert Houdart, CCC, December 03, 2011
Re: Komodo 4 on long time control by Richard Vida, CCC, December 04, 2011 » Komodo, Strelka
Houdini 2.0c - Mate in 1 bug by Árpád Rusz, CCC, December 08, 2011

2012

Re: Interesting poll by Rebel, Rybka Forum, July 15, 2012
Houdini 3 reducing the depth feature by Maurizio Maglio, CCC, October 17, 2012
Houdini 3 does not behave the same in 64-bit and 32-bit by Ernest Bonnem, CCC, October 23, 2012
houdini3 search and mate scores by Uri Blass, CCC, October 29, 2012 » Mate Scores
Houdini 3 update does behave the same in 64-bit and 32-bit by Ernest Bonnem, CCC, November 01, 2012
What is stronger than Houdini 3 for what? by S.Taylor, CCC, November 11, 2012
Houdini 3 tests (8cpu) by Harun Taner, CCC, November 12, 2012
The scaling of Houdini 3 and Komodo 5 by Kai Laskos, CCC, November 16, 2012 » Komodo
Houdini 3-Houdini 3: Nutzen der Bedenkzeitverlängerung by Patrick Götz, CSS-Forum, December 07, 2012 (German) » Diminishing Returns
Houdini 3 the same in 64-bit and 32-bit: well, not quite? by Ernest Bonnem, CCC, November 28, 2012

2013

10 Lessons to be Learned from todays Top Engines by Josef, Rybka Forum, January 03, 2013 » Komodo, Stockfish
eval scale in Houdini by Rein Halbersma, CCC, January 14, 2013 » Evaluation
Scaling at 2x nodes (or doubling time control) by Kai Laskos, CCC, July 23, 2013 » Doubling TC, Diminishing Returns, Playing Strength, Houdini
Houdini 4 has been released by Robert Houdart, CCC, November 25, 2013
Houdini, much weaker engines, and Arpad Elo by Kai Laskos, CCC, November 29, 2013 » Match Statistics, Pawn Advantage, Win Percentage, and ELO ^[25]
IPON results for Houdini 4 by Robert Houdart, CCC, December 02, 2013 » IPON
Be careful where you buy Houdini 4, or you could get burned by Tom Likens, CCC, December 05, 2013

2014

Houdini 3/4? by Jason Coombs, CCC, January 30, 2014
Threads factor: Komodo, Houdini, Stockfish and Zappa by Andreas Strangmüller, CCC, May 17, 2014 » Thread, Komodo, Houdini, Stockfish, Zappa

2015 ...

Empirical results with Lazy SMP, YBWC, DTS by Kai Laskos, CCC, April 16, 2015 » Lazy SMP, YBWC, DTS

2016

Houdini 5 in TCEC by John Wentworth, CCC, April 13, 2016 » TCEC Season 9 ^[26]
Houdini 5 dev in TCEC by Jouni Uski, CCC, September 08, 2016 » TCEC Season 9
New Houdini by Dann Corbit, CCC, October 05, 2016
Houdini 5 has been released by Robert Houdart, CCC, November 09, 2016
chessbase houdini is out but... by Stavros Atmatzidis, CCC, December 03, 2016

2017

Houdini 6 has been released by Robert Houdart, CCC, September 18, 2017
Scaling from FGRL results with top 3 engines by Kai Laskos, CCC, September 26, 2017 » FGRL, Komodo, Stockfish

2018

Houdini 6 - Initial position until depth 50 by Andreas Strangmüller, CCC, April 13, 2018 » Initial Position

External Links

Chess Engine

Harry Houdini

References

^ IPON-Rating-List Archive 2009/2010/2011 by Ingo Bauer
^ Houdini 2 Aquarium products family has been released!, ChessOK, October 07, 2011
^ Chess King Released, ChessOK, December 14, 2011
^ Re: Houdini 2 is released by Robert Houdart, CCC, September 02, 2011
^ IPON-Rating-List, 2012.10.17 by Ingo Bauer
^ Re: Houdini 3 reducing the depth feature by Robert Houdart, CCC, October 19, 2012
^ Houdini 3 Standard multiprocessor version, ChessBase Shop
^ The Grim Game a 1919 silent film starring Harry Houdini
^ Houdini Chess Engine
^ Houdini is TCEC Season 10 champion!, Chessdom, December 07, 2017
^ Interview with Robert Houdart, author of the champion engine Houdini, Chessdom, December 08, 2017
^ Re: Why Is Houdini Not Entered In The WCCC?? by Robert Houdart, Open Chess Forum, August 04, 2010
^ Houdini Chess Engine - Acknowledgements
^ Re: Why Is Houdini Not Entered In The WCCC?? by kingliveson, Open Chess Forum, August 09, 2010
^ Re: Why Is Houdini Not Entered In The WCCC?? by Robert Houdart, Open Chess Forum, August 10, 2010
^ Re: Computer Chess Biggest Liar by kingliveson, OpenChess Forum, October 11, 2011
^ Re: Interesting poll by Rebel, Rybka Forum, July 15, 2012
^ Re: Purpose of Chess Engine Origins forum is...? by Robert Houdart, CCC (Computer Chess Club: Engine Origins, requires registration), June 08, 2010 in a reply to Jeremy Bernstein
^ Houdini - a cheap compile of Ippo/Robo by Lance Perkins, CCC - Computer Chess Club: Engine Origins, May 29, 2010 (requires login)
^ Re: Komodo 4 on long time control by Robert Houdart, CCC, December 04, 2011
^ Re: Komodo 4 on long time control by Richard Vida, CCC, December 04, 2011
^ Re: Lazy eval - test results by Milos Stanisavljevic, CCC, December 01, 2011
^ Jean Eugène Robert-Houdin - Wikipedia
^ Part 1 covers Houdini, Rybka, Komodo, Stockfish, Critter, Naum, Chiron and Spike
^ Arpad Elo - Wikipedia
^ Houdini 5 to participate in TCEC Season 9, Chessdom, April 13, 2016

What links here?

Page	Date Edited
Albert Silver	Feb 25, 2018
Alexander Schmidt	May 17, 2016
Andreas Strangmüller	May 15, 2017
Aquarium	Dec 4, 2016
Arno Nickel	Sep 25, 2015
Branching Factor	Jun 28, 2017
Chess	Jan 21, 2018
Chess Assistant	Jul 16, 2017
Chess King	Dec 4, 2016
ChessBase	Nov 25, 2017
ChessBase (Database)	Feb 26, 2018
ChessOK	Jul 30, 2013
Chiron	Sep 24, 2017
Clemens Keck	Oct 15, 2017
Critter	Jan 25, 2014
Depth	Feb 25, 2018
Diogo R. Ferreira	Sep 4, 2016
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Evaluation	Feb 1, 2018
FGRL	Oct 1, 2017
Fortress	Feb 1, 2018
Franklin Titus	Aug 20, 2013
Gaviota Tablebases	Apr 22, 2018
Harun Taner	May 17, 2015
Houdini	Apr 14, 2018
Initial Position	Apr 14, 2018
IPON	Jun 2, 2014
Ivan Bratko	Aug 16, 2017
Kai Laskos	Jan 21, 2018
Komodo	Mar 6, 2018
Lance Perkins	Nov 10, 2011
Magic Bitboards	Apr 13, 2018
Martin Thoresen	Apr 29, 2015
Match Statistics	Mar 31, 2018
Matej Guid	Jan 6, 2018
Milos Stanisavljevic	May 23, 2016
Naum	Nov 23, 2017
Norman Schmidt	Oct 12, 2017
Parallel Search	Dec 30, 2017
Pawn Advantage, Win Percentage, and Elo	Dec 20, 2017
Playing Strength	Mar 31, 2018
Reductions	Nov 1, 2017
Rein Halbersma	Dec 22, 2015
Richard Vida	Aug 11, 2013
Robbolito	Sep 23, 2016
Robert Houdart	Dec 8, 2017
Rybka	Mar 27, 2017
Score	Apr 14, 2018
Search	Feb 1, 2018
Selectivity	Jan 12, 2018
Spike	Jan 7, 2016
Stockfish	Apr 7, 2018
Strelka	May 17, 2016
Syzygy Bases	Apr 19, 2018
Tarrasch	Apr 15, 2017
TCEC	Apr 18, 2018
TCEC Season 10	Jan 3, 2018
TCEC Season 11	Apr 18, 2018
TCEC Season 5	Jun 2, 2014
TCEC Season 6	Dec 2, 2014
TCEC Season 7	Jan 23, 2015
TCEC Season 8	Nov 30, 2015
TCEC Season 9	Nov 6, 2017
Thread	Apr 22, 2018
Vadim Demichev	Jul 26, 2013
Zappa	Oct 24, 2017

Up one level

Ikarus

GerdIsenberg — Tue, 05 Jul 2016 20:50:20 GMT

Home * Engines * Ikarus

		Ikarus, a chess engine by Munjong and Muntsin Kolss, written in Delphi. The development started in January 1997, and in May 2000 Ikarus was released as Young Talent by ChessBase ^[1] . Ikarus is the German spelling of Icarus from Greek mythology, with his attempt to escape from Crete by means of wings that his father, Daedalus, constructed from feathers and wax. However, the chess engine Ikarus is not related with the internet chess client Icarus by Random Software ^[2] . Ikarus played three World Computer Chess Championships so far, the WCCC 1999 in Paderborn, the WCCC 2002 in Maastricht, and the WCCC 2006 in Turin, where Ikarus managed to win the Blitz tournament, awarded by the title of World Computer Speed-Chess Champion. Able to play Chess960, Ikarus participated at the two open Livingston Chess960 Computer World Championships, fifth place in 2005 and even third in 2006, and was qualified to play the Chess960CWC 2009 where only four engines competed in the final ^[3] ^[4] . Ikarus regularly played the International Paderborn Computer Chess Championships. The debut in 1999 with a shared second place was already promising. Further, Ikarus played various CCT Tournaments, and except one occasion at CCT6 with severe internet access problems due to a dying router ^[5] , it most often played for the top rankings.
Daedalus und Ikarus ^[6]

Description

given in 1999 from the ICGA tournament site ^[7] :

Development of Ikarus started in January 1997 when our previous program, named "BasicChess", reached the 64kb memory limit of Borland Pascal 7.0 and its source code had grown completely cryptic. The 32-bit language Borland Delphi 2.0 allowed us to finally use hash tables and the next year or so saw us implement a graphical user interface and most of the usual standard search heuristics (null move pruning, history heuristic, search extensions etc.) as well as some advanced data structures such as a pawn-king hash table.

From March 1998 on a Winboard-compatible version has been autoplaying a variety of computer opponents. Ikarus also got a new hand-crafted opening book. Over Christmas 1998 we added support for the endgame databases created by Eugene Nalimov; so our program contains a port of the probing code provided by the author.

Photos & Games

IPCCC 2002

IPCCC 2002: Munjong Kolss, Muntsin Kolss and Gerd Isenberg in Ikarus vs. IsiChess, Ulf Lorenz far left ^[8]

[Event "IPCCC 2002"]
[Site "Paderborn GER"]
[Date "2002.03.03"]
[Round "07"]
[White "Ikarus"]
[Black "IsiChess"]
[Result "1/2-1/2"]
 
1.e4 c5 2.Nf3 d6 3.d4 cxd4 4.Nxd4 Nf6 5.Nc3 a6 6.Be2 e6 7.f4 Be7 8.O-O O-O
9.Be3 Nc6 10.Kh1 Qc7 11.a4 Re8 12.Bd3 Nb4 13.a5 Bd7 14.Nf3 Rac8 15.Bb6 Qb8
16.e5 dxe5 17.fxe5 Nfd5 18.Nxd5 exd5 19.Re1 h6 20.c3 Nxd3 21.Qxd3 Bc5
22.Qxd5 Be6 23.Qd2 Bxb6 24.axb6 Rc6 25.Ra4 Rxb6 26.Rd4 Qc7 27.Rd1 Bb3
28.Rd7 Qc4 29.Ra1 Qb5 30.Re1 Rbe6 31.Rd6 Rxd6 32.Qxd6 Bc4 33.Qd2 Bd5
34.Nd4 Qd7 35.Re2 Qg4 36.Qe3 Qg6 37.h3 a5 38.Kh2 b6 39.Qf2 Qg5 40.Nf5 f6 
41.h4 Qh5 42.Qg3 g6 43.Ng7 Qxe2 44.Nxe8 Kf7 45.Nc7 Bc6 46.e6+ Ke7 47.Qxg6 Kd8 
48.Qg7 Kc8 49.e7 Qe5+ 50.Kg1 Qe1+ 51.Kh2 Qxh4+ 52.Kg1 Qe1+ 53.Kh2 Qe5+ 
54.Kh1 Qxc7 55.Qf8+ Kb7 56.e8=Q Bxe8 57.Qxe8 Qh7 58.Qe6 Qb1+ 59.Kh2 Qxb2 
60.Qd7+ Kb8 61.Qd8+ Ka7 62.Qd7+ 1/2-1/2

IPCCC 2005 b

IPCCC 2005 b, Round 7, Ikarus - Rybka ^[9] ^[10] ^[11] ^[12] ^[13]

[Event "15th IPCCC 2005"]
[Site "Paderborn GER"]
[Date "2005.12.30"]
[Round "7"]
[White "Ikarus"]
[Black "Rybka"]
[Result "0-1"]
 
1. e4 Nc6 2. d4 d5 3. e5 Bf5 4. Nf3 e6 5. Bd3 Nge7 6. Bg5 Be4 7. c3 h6 8. Bxe7
Bxe7 9. Bxe4 dxe4 10. Nfd2 Qd7 11. Nxe4 O-O-O 12. Qe2 f6 13. f4 f5 14. Nf2 g5
15. O-O Rhg8 16. Kh1 g4 17. Nd1 h5 18. Nd2 h4 19. Ne3 h3 20. gxh3 gxh3 21. Rf3
Rh8 22. Qf1 Bf8 23. Rxh3 Bh6 24. Qf3 Ne7 25. Rg1 Kb8 26. Rg2 Qa4 27. Rh5 Qxa2
28. Qh3 Ng8 29. Ndf1 c6 30. Rg6 Re8 31. Rgxh6 Nxh6 32. Rxh6 Rhg8 33. Qh5 Qxb2
34. Qf7 Qxc3 35. Rxe6 Ref8 36. Qe7 Qxd4 37. Qd6+ Qxd6 38. Rxd6 a5 39. Ng3 Rd8
40. Ngxf5 a4 41. Nc2 Kc7 42. Rxd8 Rxd8 43. Nd6 Ra8 44. Kg2 a3 45. h3 a2 46. f5
Ra5 47. f6 Kd7 48. f7 Ke7 49. e6 Re5 50. Kf3 b5 51. Ne4 b4 52. Na1 Rxe6 53. Kf4
Rg6 54. Nb3 Rh6 55. Nec5 Rh5 56. Nd3 c5 57. Nf2 c4 0-1

WCCC 2006

WCCC 2006: Jaap van den Herik awards the Blitz trophy to Munjong Kolss of Ikarus ^[14]

Forum Posts

Re: Ikarus in CCT6 by Munjong Kolss, CCC, February 07, 2005
Ikarus at CCT7 by Munjong Kolss, CCC, February 14, 2005
Re: Ikarus, FastMM4 and Delphi 2005? by Munjong Kolss, CCC, November 22, 2005 ^[15]

External Links

Engine

Ikarus (chess) from Wikipedia
Ikarus' ICGA Tournaments
The chess games of Ikarus from chessgames.com
Young Talents from Support - ChessBase, May 28, 2000 (dead link)
Chess software - IKARUS from ChessBase Shop (dead link)

Misc

References

^ Young Talents from Support - ChessBase, May 28, 2000 (dead link)
^ Random Software - Mobile / Linux / Windows / Mac / Utilities / Games / Anything | Icarus
^ Result Mainz Chess960 qualifier: 1) Sjeng 2) Rybka 3) Ikarus by Gian-Carlo Pascutto, CCC, July 04, 2009
^ Livingston Chess960 Computer World Championship | Chessdom by Eric van Reem
^ Re: Ikarus in CCT6 by Munjong Kolss, CCC, February 07, 2005
^ Daedalus und Ikarus, Relief in der Villa Albani, Rom, Ikarus – Wikipedia.de (German) - Daedalus constructs wings for his son, Icarus, after a Roman relief in the Villa Albani, image comes from the 4th edition of Meyers Konversations-Lexikon (1885–90), Daedalus from Wikiepedia
^ Ikarus' ICGA Tournaments
^ FSV personal chess service - Paderborn 2002 Pics (from Sunday, 03.03.2002) by Torsten Schoop
^ IPCCC 2005 games by Pedro Beltran, CCC, December 30, 2005
^ Ikarus vs Rybka (PGN) by Eduard Nemeth, CCC, December 30, 2005
^ Ikarus vs Rybka - New Update with Diagram by Eduard Nemeth, CCC, December 30, 2005
^ Ikarus vs Rybka - New Update +3 for Rybka! by Eduard Nemeth, CCC, December 30, 2005
^ Ikarus vs Rybka by Bigler, CCC, December 30, 2005
^ Photo by Gerd Isenberg
^ FastMM | Free Development software downloads at SourceForge.net

What links here?

Page	Date Edited
CCT10	May 5, 2013
CCT11	Feb 17, 2015
CCT12	Jan 28, 2018
CCT6	May 29, 2014
CCT7	Dec 16, 2017
CCT8	Apr 6, 2013
Chess960CWC 2005	Jan 1, 2016
Chess960CWC 2006	Sep 25, 2014
Chess960CWC 2009	Aug 21, 2012
ChessBase	Nov 25, 2017
Delfi	Jan 7, 2016
Delphi	Dec 16, 2016
Engines	Mar 10, 2018
Heiner Matthias	Mar 8, 2016
Ikarus	Jul 5, 2016
IPCCC 1999	Dec 21, 2012
IPCCC 2000	Dec 21, 2012
IPCCC 2001	Jan 9, 2014
IPCCC 2002	May 31, 2014
IPCCC 2003	Aug 17, 2016
IPCCC 2004	Dec 1, 2014
IPCCC 2005	Aug 21, 2015
IPCCC 2005 b	Apr 15, 2013
IPCCC 2006	Dec 8, 2012
Jonny	Nov 4, 2017
Mark Lefler	Nov 23, 2017
Munjong Kolss	Jan 7, 2016
Muntsin Kolss	Jan 7, 2016
WCCC 1999	Jul 13, 2017
WCCC 2002	Nov 24, 2017
WCCC 2006	Jan 28, 2018
WCRCC 2007	Nov 21, 2016
WCRCC 2009	Jul 14, 2014

Up one Level

Junior

GerdIsenberg — Tue, 27 Feb 2018 10:06:23 GMT

Photos & Games

WCCC 2006 Round 4

WCCC 2006 Shannon Trophy

Home * Engines * Junior

Junior, (Deep Junior)
a chess engine by primary programmer Amir Ban and Shay Bushinsky. Junior is six times winner of the Shannon Trophy from WCCC 2002, WCCC 2004 ^[1] , WCCC 2006, WCCC 2009 (shared), WCCC 2011 ^[2] and WCCC 2013, and two times winner of the World Microcomputer Chess Championship, the WMCCC 1997 and WMCCC 2001 respectively, and thus most successful program ever. Book authors are Alon Greenfeld and Boris Alterman. In 2003, the multiprocessor version Deep Junior played a 6-game match against Garry Kasparov that resulted in a 3-3 tie. Junior is known for its entertaining, dynamic and sometimes speculative playing style ^[3] ^[4] . Until version 10.0 market as ChessBase engine in conjunction with the Fritz GUI ^[5] , Deep Junior 13 as pure UCI compatible engine is purchased as download product from the Hiarcs site ^[6] , and requires a Windows PC and an external GUI supporting the UCI protocol.

Photos & Games

^[7]

WCCC 2006 Round 4

Stefan Meyer-Kahlen, Amir Ban, Theo van der Storm, ..., and Johannes Zwanzger watching

WCCC 2006, round 4, Junior - Shredder ^[8]

[Event "WCCC 2006"]
[Site "Turin, Italy"]
[Date "2006.05.27"]
[Round "4"]
[White "Junior"]
[Black "Shredder"]
[Result "1/2-1/2"]
 
1.e4 c5 2.Nf3 d6 3.d4 cxd4 4.Nxd4 Nf6 5.Nc3 a6 6.Be3 e5 7.Nb3 Be6 8.f3 Nbd7
9.Qd2 Be7 10.g4 O-O 11.O-O-O b5 12.g5 Nh5 13.Nd5 Bxd5 14.exd5 b4 15.Kb1 a5
16.Bb5 a4 17.Nc1 a3 18.Nd3 Rb8 19.Bc6 axb2 20.Rhg1 Qc7 21.Rg4 f5 22.Rxb4 f4
23.Bf2 Bxg5 24.c3 Kh8 25.Qc2 Nhf6 26.Rg1 Bh6 27.Qa4 Nb6 28.Qa5 Nbxd5 29.Qxc7
Nxc7 30.Rxb8 Rxb8 31.Nb4 Ne6 32.Rd1 e4 33.a4 exf3 34.a5 Ng4 35.Rd2 Nxf2
36.Rxf2 Nc7 37.a6 Nxa6 38.Nxa6 Rb3 39.Rxf3 g5 40.Bd5 Rb5 41.Bc4 Rb7 42.Nb4 g4
43.Rd3 Bg7 44.Rxd6 Bxc3 45.Nd5 Bd2 46.Nf6 Bc3 47.Nxg4 Kg7 48.Rd5 Ra7 49.Ba2
h6 50.h4 Ra4 51.Nh2 Re4 52.Rd1 Re3 53.Rg1+ Rg3 54.Rf1 Re3 55.Nf3 Kg6 56.Bb3
Kf5 57.h5 Re7 58.Rd1 Kg4 59.Bd5 1/2-1/2

WCCC 2006 Shannon Trophy

Jaap van den Herik awards Amir Ban with the Shannon Trophy. First prize for Junior, WCCC 2006

Description

given in 1995 from the ICGA page ^[9] :

Junior is a leading Israeli chess playing PC program. It was developed as a hobby by Amir Ban and Shay Bushinsky. Junior's breakthrough occurred during August 1994: The program scored a remarkable equal fourth place (with GM Alon Greenfeld) in the Kfar-Saba Open national chess tournament. The games were conducted under normal tournament time control. In the final round, Junior amazingly defeated GM Leonid Gopstein. During November 1994, Junior participated in the strongest international blitz tournament ever held in Israel. It beat GM Ilya Smirin and drew with GM Lev Psakhis and GM Alon Greenfeld. Amongst others, Junior reached a completely won position against GM Judit Polgar. Since then Junior has established itself as a well respected player in the Israeli chess scene and is the one and only software selected to play in Israel's national chess league. Junior is one of the top chess playing programs on the Internet Chess Server.

Program Internals

Amir started chess programming in 1985 - Junior's predecessor was written in Turbo Pascal, later ported to C and C++. In 1993, Shay joins Amir's programming efforts, specializing in evaluation and optimisation ^[10] .

C++

Amir Ban in rgcc, June 1997 ^[11] ^[12] :

Junior is written entirely in C++ (Borland). The entire search engine is the implementation of class 'Position'. One statement that cannot be said about Junior is that it is slow. I've heard these kinds of performance arguments about C++ several times in the past. As a C++ veteran in many projects, I'm quite mystified about what is supposed to be slow about the language.

Creating a new Position and detroying it for every node is indeed the classic OOP approach, and also exactly what my program does. Your assumption that this involves "malloc" (or "new) is the incorrect one. mallocing a Position whenever you need one is as unnecesary and silly as mallocing an int every time you want to do a loop. You should malloc something when you want it to have dynamic lifetime and/or scope.

You can create an object as you create an int, by putting it as an auto variable on the stack, e.g.:

alphabeta(...)
{
   ...
   Position newPosition;
   ...
}

This constructs a Position at the point of declaration and destroys it on the exit from the block. The constructor and destructor do exactly what you code in them of course. No more, no less. The overhead for this is not low. It's zero.

Search Depth

Amir Ban in rgcc, March 1998 ^[13] :

The brute-force ply depth is indeed half the publicized depth. All the rest are extensions (in conventional terminology, I don't think of them this way). If you set Junior to depth 12, e.g., then you should be able to find a 7-ply combination where it fails. If I am doing a good job, then you should have a hard time finding one.

The question of what this is equivalent to in terms of other programs, e.g. a null-mover with "standard" extensions is interesting, but I don't know the answer. In tournament conditions middlegame Junior typically gets 14-16 depths, and it looks competitive tactically.

Amir Ban in CCC, April 1998 ^[14] ;

The Junior depth value measures half-plies, so if you insist, it's ply 6. I could have called it ply 12 or ply 9 with equal justification. Since nobody does brute-force anymore, and everybody does both pruning and extensions, what the depth indicator means is a bit vague. Very roughly, I would propose this equality:

Genius depth 6 = Rebel depth 8 = Fritz5 depth 10 = Junior depth 12

which once said should be forgotten, since it's much more complicated than that.

Razoring

Amir Ban in a CCC discussion with Robert Hyatt on Razoring versus Pruning, January 1999 ^[15] :

Razoring is supposed to be a sort of forward pruning where rather than skipping an entire subtree, you search it to a reduced depth, typically one less than normal depth. The advantage is that you get most of the saving but with much lower risk than pruning entire subtrees. Razoring is the only forward pruning technique Junior uses, with a depth reduction of one (half-ply). Seems like Crafty uses the same definition ...

Release Dates

Junior 3.3
Junior 3.5
Junior 4.0
Junior 5.0 : 1998
Junior 6.0 : 2000
Junior 7 : 2002
Junior 8 : 2004
Junior 9 : 2005
Junior 10 : 2006-8
Junior 10.1 : 2007-6
Junior 11 : 2009-11
Junior 11.1 : 2010-3
Junior 11.2 : 2010-5
Junior 2010 : 2010
Junior 12 : 2010-11
Junior 12.5 : 2011-04
Junior 13 : 2012-02
Junior 13.3 : 2012-11
Deep Junior Yokohama: 2013-10-24

Matches

Publications

Amir Ban (1996). Junior among the Grandmasters. ICCA Journal, Vol. 19, No. 4
Frank Schneider (2001). Deep Junior wins the 18th World Microcomputer Chess Championship. ICGA Journal, Vol. 24, No. 3 » WMCCC 2001
David Levy (2003). The State of the Art in Man vs. “Machine” Chess. ICGA Journal, Vol. 26, No. 1 » Kasparov versus Deep Junior 2003
Karsten Müller (2003). Man Equals Machine in Chess. ICGA Journal, Vol. 26, No. 1 » Kasparov versus Deep Junior 2003
Amir Ban (2004). Deep Junior Confirms its Strength. ICGA Journal, Vol. 27, No. 3 » WCCC 2004
Shay Bushinsky (2007). Showdown in Elista. ICGA Journal, Vol. 30, No, 2 » Deep Fritz versus Deep Junior 2007
Shay Bushinsky (2009). Deus Ex Machina— A Higher Creative Species in the Game of Chess. AI Magazine, Vol. 30, No. 3 ^[16]
Amir Ban (2012). Automatic Learning of Evaluation, with Applications to Computer Chess. Discussion Paper 613, The Hebrew University of Jerusalem - Center for the Study of Rationality, Givat Ram » Learning

Forum Posts

1995 ...

Question to Amir Ban by Bas Hamstra, CCC, November 05, 1997
Junior: "Fast" Searcher or "Deep" Searcher? by Fernando Villegas, CCC, April 19, 1998
Re: What is "pre-processing" by Amir Ban, May 08, 1998 » Pre-processing
Junior 4.6 and the null move technique by Sylvain Renard, CCC, March 14, 1998
Junior 5 ! by Dirk Frickenschmidt, rgcc, August 25, 1998
Re: Razoring? by Amir Ban, CCC, January 27, 1999 » Razoring

2000 ...

Junior chess program. Just version of Fritz 5? by Leonid, CCC, July 29, 2000 » Fritz
Answers by Amir Ban, CCC, February 15, 2003 ^[17] » Kasparov versus Deep Junior 2003
Re: Shredder 8 secret: search depth? by Vasik Rajlich, CCC, March 23, 2004 » Depth, Shredder, Fritz

2010 ...

Patt-Bug, Junior 11.1a show mate and Ktulu 9.03 made patt! by Frank Quisinsky, CCC, March 23, 2010 » Stalemate
Deep Junior 12 now available by Graham Banks, CCC, October 27, 2010
Junior is World Computer Chess Champion! by Gerd Isenberg, CCC, August 17, 2013
WCCC 2013: Junior wins by Mike Scheidl, CCC, August 17, 2013
Israel’s Deep Junior still the king at WCCC by Sean Evans, CCC, August 19, 2013 ^[18]
Deep Junior Yokohama by Graham Banks, CCC, October 24, 2013
Deep Junior Yokohama by Graham Banks, CCC, November 29, 2013

External Links

Junior's ICGA Tournaments
Junior (chess) from Wikipedia
Deep Junior timeline by Jorn Barger, February 2003
Programs and essentials by Steve Lopez, ChessBase News, March 13, 2005 » Shredder 9
Amir Ban on Deep Junior from Combinatorics and more - Gil Kalai’s blog, June 25, 2008

Purchase

Reports

Misc

Junior from Wikipedia
Franco Tonani - Junior's Idea, from Night In Fonorama, recorded Milan, May 31,1964, YouTube Video
feat. Giovanni Tommaso, Franco D'Andrea, Gato Barbieri, Franco Ambrosetti

References

^ Junior thoughts by Amir Ban, CCC, July 12, 2004
^ ריאיון עם שי בושינסקי, November 27, 2011 (Hebrew) Interview with Shay Bushinsky translated by Google Translate
^ Programs and essentials by Steve Lopez, ChessBase News, March 13, 2005
^ Nice article about Junior 9 by Steve Lopez by Jorge Pichard, CCC, March 12, 2005
^ Chess software - Junior 10 from ChessBase
^ Deep Junior 13 PC Chess Software from HIARCS Chess Software for PC, Mac, Pocket PC, iPhone, iPod and Palm Chess
^ WCCC 2006, Photos by Gerd Isenberg
^ Turin 2006 - Chess - Round 4 - Game 1 (ICGA Tournaments)
^ Junior's ICGA Tournaments
^ Deep Junior timeline by Jorn Barger, February 2003
^ Search Degredation w/ C++ by Chris Jason Richards, rgcc, June 12, 1997, post 4 and 6 by Amir Ban
^ Question to Amir Ban by Bas Hamstra, CCC, November 05, 1997
^ Funny Junior Engine in CBLight / Junior Engine ply depth by Wolfgang Krietsch, rgcc, February 27, 1998, post 7 and 16 by Amir Ban
^ Re: Junior by Amir Ban, CCC, April 20, 1998
^ Re: Razoring? by Amir Ban, CCC, January 27, 1999
^ "Deus Ex Machina - article by Shay Bushinsky by Lonnie Cook, CCC, August 26, 2016
^ list of questions to ask to Amir and Shay ... by Vincent Lejeune, CCC, February 10, 2003
^ Israel’s Deep Junior still the king at World Computer Chess Championship, Jerusalem Post, August 18, 2013
^ Israel’s Deep Junior still the king at WCCC by Sean Evans, CCC, August 19, 2013

What links here?

Page	Date Edited
Aegon 1995	Apr 6, 2017
Alon Greenfeld	Feb 24, 2017
Álvaro Begué	Feb 27, 2018
Amir Ban	Jan 24, 2016
Anthony Cozzie	Nov 5, 2016
Automated Tuning	Feb 27, 2018
Booot	Jan 22, 2018
Boris Alterman	Dec 18, 2015
Brutus	Dec 24, 2016
CCT Tournaments	Jan 29, 2017
CCT1	Dec 30, 2012
CCT10	May 5, 2013
CCT12	Jan 28, 2018
CCT2	Sep 7, 2012
CCT4	Apr 22, 2013
CCT6	May 29, 2014
CCT8	Apr 6, 2013
CCT9	Aug 25, 2013
ChessBase	Nov 25, 2017
Daniel Mehrmann	Dec 13, 2015
Deep Fritz versus Deep Junior 2007	Oct 15, 2016
Deep Sjeng	Jan 7, 2016
Depth	Feb 25, 2018
DOCCC 2007	Aug 15, 2015
Dorky	Oct 10, 2016
Eigenmann Endgame Test	Jun 1, 2017
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Eric Schiller	Dec 5, 2016
Eugen	Jan 7, 2016
Fabien Letouzey	Feb 5, 2018
Fernando Villegas	Aug 15, 2016
Frank Schneider	Jan 7, 2016
Fritz	Feb 26, 2018
Fruit	Sep 27, 2016
Gyula Horváth	Jan 7, 2016
Harvard Cup 1995	Nov 9, 2012
ICGA Journal	Dec 21, 2017
ICT 2010	Sep 14, 2015
IPCCC 2000	Dec 21, 2012
Jonny	Nov 4, 2017
José Manuel Morán	Jun 3, 2017
Junior	Feb 27, 2018
Kasparov versus Deep Junior 2003	Mar 18, 2017
Kasparov versus X3D Fritz 2003	Aug 17, 2016
King of Kings	Sep 4, 2013
Kramnik versus Deep Fritz 2002	Oct 16, 2017
Kramnik versus Deep Fritz 2006	Nov 28, 2017
Leonid Liberman	May 23, 2015
Man vs Machine Team Championship	Aug 21, 2016
Mikko Aarnos	Mar 14, 2015
Mini Chess	Jun 7, 2013
Oracle	Sep 4, 2016
Pacque Expert	Jan 8, 2016
Pandix	Feb 4, 2017
Peter Berger	Feb 29, 2016
PV Extensions	May 4, 2013
Razoring	Oct 5, 2015
Ruy Lopez	Jun 3, 2017
Rybka Controversy	Jan 18, 2018
Shannon Trophy	Jul 7, 2017
Shay Bushinsky	Aug 28, 2016
Shredder	Jan 21, 2018
Stalemate	Feb 21, 2018
Steve Lopez	Dec 4, 2016
Sylvain Renard	Feb 27, 2018
TCEC Season 5	Jun 2, 2014
TCEC Season 6	Dec 2, 2014
TCEC Season 7	Jan 23, 2015
TCEC Season 8	Nov 30, 2015
Texel's Tuning Method	Dec 2, 2017
Vasik Rajlich	Sep 23, 2017
Vincent Diepeveen	May 5, 2017
Virtual Chess	Mar 25, 2017
WCCC 1995	Jul 12, 2017
WCCC 1999	Jul 13, 2017
WCCC 2002	Nov 24, 2017
WCCC 2003	Apr 2, 2017
WCCC 2004	Jan 28, 2018
WCCC 2005	Dec 27, 2016
WCCC 2006	Jan 28, 2018
WCCC 2008	Jan 3, 2017
WCCC 2009	Apr 2, 2017
WCCC 2010	Jan 6, 2017
WCCC 2011	Jan 7, 2017
WCCC 2013	Dec 7, 2016
WCSC 2010	Jan 6, 2017
WCSC 2011	Jan 7, 2017
WCSC 2013	Aug 17, 2016
Who's Who	Sep 6, 2017
WMCCC 1995	Jan 3, 2018
WMCCC 1996	Sep 15, 2016
WMCCC 1997	Apr 4, 2017
WMCCC 2000	Feb 27, 2018
WMCCC 2001	Jul 25, 2017
World Computer Chess Championship	Mar 6, 2018
World Microcomputer Chess Championship	Jan 7, 2016
Zappa	Oct 24, 2017
Zappa versus Rybka 2007	Nov 25, 2017
ZChess	Jan 8, 2016
Zzzzzz	May 14, 2016

Up one level

Komodo

GerdIsenberg — Tue, 06 Mar 2018 22:12:57 GMT

Home * Engines * Komodo

		Komodo, a chess engine by primary author Don Dailey (died at the age of 57 on November 22, 2013) and since October 2013, by Mark Lefler, supported by chess advisor and evaluation expert and Don's long time collaborator Larry Kaufman. In July 2016, Komodo 10.x won the Shannon Trophy. Komodo appeared in January 2010 derived from Don's former engine Doch. It uses bitboards as internal board representation, and has a sophisticated search and a knowledge based, balanced evaluation. Komodo is a standalone chess engine supporting the UCI protocol and is available for multiple platforms and operating systems, and is therefore compatible with free and commercial UCI compliant chess graphical user interfaces and database front ends. As of December 2011, Komodo became commercial with version 4 ^[1], earlier versions running under Windows, Linux, Mac OS and Android are available from the Komodo download site, free for non-commercial use ^[2]. Next release date was May 2013, with CCT15 winner Komodo CCT ^[3].
Komodo logo ^[4]

Further Versions

Komodo 5

Komodo 5.1 MP, released in June 2013, was a major rewrite in C++11, able to perform a parallel search to run on multiple processors ^[5] .

Komodo 6

In October 2013, Don Dailey announced the release of Komodo 6 and also bad news concerning the future status of Komodo due to his fatal illness of a acute form of Leukemia ^[6] . He introduced Mark Lefler as new member of the Komodo team ^[7] ^[8] . Don Dailey died November 22, 2013 at age 57, just about the same time that Komodo pulled ahead of Stockfish by winning game 2 in the TCEC Season 5 final ^[9] ^[10] .

Komodo TCEC and 7

As winner of the TCEC 5 final, Komodo TCEC was released on December 04, 2013 ^[11], the further improved Komodo 7 on May 21, 2014, during the TCEC Season 6 final versus Stockfish again, now supporting Syzygy Bases ^[12], probing code interface implementation by Jeremy Bernstein ^[13].

Komodo 8

Komodo 8, released on September 05, 2014, is a substantial improvement over Komodo 7a, which was already rated among the top three chess engines on almost all rating lists ^[14]. Komodo 8 supports Syzygy Bases and is available for Windows, Linux, Mac OS and Android, the latter immediately available for import in Chess for Android and in Chess for Glass ^[15]. Since mid September 2014, Komodo 8 for Windows is available as ChessBase engine, bundled with the Deep Fritz interface, Syzygy bases not included ^[16].

Komodo 9

Komodo 9, released on April 28, 2015, continues the progress with approximately +50 Elo over Komodo 8 due to improved search, evaluation, and time management, as well as more efficient use of multiprocessing ^[17]. Most noticeable is the increase in search depth reached in a given amount of time, which is due to better extension, reduction, and pruning rules ^[18]. Further, Komodo 9 now features Chess960 and a persistant hash to save and restore analysis.

Komodo 10

On May 23, 2016, Komodo 10 came with revised and improved king safety, pawn storm and passed pawn evaluation, as well with revised LMR, NMP, IID and history heuristic concerning search, and is about 60 Elo stronger than Komodo 9 ^[19]. In July 2016, Komodo 10.x won the Shannon Trophy.

Komodo 11

On May 23, 2017, Komodo 11.01 was released, which corrected some minor issues of Komodo 11, which was already released by ChessBase a few days before. It is estimated about 55 Elo stronger than Komodo 10 at intermediate time controls, gains related to evaluation ^[20], revised quiescence search, singular extensions, LMR , and parallel search ^[21] . Komodo 11.2, released on July 17, 2017, was the version which won the WCCC 2017 ^[22]. Komodo 11.3 was released on March 04, 2018 with subsequent improvements ^[23]. It also comes with a BMI2 compile for compatible x86-64 processors - so far not recommend for AMD Ryzen due to its slow PEXT implementation ^[24].

Tournament Play

Komodo played the ICT 2010 in Leiden over the board, and further the CCT12 and CCT14.

CCT 15/16 and TCEC 5-7

Komodo had its first tournament success in 2013, when it won the CCT15 with 6½/7, and later that year the TCEC Season 5 after qualifying for the Superfinal and 48 thrilling games versus Stockfish by a margin of 25 - 23. In 2014, Komodo won the CCT16 with 5½/6. In May 2014, at TCEC Season 6, Komodo 7 qualified for the Superfinal - again versus Stockfish - both engines further improved and supporting Syzygy Bases. This time, Stockfish won the 64 game match 35½ - 28½. Again, the other way around at TCEC Season 7 - Superfinal in December 2014 - version 8 successor Komodo 1333 won from Stockfish 141214 with 33½ - 30½.

WCCC / WCSC / WCRCC 2015

At the WCCC 2015 in Leiden, Komodo 9.x won the Blitz tournament, and became runner-up behind and losing from the massively parallel and distributed Jonny which played on a cluster of 100x24 cores. After the revenge winning against Jonny at the equal hardware WCSC 2015 a few days later, Komodo was unlucky and made too many draws against apparently weaker opponents ^[25], to became third behind Shredder and Ginkgo. Two weeks later, Komodo won the WCRCC 2015 convincingly with 9/9!

Komodo team Erdogan Günes and Mark Lefler during the WCCC 2015 in Leiden ^[26]

TCEC Season 8

In Fall 2015, Komodo 9.3x dominated the TCEC Season 8 and won the Superfinal again versus Stockfish, this time 100 games with +9, =89, -2, that is 53½ - 46½ ^[27].

WCCC / WCSC / WCRCC 2016

The 2016 ICGA tournaments in Leiden were a huge success for Komodo 10.x, which did not only won the Shannon Trophy in the open hardware World Computer Chess Championship after a nerve-racking six games play-off versus defending champion Jonny - Komodo with 48 threads on 60 core Intel i7 versus Jonny's cluster of 100x24 AMD cores, but aso the equal hardware World Chess Software Championship with 5/6 - 1½ points ahead of runner-up Jonny and Shredder. Two weeks later Komodo defended its ACCA title in rapid chess at the WCRCC 2016 with 14 wins and one draw versus runner-up Andscacs, that is 14½ out of 15.

WCCC 2016, Komodo team Erdogan Günes and Mark Lefler with Shannon Trophy ^[28]

WCCC / WCSC / WCRCC 2017

In 2017, Komodo could defend it titles at the WCRCC 2017 online, and the soon later released Komodo 11.2 the ICGA WCCC 2017 over the board, again in a play-off versus Jonny. Komodo further became runner-up at the uniform hardware WCSC 2017 behind Shredder.

WCCC 2017, Komodo opening book author and operator Erdogan Günes with the Shannon Trophy ^[29]

Quotes

Promotions

Don Dailey on Minor Promotions ^[30] :

Komodo never looks at rook or bishop under promotions and only looks at knight under promotions when it gives check. But even for the knight case there are positions where my rule won't find the right move.

Evaluation

Centered Point Values

In 2012, Don Dailey gave following point values in a kind of millipawn scale, tapered between opening and endgame phase with knight and bishop values constant - positional scores from mobility and piece square tables centered around zero ^[31] :

		Pawn		Knight		Bishop		Rook		Queen
Opening		600		3100		3225		4350		9100
Ending		925		3100		3225		5475		9700

Quality of Knowledge

Don Dailey in a reply to Vincent Diepeveen ^[32] :

Don, Your program is kind of a beancounter that relies heavily positional upon piece square tables.

You could not be more incorrect. We have piece square tables in Komodo that are a very minor part of Komodo and get very small weights but Komodo puts a huge emphasis on getting the evaluation right with hundreds of evaluation terms that are carefully balanced to produce a find positional chess program. I personally believe that Komodo has the best evaluation function of any chess program in the world.
...
Total amount of knowledge is not what is important, it's the QUALITY of the knowledge that is. Komodo tries to have the most balanced evaluation function possible, and probably much more knowledge than most programs. I don't believe in quantity but Komodo evolved to have a lot of knowledge anyway - probably because every piece of knowledge in Komodo is needed. I tried removing knowledge in Komodo to get speed and we were not able to remove ANYTHING without noticing that it weakened Komodo, at least slightly.

Lazy Evaluation

Don Dailey on Selectivity and Lazy Evaluation ^[33] :

Komodo pushes the selectivity pretty hard and we DO get a decent nodes per second increase with Lazy evaluation but the problem is that we get a big increase in nodes. It is this way because we assume we will not make scout if the guesstimate is too low. So we miss some of the beta cutoffs, you cannot have your cake and eat it too. Komodo's positional component can vary enormously so we do take a lot of damage positionally when we use lazy margins.

Node Counting

Don Dailey on counting nodes in Komodo 4 ^[34] :

As Larry mentioned we are counting nodes differently. More specifically, both versions have always counted a node when a move is made, but Komodo 3 would count nodes that were forward pruned (if the move was actually executed) and Komodo 4 does not. In Komodo 3 I figured that if any work was done (such as attack testing after making the move) it should count as a node. But in Komodo 4 we changed this because the move is technically being pruned (even if we had to check it out a bit first.) Of course if a move is searched or reduced it is counted in both versions.

It's mostly semantics, but we get more stable node counts and this works better for fixed node testing which we sometimes do.

I have several things in mind for getting serious speedups in future versions of Komodo which will bring the speed of Komodo back up to that of other programs, or at least not as far away. I believe Komodo is one of the slower programs in terms of raw search speed as we have put a really heavy focus on having a smart program and little on heavy optimization. The reasoning is the same for delaying the MP stuff too, we want to start with a really strong program before we play the optimization games.

Parallel Search

Don Dailey about aspects of parallel search in Komodo 5.1 MP ^[35]

How you approach a problem is strongly related to how you DEFINE a problem or task. The goal of MP is to make the program play as well as possible using more cores, to take advantage of the hardware as fully as possible and the only measure that really matters (at least to us) is playing strength. We ALL wish that our program played as if it they were 4x faster when playing on 4 cores - but nobody gets that kind of efficiency.

Some have implied that we search wider because we don't get quite the same increase in depth and that this is a horrible thing. The intuition is that if that if it works you could do it on 1 thread too. However I do not think that follows. The problem is that 4 threads is just not 4x better than 1 thread no matter how good your MP implementation, so it always comes down to how to best utilize what you have. Anything goes in my opinion if it gets more out of extra cores in terms of ELO.

It is well known that programs do not scale well beyond a few processors. Going from 128 to 256 processors gives you very little. One of the things Larry and I want to do is to explore how to better exploit more and more cores and hopefully what we learn will translate to better performance on few cores. It is unlikely to be minor refinements to what we already do.

I'm not breaking new ground as this has been studied for decades and lots of ideas have been tried - I'm not pretending otherwise. But we will look at new original ideas we come up with and revisit old-fashioned ideas that have been tried in the past. A lot of the old ideas which have been rejected have later come back to life, so there is no idea that is off-limits.

As far as whether searching "wider" is a bad thing and isn't real parallelism, I disagree with that. If 4 cores were 4 times better than one I probably would agree but since it isn't, we have to determine where the effort is best spent. If you have 11 people in the room and 10 are doctors and the one who isn't has a heart attack, what is the best use of the doctors time? Not all 10 doctors can give CPR even though normally that would be very best use of their talent, but surely one of them will be calling for an ambulance while another will be doing CPR and the rest will be doing whatever they can to assist, even in little ways.

So if you are getting very little benefit out of additional processors you need to figure out if there is something else they can do to be more useful. Perhaps one thing is to deal with the lines that are severely reduced in the single core program?

Publications

Arno Nickel (2012). Die schöne neue Welt der Schachengines. SCHACH 2,3,5,6 2012, pdf (German) ^[36]
Tamal T. Biswas, Kenneth W. Regan (2015). Measuring Level-K Reasoning, Satisficing, and Human Error in Game-Play Data. IEEE ICMLA 2015, pdf preprint

Forum Posts

2010

A New Name for Doch.... by Fernando Villegas, CCC, January 07, 2010
Komodo 1.0 JA by Don Dailey available by Jim Ablett, CCC, January 22, 2010
Komodo credit by Don Dailey, CCC, January 22, 2010
Don: what a devilish thing you did!!!! by Fernando Villegas, CCC, January 24, 2010
Help with Komodo testing by Don Dailey, CCC, April 27, 2010
komodo 1.3 beta 1 test available by Jim Ablett, CCC, December 21, 2010
Komodo 13b1 tests by Harun Taner, CCC, December 25, 2010

2011

out of check move ordering by Don Dailey, CCC, March 12, 2011
Re: Magics by Don Dailey, CCC, May 25, 2011
Komodo 2.01 is out! by Don Dailey, CCC, June 09, 2011
Komodo 2.03 release is imminent by Don Dailey, CCC, June 14, 2011
Komodo 2.03 SSE42 available by Don Dailey, CCC, June 17, 2011
Komodo 3 release by Don Dailey, CCC, August 16, 2011
The importance of contempt by Don Dailey, CCC, August 28, 2011 » Contempt Factor
Lazy eval by Larry Kaufman, CCC, November 27, 2011 » Lazy Evaluation
Komodo 4 SP released! by Karol Majewski, CCC, December 25, 2011

2012

Should reduction depend on depth? by Larry Kaufman, CCC, January 14, 2012 » Late Move Reductions
Re: Approaches to king safety? by Don Dailey, CCC, January 20, 2012 » King Safety
A new way to compare chess programs by Larry Kaufman, CCC, June 21, 2012 » Match Statistics
Komodo 5 release now available! by Don Dailey, CCC, July 19, 2012
The scaling of Houdini 3 and Komodo 5 by Kai Laskos, CCC, November 16, 2012 » Houdini
Re: The scaling of Houdini 3 and Komodo 5 by Don Dailey, CCC, November 16, 2012
Elo points gain from doubling time by Kai Laskos, CCC, December 10, 2012 » Diminishing Returns

2013

10 Lessons to be Learned from todays Top Engines by Josef, Rybka Forum, January 03, 2013 » Houdini, Stockfish
Komodo CCT release by Don Dailey, CCC, May 03, 2013
Re: History pruning / move ordering question by Don Dailey, CCC, May 10, 2013 » Countermove Heuristic
Komodo 5.1 MP by Don Dailey, OpenChess Forum, June 12, 2013
Komodo 5.1 MP has been released by Don Dailey, CCC, June 17, 2013
Peculiarity of Komodo 5.1MP by Kai Laskos, CCC, June 19, 2013 » Parallel Search
Komodo 5.1MP revision 1 by Don Dailey, CCC, June 27, 2013
back to the Komodo SMP issue by Robert Hyatt, CCC, July 01, 2013
Komodo release by Don Dailey, CCC, October 01, 2013
Re: Who is Don/Larry's new partner!? by Don Dailey, CCC, October 08, 2013
Official announcement - New Komodo Author by Don Dailey, CCC, October 14, 2013
komodo wins stage 3 by Don Dailey, CCC, November 04, 2013 » TCEC, TCEC Season 5
Komodo-TCEC by Larry Kaufman, CCC, December 01, 2013
Komodo TCEC released by Larry Kaufman, CCC, December 04, 2013
TCEC - Thanks Martin and congrats to the winner Komodo by Gordon Robertson, CCC, December 05, 2013 » TCEC, TCEC Season 5
Komodo TCEC: Serious castling bug ! by Stefan Pohl, CCC, December 10, 2013
Re: Komodo TCEC: Serious castling bug ! by Mark Lefler, CCC, December 11, 2013

2014

Threads-Test - SF, Zappa, Komodo - 1 vs. 2, 4, 8, 16 Threads by Andreas Strangmüller, CCC, May 04, 2014 » Thread, Stockfish, Zappa, Komodo
Threads factor: Komodo, Houdini, Stockfish and Zappa by Andreas Strangmüller, CCC, May 17, 2014 » Komodo, Houdini, Stockfish, Zappa
Komodo 7 by Larry Kaufman, CCC, May 19, 2014
Komodo Syzygy evals by Ianski hurnavich, CCC, May 21, 2014 » Syzygy Bases
Komodo 7a vs. Houdini 4 by Larry Kaufman, CCC, May 23, 2014
Komodo 8 Chessbase by Herbert L, CCC, August 27, 2014
Komodo 8 Announcement by Larry Kaufman, CCC, August 28, 2014
Komodo 8 for Android is a MONSTER! by Robert Flesher, CCC, September 06, 2014
About Komodo 5.1r2 MP and Komodo CCT by Mike Scheidl, CCC, September 07, 2014
Komodo 8 on the rating lists by Larry Kaufman, CCC, September 14, 2014 » Engine Rating Lists
Some fun with Komodo 8 by Kai Laskos, CCC, September 23, 2014 » EBF
Komodo Android Experiment by Ted Summers, CCC, September 24, 2014
Threads test incl. Stockfish 5 and Komodo 8 by Andreas Strangmüller, CCC, October 09, 2014
Threads test - Stockfish 5 against Komodo 8 by Andreas Strangmüller, CCC, October 10, 2014 » Thread, Parallel Search, Stockfish, Komodo

2015

Komodo 8 - 5-men Syzygy tablebases by Andreas Strangmüller, CCC, January 10, 2015 » Syzygy Bases
Empirical results with Lazy SMP, YBWC, DTS by Kai Laskos, CCC, April 16, 2015 » Lazy SMP, YBWC, DTS
Komodo 9 Announcement by Larry Kaufman, CCC, April 22, 2015
Re: Komodo 9 Announcement by Mark Lefler, CCC, April 28, 2015
Komodo 9 update (9.01) by Mark Lefler, CCC, May 06, 2015
The effective speedup from 1 to 8 cpus for SF and Komodo by Adam Hair, CCC, May 31, 2015 » Parallel Search, Stockfish
Komodo 9.1 Release by Larry Kaufman, CCC, June 20, 2015
Significant modification of Komodo SMP implementation by Kai Laskos, CCC, June 23, 2015
Komodo 9.2 by Larry Kaufman, CCC, August 21, 2015
Komodo 9.3 has been released by Larry Kaufman, CCC, November 27, 2015
Komodo 9.3 game/x setting by Larry Kaufman, CCC, November 30, 2015

2016

Threads test incl. Komodo 9.3 by Andreas Strangmüller, CCC, January 17, 2016
Komodo 9.4 by Larry Kaufman, CCC, March 18, 2016
Komodo 9.42 by Larry Kaufman, CCC, March 21, 2016
The importance of "Dynamism" in Komodo by Kai Laskos, CCC, March 26, 2016
The flow of Komodo eval by Kai Laskos, CCC, May 19, 2016
Komodo 10 released by Larry Kaufman, CCC, May 23, 2016
Congrats to Komodo Team by Mehmet Karaman, CCC, July 03, 2016 » WCCC 2016, WCSC 2016
Komodo 10.1 by Larry Kaufman, CCC, July 21, 2016
Stockfish underpromotes much more often than Komodo by Kai Laskos, CCC, October 05, 2016 » Match Statistics, Promotions, Stockfish
Doubling of time control by Andreas Strangmüller, CCC, October 21, 2016 » Doubling TC, Diminishing Returns, Playing Strength, Komodo
Komodo 10.2 released by Larry Kaufman, CCC, October 29, 2016
Komodo 10.3 released by Larry Kaufman, CCC, December 22, 2016

2017

Re: Chessprogams with the most chessknowing by Mark Lefler, CCC, February 18, 2017 » Search versus Evaluation
Komodo 10.4 released by Larry Kaufman, CCC, March 14, 2017
6-men Syzygy from HDD and USB 3.0 by Kai Laskos, CCC, April 04, 2017 » Playing Strength, Syzygy Bases, USB 3.0
Symmetric multiprocessing (SMP) scaling - SF8 and K10.4 by Andreas Strangmüller, CCC, May 05, 2017 » Lazy SMP, Stockfish
Symmetric multiprocessing (SMP) scaling - K10.4 Contempt=0 by Andreas Strangmüller, CCC, May 11, 2017 » SMP
Komodo 11 is out! by Michael Reyes, CCC, May 15, 2017
Komodo 11.01 by Larry Kaufman, CCC, May 23, 2017
Thoughts on Komodo 11, Free engines and the future by Brian Smith, CCC, May 28, 2017
World Computer Chess Championship 2017: Komodo wins! by Ian Osgood, CCC, July 07, 2017 » WCCC 2017
Re: World Computer Chess Championship 2017: Komodo wins! by Ian Osgood, CCC, July 07, 2017
Komodo and WCCC by Rodolfo Leoni, CCC, July 10, 2017
Komodo 11.2 by Larry Kaufman, CCC, July 17, 2017
Komodo 11.2.1 by Larry Kaufman, CCC, July 22, 2017
komodo 11.2.2 by Larry Kaufman, CCC, July 28, 2017
Scaling from FGRL results with top 3 engines by Kai Laskos, CCC, September 26, 2017 » FGRL, Houdini, Stockfish

2018

Komodo 11.2.2 - Initial position until depth 54 by Andreas Strangmüller, CCC, January 15, 2018 » Initial Position
Komodo 11.3 released by Larry Kaufman, CCC, March 04, 2018
Komodo 11.3 by Ianski hurnavich, CCC, March 04, 2018
Re: Komodo 11.3 by Mark Lefler, CCC, March 04, 2018 » AMD, BMI2 PEXT
Komodo 11.3.1 by Larry Kaufman, CCC, March 06, 2018

Matches

Komodo knight odd match vs FM Victor Bolzoni : report by Vincent Lejeune, CCC, July 29, 2015 ^[37]
What will the match score be for Komodo against FM Bolzoni? by Larry Kaufman, CCC, July 22, 2015

Komodo vs Bolzoni, 1st game Broadcast by Vincent Lejeune, CCC, July 26, 2015
Komodo vs Bolzoni, 2nd game Broadcast by Vincent Lejeune, CCC, July 26, 2015
Komodo vs Bolzoni, 3rd game Broadcast by Vincent Lejeune, CCC, July 26, 2015
Komodo vs Bolzoni, 4th game Broadcast by Vincent Lejeune, CCC, August 02, 2015
Komodo vs Bolzoni, 5th game Broadcast by Vincent Lejeune, CCC, August 02, 2015
Komodo vs Bolzoni, 6th (and last) game Broadcast by Vincent Lejeune, CCC, August 02, 2015

Komodo vs GM handicap matches by Larry Kaufman, CCC, December 03, 2015
Komodo vs GM Williams match by Larry Kaufman, CCC, December 12, 2015
Mikhalevski vs Komodo match by Larry Kaufman, CCC, January 01, 2016 ^[38]
Nakamura vs. Komodo by Larry Kaufman, CCC, January 04, 2016 ^[39]
Komodo Beats Nakamura In Final Battle by Sam Copeland, Chess.com, January 08, 2016
Komodo Coasts To Victory Over Benjamin by Sam Copeland, Chess.com, March 31, 2016

External Links

Chess Engine

Komodo chess engine - Homepage
Komodo's ICGA Tournaments
Komodo (chess) from Wikipedia
The chess games of Komodo from chessgames.com
Depth of Satisficing by Ken Regan, Gödel's Lost Letter and P=NP, October 06, 2015 » Depth, Match Statistics, Pawn Advantage, Win Percentage, and ELO, Stockfish, Komodo ^[40]
A Chess Firewall at Zero? by Ken Regan, Gödel's Lost Letter and P=NP, January 21, 2016

Purchase

Komodo chess engine - Komodo 11
Komodo chess engine - Downloads
Komodo 11 - ChessBase Shop, May 16, 2017

Interviews

Interview with Don Dailey (Komodo programmer), nTCEC interview by Martin Thoresen, April 07, 2013
Interview with Don Dailey - TCEC - Immortal Chess
Quality Chess Blog » Q&A with Larry Kaufman, December 12, 2013
Interview with Robert Houdart, Mark Lefler and GM Larry Kaufman by Nelson Hernandez, Chessdom, November 23, 2017 » TCEC Season 10

Reports

Thoresen Chess Engine Competition | Denton Chess Club Blog by Ivan Urwin, October 5, 2013
Komodo wins the Thoresen Chess Engines Competition | Denton Chess Club Blog by Ivan Urwin, December 01, 2013 » TCEC Season 5
Roanoke Programmer Dies Days Before Efforts Win World Chess Championship, The RoanokeStar.com, December 06, 2013 ^[41]
One chess champion per laptop by Roberto Perez-Franco, MIT's The Tech, January 15, 2014 » TCEC Season 5
Komodo 8: Die neue Nummer 1 im Schach, ChessBase Nachrichten, September 10, 2014 (German)
Komodo 8: bringing creativity back to chess, ChessBase News, September 10, 2014
Komodo 8: about the authors, ChessBase News, September 19, 2014
Analyzing games with Komodo (Part one) by Albert Silver, ChessBase News, November 12, 2014
Analyzing games with Komodo (Part two) by Albert Silver, ChessBase News, November 13, 2014
Komodo 8: Deep Blue revisited (part one) by Albert Silver, ChessBase News, December 26, 2014 » Deep Blue, Kasparov versus Deep Blue 1997 ^[42]
The New Chess World Champion by Ken Regan, Gödel's Lost Letter and P=NP, December 28, 2014 » Larry Kaufman, TCEC Season 7
The Best Chess Of 2014 - Chess Engine of the Year, Chess.com, December 29, 2014
Komodo 8: Deep Blue revisited (part two) by Albert Silver, ChessBase News, December 31, 2014
Komodo 8: Deep Blue revisited (part three) by Albert Silver, ChessBase News, January 09, 2015
Anatomy of a Computer Chess Game by Christopher Chabris, The Wall Street Journal, January 9, 2015 » on Game 14 of the TCEC Season 7 Superfinal
The Komodo Files – working with a chess engine by Danny Gormally, ChessBase News, March 14, 2015
The Komodo Files – working with a chess engine (2) by Danny Gormally, ChessBase News, March 16, 2015
Komodo Chess 9 – Faster, smarter, stronger, ChessBase News, May 20, 2015
El Komodo 9 y lo que viene by Amador Cuesta for Magistral de León 2015, May 27, 2015 (Spanish)
And then there were two by John Hartmann, ChessBase News, June 09, 2015 » Komodo, Stockfish
Komodo 9 odds matches against GMs by Jesse Gersenson, ChessBase News, September 22, 2015
Komodo is World Computer Chess Champion by Frederic Friedel, ChessBase News, July 05, 2016 » WCCC 2016
Komodo: Birth of a chess engine by Priyadarshan Banjan and Albert Silver, ChessBase News, July 20, 2016
Fair play in engine chess, ChessBase News, December 30, 2016 » Houdini 5, Komodo 10
Komodo 11: A finely tuned engine by Davide Nastasio, ChessBase News, October 11, 2017
TCEC: Superfinal Houdini vs Komodo by Stephan Oliver Platz, ChessBase News, November 23, 2017 » TCEC Season 10

Android

How to install Komodo 8 in Android
Komodo 8 Chess Engine - Android Apps on Google Play
Komodo 8 for Android by Aart Bik, September 6, 2014
More on Komodo 8 by Aart Bik, September 9, 2014
Komodo 8: the smartphone vs desktop challenge by Albert Silver, ChessBase News, September 24, 2014 ^[43]

Rating Lists

Misc

References

^ Komodo 4 UCI chess engine download
^ Komodo chess engine by Don Dailey and Larry Kaufman - Downloads
^ Komodo CCT release by Don Dailey, CCC, May 03, 2013
^ Komodo 10.4
^ Komodo 5.1 MP has been released by Don Dailey, CCC, June 17, 2013
^ Komodo release by Don Dailey, CCC, October 01, 2013
^ Re: Who is Don/Larry's new partner!? by Don Dailey, CCC, October 08, 2013
^ Official announcement - New Komodo Author by Don Dailey, CCC, October 14, 2013
^ Komodo chess engine - Don Daily (1956 - 2013)
^ Don Dailey, 1956-2013 by Larry Kaufman, CCC, November 23, 2013
^ Komodo TCEC released by Larry Kaufman, CCC, December 04, 2013
^ Komodo chess engine - Komodo 7
^ Re: Komodo Syzygy evals by Larry Kaufman, CCC, May 21, 2014
^ Komodo chess engine - Komodo 8
^ More on Komodo 8 by Aart Bik, September 9, 2014
^ Komodo 8 - ChessBase Shop, September 10, 2014
^ Komodo chess engine - Komodo 9
^ Komodo 9 Announcement by Larry Kaufman, CCC, April 22, 2015
^ Komodo chess engine - Komodo 10
^ Komodo 11.01 by Larry Kaufman, CCC, May 23, 2017
^ Komodo 11 - Change Log
^ Komodo 11.2 by Larry Kaufman, CCC, July 17, 2017
^ Komodo 11.3 released by Larry Kaufman, CCC, March 04, 2018
^ Re: Komodo 11.3 by Mark Lefler, CCC, March 04, 2018 » AMD, BMI2 PEXT
^ THE upset of the WC: Maverick-Komodo drawn! by Jeroen Noomen, CCC, July 05, 2015
^ Photo by Gerd Isenberg
^ Komodo is triple champion, wins the Top Chess Engine Championship 2015!, Chessdom, November 29, 2015
^ ICGA Events 2016: Photos Day 7 by Jan Krabbenbos
^ Photo by Gerd Isenberg, July 07, 2017
^ Re: Botvinnik Markov revisited by Don Dailey, CCC, June 27, 2010
^ Re: What is the correct value of the pieces? by Don Dailey, CCC, October 10, 2012
^ Re: How effective is move ordering from TT? by Don Dailey, CCC, August 10, 2012
^ Re: Lazy eval by Don Dailey, CCC, December 02, 2011
^ Re: Don- Don't understand Komodo 4?? A bug?? by Don Dailey, CCC, December 26, 2011
^ Re: Peculiarity of Komodo 5.1MP by Don Dailey, CCC, June 19, 2013
^ Part 1 covers Houdini, Rybka, Komodo, Stockfish, Critter, Naum, Chiron and Spike
^ Victor Angel Bolzoni - Wikipedia.br (Breton)
^ Victor Mikhalevski from Wikipedia
^ Hikaru Nakamura from Wikipedia
^ Regan's latest: Depth of Satisficing by Carl Lumma, CCC, October 09, 2015
^ Roanoke Star from Wikipedia
^ Komodo 8: Deep Blue revisited (1/2) by Graham Banks, CCC, December 27, 2014
^ Komodo Android Experiment by Ted Summers, CCC, September 24, 2014

What links here?

Page	Date Edited
ACCA World Computer Rapid Chess Championship	Jun 27, 2017
Adam Hair	Jan 14, 2017
Albert Silver	Feb 25, 2018
AMD	Mar 9, 2018
Andreas Strangmüller	May 15, 2017
Android	Jan 9, 2018
Andscacs	Jan 16, 2018
Arno Nickel	Sep 25, 2015
BMI2	Mar 6, 2018
Branching Factor	Jun 28, 2017
CCT Tournaments	Jan 29, 2017
CCT12	Jan 28, 2018
CCT14	Aug 23, 2012
CCT15	Oct 21, 2014
CCT16	May 13, 2014
Chess for Glass	Dec 26, 2016
ChessBase	Nov 25, 2017
Chiron	Sep 24, 2017
Clemens Keck	Oct 15, 2017
Contempt Factor	Mar 10, 2018
Critter	Jan 25, 2014
Deep Blue	Aug 1, 2017
Depth	Feb 25, 2018
Doch	May 23, 2017
Don Dailey	Dec 7, 2016
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Erdogan Günes	Jul 7, 2017
Fernando Villegas	Aug 15, 2016
FGRL	Oct 1, 2017
Frank Schneider	Jan 7, 2016
Frederic Friedel	Jan 6, 2018
Ginkgo	Jul 13, 2016
GridGinkGo	Jul 13, 2016
Harun Taner	May 17, 2015
Houdini	Apr 14, 2018
ICGA Journal	Dec 21, 2017
ICT 2010	Sep 14, 2015
InBetween	Jan 21, 2018
Ingo Bauer	Jul 6, 2015
Initial Position	Apr 14, 2018
Ivan Urwin	Feb 8, 2014
Jeremy Bernstein	Nov 15, 2016
Jonny	Nov 4, 2017
Kai Laskos	Jan 21, 2018
Kasparov versus Deep Blue 1997	Aug 1, 2017
Kenneth Wingate Regan	Feb 19, 2018
Knowledge	Jul 22, 2017
Komodo	Mar 6, 2018
Larry Kaufman	Jan 28, 2018
Late Move Reductions	Sep 25, 2017
Lazy SMP	Jan 4, 2018
Lyudmil Tsvetkov	Mar 28, 2018
Mark Lefler	Nov 23, 2017
Match Statistics	Mar 31, 2018
Maverick	Jan 7, 2016
Memory	Dec 8, 2017
Naum	Nov 23, 2017
Occam	Jan 21, 2016
Parallel Search	Dec 30, 2017
Pawn Advantage, Win Percentage, and Elo	Dec 20, 2017
Playing Strength	Mar 31, 2018
Point Value	Mar 31, 2018
Point Value by Regression Analysis	Aug 26, 2017
Promotions	Jun 6, 2017
Protector	Oct 12, 2017
PT 51	Oct 5, 2017
Ralph Stoesser	Aug 8, 2015
Richard Vida	Aug 11, 2013
Robert Houdart	Dec 8, 2017
Rybka	Mar 27, 2017
Salvo Spitaleri	Mar 11, 2013
Sam Sloan	May 25, 2016
Search	Feb 1, 2018
Search Statistics	Jan 16, 2018
Shannon Trophy	Jul 7, 2017
SMP	Dec 26, 2017
Spike	Jan 7, 2016
Square Attacked By	Jan 20, 2018
Stockfish	Apr 7, 2018
Strelka	May 17, 2016
Syzygy Bases	Apr 19, 2018
Tamal T. Biswas	Jun 19, 2017
Tarrasch	Apr 15, 2017
TCEC	Apr 18, 2018
TCEC Season 10	Jan 3, 2018
TCEC Season 11	Apr 18, 2018
TCEC Season 5	Jun 2, 2014
TCEC Season 6	Dec 2, 2014
TCEC Season 7	Jan 23, 2015
TCEC Season 8	Nov 30, 2015
TCEC Season 9	Nov 6, 2017
Thread	Apr 22, 2018
Time Management	Mar 20, 2018
WCCC 2015	Jun 13, 2017
WCCC 2016	Sep 18, 2017
WCCC 2017	Dec 31, 2017
WCRCC 2015	Jul 19, 2015
WCRCC 2016	Jun 27, 2017
WCRCC 2017	Jun 27, 2017
WCSC 2015	Jun 13, 2017
WCSC 2016	Sep 18, 2017
WCSC 2017	Jul 4, 2017
Who's Who	Sep 6, 2017
World Chess Software Championship	Mar 6, 2018
World Computer Chess Championship	Mar 6, 2018
Wrong color Bishop and rook pawn	Oct 19, 2017
x86-64	Mar 6, 2018
Zappa	Oct 24, 2017

Up one Level

Nimzo

GerdIsenberg — Sat, 30 Dec 2017 17:58:09 GMT

Home * Engines * Nimzo

		Nimzo, a chess program by primary developer Chrilly Donninger, subsequently supported by members of the First Vienna Computer Chess Club (Nimzo Werkstatt) concerning testing, chess knowledge, opening book and hardware. The program was first dubbed Nimzo-Guernica in remembrance to Aron Nimzowitsch and as manifest of Chrilly's Anti-war engagement ^[1]. It had its tournament debut at the 3rd Computer Olympiad 1991 and further played the DOCCC 1991 and IPCCC 1991. At the WMCCC 1993, Nimzo-Guernica aka Nimzo-2 upset Mephisto Gideon ^[2] and later winner Hiarcs to lead the pack after five rounds, and finished strong fourth despite 1.5 points out of the last four rounds.
Aron Nimzowitsch ^[3]

Forward Pruning in Nimzo 2.2.1

Photos

David Bronstein playing Nimzo by Chrilly Donninger, Johan de Koning kibitzing, Aegon 1997 ^[4]

Nimzo-3

Guernica and Nimzo-2 were leaf evaluators to spent 60 to 70 percent of its time in evaluation. The main design criterion for Nimzo-3 was combining the positional play of Nimzo-2 with the tactical strength of a program like Fritz. Nimzo-3 therefor became a Genius/Fritz like program with a complex root evaluation ^[5], called Oracle as proposed by Hans Berliner ^[6] ^[7], and which seems to have been first used by Kaare Danielsen. The oracle approach with very simple, mainly first-order evaluation terms at the leaves, made Nimzo-3 to spent about only 10 to 20 percent on leaf evaluation, yielding in an increased node rate of 400%.

CHE

The CHE and CHE++ declarative language for expressing chess knowledge using a GUI was used to incorporate planning features within the oracle used ^[8].

Commerce

During the WMCCC 1996, Nimzo was still amateur, but soon went commercial as MS-DOS program Nimzo 3.5 and the Windows program Nimzo 2000 distributed by Weiner's Millennium 2000 GmbH, later released as Chess Engine Communication Protocol compliant engine WBNimzo. Nimzo98, Nimzo99 were native ChessBase engines, followed by Nimzo 7.32 and Nimzo 8 and its derivation Schweinehund ^[9] ^[10].

Description

given in 1999 from the ICGA tournament site ^[11]:

Nimzo is one of the leading professional chess programs. It combines sound positional play with extremely strong tactics. Nimzo-Paderborn is a considerable improved version of the currently commercially available programs Nimzo98, Nimzo99 and Nimzo2000. Nimzo-Paderborn learns automatically from human grandmaster games. It is also equipped with an own Chess-Advice-Language (Che++) which allows strong human players to formulate chess-knowledge. The program can also access in its search endgame databases. It therefore searches regularly from the middlegame into won endgames.

Forward Pruning in Nimzo 2.2.1

Following forward pruning code appears in Nimzo's 2.2.1 search routine ^[12] applied at frontier nodes, notably the aggressive Lang mode at pre-pre-frontier nodes or below. The source was published along with a foreword by Donninger in 2002 ^[13] :

  if((depth <= 1) && (!extflg) && (score > beta) && (GPtr->hung.w <= KNIGHTHUNG)) {
    return score;
  }
 
  if(LangModus) {
    if((depth <= 3) && (!extflg) && (score > beta) && (GPtr->hung.w == 0)) {
      return score;
    }
  }

Publications

Chrilly Donninger (1992). The Relation of Mobility, Strategy and the Mean Dead Rabbit in Chess. Heuristic Programming in Artificial Intelligence 3: the third computer olympiad (eds. Jaap van den Herik and Victor Allis), pp. 102-111. Ellis Horwood Ltd., Chichester, UK. ISBN 0-13-388265-9
Chrilly Donninger (1993). Null Move and Deep Search: Selective-Search Heuristics for Obtuse Chess Programs. ICCA Journal, Vol. 16, No. 3
Thomas Mally (1993). PC Power in Braille - Nimzo Guernica: Ein PC-Schachprogramm für Blinde. PC Schach 3/93 (German) ^[14]
Chrilly Donninger (1996). CHE: A Graphical Language for Expressing Chess Knowledge. ICCA Journal, Vol. 19, No. 4

Forum Posts

NIMZO 3 ist out now! by Tom Kerrigan, rgcc, July 15, 1996
Re: NIMZO 3 ist out now! by Peter Schreiner, rgcc, July 19, 1996
Re: Nimzo3 - playing strength? by Helmut Weigel, rgcc, August 04, 1996
NIMZO 3 ! by Komputer Korner, rgcc, December 01, 1996
Re: computer chess "oracle" ideas... by Andreas Mader, reply to Ronald de Man, rgcc, April 7, 1997
Re: Any word on future Nimzo plans by Andreas Mader, rgcc, March 22, 1998
Nimzo 8 and piece values by Matthew Barnett, CCC, January 05, 2001
Nimzo Engines of Millenium Chess System by Norbert Raimund Leisner, CCC, June 08, 2016

External Links

References

^ Bombing of Guernica from Wikiepedia
^ With the help of a sign bug in passed pawn evaluation, see Chrilly Donninger (1999). Computer machen keine Fehler. CSS 2/99, pdf (German)
^ Aron Nimzowitsch from Wikipedia
^ David Bronstein vs. Nimzo, Photo by Thorsten Czub from Aegon 1996-97
^ Chrilly Donninger (1996). CHE: A Graphical Language for Expressing Chess Knowledge. ICCA Journal, Vol. 19, No. 4
^ Hans Berliner (1987). Some Innovations Introduced by Hitech. ICCA Journal, Vol. 10, No. 3
^ Hans Berliner (1989). Some Innovations Introduced by Hitech. Advances in Computer Chess 5
^ CHE docs in English / Nimzo 3 version by Mike S., CCC, November 22, 2001
^ Re: Versions of Nimzo by Shep, CCC, December 12, 2000
^ Re: Nimzo 4 by Manfred Meiler, CCC, November 19, 2002
^ Nimzo's ICGA Tournaments
^ Nimzo: sr.c: search-tree handling hosted by Roger Thormann
^ Vorwort von Chrilly Donninger (German) hosted by Roger Thormann
^ Braille from Wikipedia

What links here?

Page	Date Edited
3rd Computer Olympiad	Jul 25, 2017
Aegon 1992	Jan 22, 2017
Aegon 1993	Mar 26, 2017
Aegon 1994	Mar 26, 2017
Aegon 1996	Jan 22, 2017
Aegon 1997	Apr 7, 2017
Andreas Mader	Dec 30, 2017
Bernhard Biberle	May 30, 2014
Bernie	Oct 31, 2015
CCT1	Dec 30, 2012
CCT2	Sep 7, 2012
Chrilly Donninger	Dec 19, 2016
Clever & Smart	Jan 20, 2017
David Bronstein	Oct 28, 2014
DOCCC 1991	Aug 15, 2015
DOCCC 1997	Aug 15, 2015
DOCCC 1998	Feb 25, 2018
DOCCC 1999	Aug 15, 2015
DOCCC 2000	Aug 15, 2015
Dutch Open Computer Chess Championship	Sep 25, 2014
Eigenmann Endgame Test	Jun 1, 2017
Engines	Mar 10, 2018
Greif	May 17, 2016
Helmut Weigel	Dec 2, 2017
Hydra 97	Jan 1, 2017
IPCCC	Jan 20, 2017
IPCCC 1991	Jun 9, 2016
IPCCC 1992	Jan 2, 2015
IPCCC 1993	Nov 1, 2016
IPCCC 1998	Feb 25, 2018
IPCCC 1999	Dec 21, 2012
IPCCC 2000	Dec 21, 2012
IPCCC 2001	Jan 9, 2014
Michael Ehrig	May 17, 2016
MILLENNIUM 2000 GmbH	Jul 13, 2017
Millennium Chess System	Jul 12, 2017
Minimax (program)	Dec 27, 2013
Nimzo	Dec 30, 2017
Oracle	Sep 4, 2016
PC Schach	Dec 30, 2017
Piece-Square Tables	Mar 31, 2018
Prochess	Jan 7, 2016
Pruning	Jan 1, 2018
Schweinehund	May 15, 2014
Stalemate	Feb 21, 2018
Terra	Feb 11, 2015
Thomas Mally	Dec 30, 2017
WCCC 1992	Feb 26, 2018
WCCC 1999	Jul 13, 2017
WCCC 2016	Sep 18, 2017
WMCCC 1993	Dec 30, 2017
WMCCC 1995	Jan 3, 2018
WMCCC 1996	Sep 15, 2016
WMCCC 2000	Feb 27, 2018
Wolfgang Zugrav	Jul 13, 2016

Up one Level

Patzer

GerdIsenberg — Wed, 05 Apr 2017 19:51:18 GMT

Home * Engines * Patzer

Patzer,
a Chess Engine Communication Protocol compatible chess engine by Roland Pfister, later versions were UCI compliant, featuring a parallel search and own endgame bitbases, and were able to play Chess960 ^[1]. Patzer is famous for solving the Behting Study ^[2] and a special draw heuristic for checking sequences. Patzer was available as Young Talent by ChessBase running under the Fritz6 GUI ^[3].

Tournament Play

Patzer played the WMCCC 1996 in Jakarta, the WMCCC 1997 in Paris, the WCCC 1999 in Paderborn, and the Chess960CWC 2005 and Chess960CWC 2006 in Mainz. Further, Patzer was active over the board at IPCCCs, the 5th Spanish Open Computer Chess Championship, Dutch Open Computer Chess Championships, International CSVN Tournaments, and the BELCT 2001.

Descriptions

^[4]

1997

Patzer uses state of the art methods as minimal window, hash tables, history table, static exchange evaluation with bitboards, various extensions, recursive nullmove . It has small databases for KPK and KPKP with blocked pawns to decide if it is a win or not. Additionally it can use Thompson's Endgame CDs at ply 0.

At the moment I am working on including endgame table base support. Patzer has a text interface a well as GUIs for DOS, Windows, OS/2 and X11. It can read/write PGN and EPD files. It has an Interface for Autoplayer232 and for XBoard/WinBoard. It has knowledge of the "wrong" bishop in endgames. A Hypertext User Online Manual is available in German for DOS, Windows, OS/2 and Unix.

1999

Patzer uses the standard alpha-beta PVS search, enhanced by hashtables (4 retries replacement scheme), recursive nullmove (R=2) with verification if only one piece present, special pruning heuristic for ALL-nodes, various extensions. It also uses a special material hash table to adjust the material balance values for certain endgames where the "usual" values do not apply. It values king safety and passed pawns rather high (too high?). It is a incremental bitboard program with attack tables that are also used during move generation and sorting.

Photos

Patzer team Frank Quisinsky and Roland Pfister at ICT 2001 ^[5]

Namesake

Patzer by Werner Koch and Thomas Schäfer

Forum Posts

1998 ...

Yes, Patzer really seem to be quite something... by Fernando Villegas, CCC, June 07, 1998
Diepeveen Attack ! by Frank Quisinsky, Winboard Forum, November 11, 1999

2000 ...

Patzer by Ingo Bauer, CCC, April 23, 2001
Re: 1 Hour CCR Test by IM Larry Kaufmann / Patzer 3.51 by Roland Pfister, CCC, May 11, 2001 » CCR One Hour Test
Goliath Light, Gromit, Patzer, SOS, etc. commercially sold by Theo van der Storm, CCC, August 28, 2001
Is there a Tournament book for Patzer? by Günther Simonr, Winboard Forum, December 05, 2001
Patzer 3.61 UCI vs 3.11 CB = 23 - 15 by Brice Boissel, Winboard Forum, April 08, 2003
Patzer_299zt by Telmo Escobar, Winboard Forum, October 18, 2003
Any programs besides Yace and Patzer that can use bitbase files by Dann Corbit, CCC, June 17, 2004 » Endgame Bitbases, Yace

2010 ...

STS [1-10] Patzer 3.80 by Swaminathan, CCC, July 06, 2010 » Strategic Test Suite

External Links

Chess Engine

Misc

References

^ Patzer 3.80, Wayback Machine
^ Meet the Authors - PATZER, Roland Pfister hosted by Ed Schröder
^ Support - ChessBase, May 28th, 2000 (dead link)
^ Patzer's ICGA Tournaments
^ 1st International CSVN-Tournament 2001 by Thomas Mayer, ICT 2001

What links here?

Page	Date Edited
BELCT 2001	Apr 4, 2017
CCT3	Feb 14, 2013
Chess960CWC 2005	Jan 1, 2016
Chess960CWC 2006	Sep 25, 2014
ChessBase	Nov 25, 2017
DOCCC 1998	Feb 25, 2018
DOCCC 1999	Aug 15, 2015
DOCCC 2000	Aug 15, 2015
Eigenmann Endgame Test	Jun 1, 2017
Endgame Bitbases	Apr 5, 2017
Engines	Mar 10, 2018
Frank Quisinsky	May 3, 2017
ICT 2001	Oct 14, 2015
ICT 2002	Nov 19, 2016
IPCCC 1997	Aug 24, 2013
IPCCC 1998	Feb 25, 2018
IPCCC 1999	Dec 21, 2012
IPCCC 2000	Dec 21, 2012
IPCCC 2001	Jan 9, 2014
IPCCC 2002	May 31, 2014
IPCCC 2003	Aug 17, 2016
IPCCC 2004	Dec 1, 2014
IPCCC 2005	Aug 21, 2015
Patzer	Apr 5, 2017
Patzer (K)	Jul 18, 2012
Roland Pfister	Apr 5, 2017
SCCC 1998	Dec 15, 2017
WCCC 1999	Jul 13, 2017
WMCCC 1996	Sep 15, 2016
WMCCC 1997	Apr 4, 2017
Yace	Dec 31, 2017

Up one Level

Phalanx

GerdIsenberg — Mon, 02 May 2016 07:52:21 GMT

Home * Engines * Phalanx

		Phalanx, an open source chess engine, originally released by a Czech student Dušan Dobeš under GPL, also available as Young Talent by ChessBase running under the Fritz6 GUI. In about 2000 the project has been abandoned ^[1] , but it was resurrected in 2006 by José de Paula Rodrigues ^[2] ^[3]. In October 2014, after fourteen years and nine months, Phalanx XXIII was released by Dušan Dobeš ^[4].
Phalanx formation ^[5]

Description

Phalanx's board is represented by a 10x12 mailbox with piece-lists. The search uses PVS with transposition table inside an iterative deepening centiply framework for fractional extensions and reductions without aspiration windows, performing state of the art null move pruning, late move reductions and futility pruning near the tips. Phalanx pioneered in tapered eval and speculatively computes both endgame and middlegame scores to balance them by total material. This prevents evaluation discontinuity when searching a position on the edge of middlegame and endgame. The static evaluation first extracts knowledge and prepares a color flipped board, and applies that knowledge in a second pass using the flipped board to do stuff for both sides with the same color independent code.

Quotes

by Dušan Dobeš from rgcc, July 16, 1998 ^[6] :

Phalanx is my hobby project. It started in March 1997. It's developed under Linux and GCC, I also prepared binary distribution for Win32 with latter versions. Licensing policy is GPL (free and in sources). Interface is xboard/winboard/RoboFICS compatible. It plays on FICS as 'pikozrout', it's current blitz rating is 2380, standard 2210.

Forum Posts

1997 ...

Phalanx III - chess playing program for Linux by Dušan Dobeš, rgcc, July 08, 1997
Phalanx ? by Dušan Dobeš, rgcc, July 16, 1998

2000 ...

Phalanx is dead? by Tord Romstad, rgcc, March 27, 2002
Phalanx XXII - Reborn by José de Paula Rodrigues, rgcc, January 19, 2006

2010 ...

Phalanx source code by Carlos Pesce, CCC, February 09, 2012
New Phalanx code by Steven Atkinson, CCC, April 26, 2014
Phalanx XXIII by Dušan Dobeš, CCC, October 20, 2014
Phalanx XXIV by Dušan Dobeš, CCC, December 24, 2014
Phalanx XXV by Dušan Dobeš, CCC, May 01, 2016

External Links

Chess Engine

Misc

phalanx - Wiktionary
Phalanx disambiguation page from Wikipedia
Phalanx formation from Wikipedia
New Phalanx Formation Live feat. Epaminondas Ladas, YouTube Video

References

^ Phalanx is dead? by Tord Romstad, rgcc, March 27, 2002
^ Phalanx XXII - Reborn by José de Paula Rodrigues, rgcc, January 19, 2006
^ José de Paula from SourceForge.net
^ Phalanx XXIII by Dušan Dobeš, CCC, October 20, 2014
^ An EDSITEment-reconstructed Greek phalanx based on sources from The Perseus Project, Phalanx formation from Wikipedia
^ Phalanx ? by Dušan Dobeš, rgcc, July 16, 1998

What links here?

Page	Date Edited
ChessBase	Nov 25, 2017
Duo Trio Quart (Bitboards)	Aug 18, 2017
Dušan Dobeš	Oct 25, 2014
Eigenmann Endgame Test	Jun 1, 2017
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Evaluation Patterns	Jun 24, 2013
Pascal Georges	Jun 1, 2014
Pepito	Nov 27, 2014
Phalanx	May 2, 2016
Quantifying Evaluation features	Jun 6, 2012
Scid vs. PC	Jan 21, 2018
Steven Atkinson	May 30, 2014
Tapered Eval	Jan 9, 2018

Up one Level

Rybka

GerdIsenberg — Tue, 28 Mar 2017 06:50:34 GMT

Home * Engines * Rybka

		Rybka, a chess engine by primary author Vasik Rajlich, since 2007 dominating and reigning World Computer Chess Champion and holder of the Shannon Trophy, winning the WCCC 2007 ^[1] , WCCC 2008, WCCC 2009 and WCCC 2010, but in June 2011 disqualified by the ICGA from all previous and future World Computer Chess Championships ^[2] . Rybka further won various IPCCC, Dutch Open Computer Chess Championships, International CSVN Tournaments and on-line tournaments such as CCT Tournaments and ACCA Americas' Computer Chess Championships. Rybka is a standalone chess engine supporting the UCI protocol.
Rybka 4 Logo ^[3]

Pre-Beta Rybka and Crafty

Screenshots



ChessBase GUI, 3D boards with scoresheet and analysis board ^[4]

Deep Rybka 4 Aquarium by ChessOK ^[5]

Team

The Rybka team consists of primary author and International Master Vasik Rajlich, supported by Grandmaster and evaluation expert Larry Kaufman (Rybka 3), Rybka's main tester and Women's GM (WGM) and IM Iweta Rajlich, the opening book authors Jeroen Noomen, Dagh Nielsen, Jiří Dufek and Nick Carlin, as well as Rybka primary tournament operator Hans van der Zijden, hardware expert Lukas Cimiotti and Webmaster and Webdesigner Felix and Christoph Kling ^[6] .

Versions

Vasik Rajlich started developing Rybka in about 2003, and worked full-time on it since 2005. The appearance of the free Rybka 1 beta ^[7] ^[8] ^[9] and the first commercial version, Rybka 1 ^[10] end of 2005 was a sensation, and Rybka soon became the dominating program leading rating lists by a huge margin ^[11] ^[12] . Rybka 3 was developed in collaboration with Larry Kaufman, the most recent and strongest version Rybka 4 and the parallel version Deep Rybka 4 appeared in April 2010, market as standalone chess engine from RybkaChess.com ^[13] , from ChessOK optional with the Aquarium GUI ^[14] , or from ChessBase packaged with the Fritz GUI ^[15] . The demo version Rybka 2.3.2a can be downloaded for free ^[16] .

Achievements

^[17]

Year	Tournament	Rank/From	Title/Remarks
2004	CCT6	50/54
2005	IPCCC 2005 b	1/12
2006	CCT8	1/38
	ICT 2006	1
	WCCC 2006	3/18	as Rajlich, disqualified 2011
	DOCCC 2006	1
	IPCCC 2006	1/10
2007	ACCA 2007	1/16
	CCT9	1/54
	ICT 2007	1
	WCCC 2007	1/12	World Computer Chess Champion, disqualified 2011
	DOCCC 2007	1/14
	IPCCC 2007	2/10
2008	ACCA 2008	1/18
	ICT 2008	1
	WCCC 2008	1/10	World Computer Chess Champion, disqualified 2011
	DOCCC 2008	1/10
2009	ACCA 2009	1/12
	WCCC 2009	1/10	World Computer Chess Champion, disqualified 2011
	DOCCC 2009	1/9
2010	ICT 2010	1/14
	WCCC 2010	1/10	World Computer Chess Champion, disqualified 2011
	DOCCC 2010	1/20
2012	ICT 2012	1/8

Program Internals

Rybka is a bitboard engine, first versions rotated, Rybka 4 apparently magic bitboards for sliding piece attack and move generation. Vasik once posted a snippet of Rybka source-code, a typical bitboard serialization loop to generate white knight captures ^[18] .

for (bb_t knights = Board.pieces [WN]; knights; knights &= knights-1)
{
    int knight_sq = bit_scan (knights);
    for (bb_t captures = knight_moves [knight_sq] & opponent_pieces; captures; captures &= captures - 1)
    {
        int capture_sq = bit_scan (captures);
        *moves ++ = move (knight_sq, capture_sq);
        *values++ = Board.sq [capture_sq] * 256 + 192;
    }
}

Due to the disputed open source engines Strelka 2.0 and later Ippolit, which accordant to Vasik Rajlich were both based on or heavily influenced by re-engineered Rybka executables ^[19] ^[20] , other implementation details were released to the public, such as material- and material imbalance tables, aggressive LMR, razoring ^[21] and some variation of singular extensions ^[22] . Zach Wegner elaborated on evaluation issues, and compared Rybka 1 beta with Fruit's evaluation ^[23] ^[24] , continued by former anonymous author "BB+" alias Mark Watkins in February 2011 ^[25] .

Release Dates

Rybka 1.0 beta : 2005-12
Rybka 1.0 :
Rybka 1.1 : 2006-04
Rybka 1.2 : 2006-06
Rybka 1.5 :
Rybka 1.6.1 :
Rybka 2.0 :
Rybka 2.2 : 2006
Rybka 2.2n2 : 2006-12
Rybka 2.3 : 2007-01
Rybka 2.3.1 : 2007-02
Rybka 2.3.2a : 2007-06
Rybka 3 : 2008-08
Rybka 4 : 2010-05
Rybka 4.1 : 2011-3

Controversies

Rybka 1.0 and Fruit

Rajlich's interpretation of nodes and depth ^[26] ^[27] ^[28] ^[29] ^[30] , and the controversy about Strelka ^[31] ^[32] raised suspicions about the initial origin of Rybka 1.0 ^[33] ^[34] , but Vasik Rajlich categorically denied Rybka 1.0 was based on Fruit ^[35] ^[36] , as mentioned by Chrilly Donninger in 2005 ^[37] after early rumors ^[38] and questions ^[39] arose.

Vasik Rajlich's most quoted statement in these discussions was probably from an interview in uciengines.de, December 20, 2005 ^[40] :

Yes, the publication of Fruit 2.1 was huge. Look at how many engines took a massive jump in its wake: Rybka, Hiarcs, Fritz, Zappa, Spike, List, and so on. I went through the Fruit 2.1 source code forwards and backwards and took many things.
...
Anyway, if I really had to give a number - my wild guess is that Rybka would be 20 rating points weaker had Fruit not appeared.

Ippolit

The appearance of the Ippolit open source program by pseudonymous authors in May 2009, and Rajlich's claim it is a clone of Rybka 3 ^[41] without any substantiation and evidence, caused further discussions ^[42] .

Open Letters

In January 2011, Fabien Letouzey confirmed that Strelka, the allegedly clone of Rybka, was not a verbatim copy of the source code from Fruit, but a bitboard re-write of Fruit with some other ideas, and not just an extraction of a couple of ideas ^[43] ^[44] ^[45] .

On February 19, 2011 ICGA president David Levy broached on cloning issues in a ChessVibes column ^[46] . In March 2011, following computer chess programmers signed an open letter to David Levy, Jaap van den Herik and the board of the ICGA, to support the claim Rybka 1.0 beta and subsequent versions were allegedly derivatives from Fabien Letouzey’s program Fruit 2.1:

The letter was published in the private ICGA Investigations Wiki ^[49] and elsewhere ^[50] ^[51] ^[52] . The German sites Heise online ^[53] and Spiegel Online broached the issue ^[54] .

Pre-Beta Rybka and Crafty

In February and March 2011, evidence was found by Zach Wegner and Mark Watkins that pre-Beta Rybka, which played the CCT6 in January 2004, and competed in tournaments of Engine Rating Lists such as ChessWar ^[55] ^[56] and Le Fou numérique ^[57] , contain a substantial amount of Crafty code ^[58] , confirmed by Robert Hyatt ^[59] ^[60] . Beside other evidence there are the known bugs in the old Crafty code (if ms == 99999) ^[61] that caused El Chinito by primary author Eugenio Castillo Jiménez to be exposed as a clone ^[62] ^[63] .

Disqualification

In June 2011, the ICGA has disqualified and banned Rybka and its programmer Vasik Rajlich from previous and future World Computer Chess Championships. The ICGA accuses Rajlich of plagiarizing two other programs, Crafty and Fruit, and demands that he returns the trophies and prize money of the World Computer Chess Championships in 2007, 2008, 2009 and 2010 ^[64] .

In August 2011, the board of the Dutch Computer Chess Federation (CSVN) declared the most serious doubts as to the rightfulness of ICGA's decision. Therefore, they have chosen not to abide by their sanctions against Rybka ^[65] , see ICGA Investigations

Publications

Jeroen Noomen, Jos Uiterwijk, Jaap van den Herik (2007). The 15th World Computer Chess Championship. ICGA Journal, Vol. 30, No. 2 » WCCC 2007
Matej Guid, Ivan Bratko (2007). Factors affecting diminishing returns for searching deeper. CGW 2007 » Crafty, Rybka, Shredder, Diminishing Returns
Matej Guid, Ivan Bratko (2007). Factors affecting diminishing returns for searching deeper. ICGA Journal, Vol. 30, No. 2, pdf
Hans Secelle. Eric van Reem (2007). Golden Summer for RYBKA. ICGA Journal, Vol. 30, No. 3
Mark Watkins (2010). A comparison of Rybka and IPPOLIT. pdf ^[66] » Ippolit
Mark Watkins (2011). A comparison of Rybka 1.0 Beta and Fruit 2.1, pdf, February 12, 2011 Version ^[67]
Mark Watkins (2011). A comparison of Rybka 1.0 Beta and Fruit 2.1, pdf, February 24, 2011 Version
Mark Watkins (2011). A comparison of Rybka 1.0 Beta and Fruit 2.1, pdf, March 11, 2011 Version » Fruit
Anthony Cozzie (2011). The Future of Computer Chess. Selective Search 154, pp. 11, pdf hosted by Mike Watters
Jaap van den Herik, Krzysztof Siewicz (2011). Open Source has a Price. ICGA Journal, Vol. 34, No. 2
David Levy (2011). Rybka Disqualified and Banned from World Computer Chess Championships.ICGA Journal, Vol. 34, No. 2
David Levy (2011). A Very Sad Case. ICGA Journal, Vol. 34, No. 2
Mark Lefler, Robert Hyatt, Harvey Williamson, ICGA panel (2011). Rybka Investigations and Survey of Findings for the ICGA. ICGA Journal, Vol. 34, No. 2
Eric Hallsworth (2011). Rybka disqualified and banned by ICGA from World Computer Chess Championships, Lifetime Ban for Vasik Rajlich. Selective Search 155, pp. 8, pdf hosted by Mike Watters
Mark Watkins (2011). Review of the Rybka case. pdf from OpenChess Forum ^[68]
Søren Riis (2012). A Gross Miscarriage of Justice in Computer Chess. pdf hosted by ChessBase
Arno Nickel (2012). Die schöne neue Welt der Schachengines. SCHACH 2,3,5,6 2012, pdf (German) ^[69]
Ed Schröder (2012). Rybka reloaded. pdf
Matej Guid, Ivan Bratko (2012). Detecting Fortresses in Chess. Elektrotehniški vestnik, Vol. 79, Nos. 1-2, pdf » Houdini
Mark Watkins (2013). Review of the Rybka case. pdf
Søren Riis (2014). What makes a chess program original? Revisiting the Rybka case. Entertainment Computing, Vol. 5, No. 3
Don Dailey, Adam Hair, Mark Watkins (2014). Move Similarity Analysis in Chess Programs. Entertainment Computing, Vol. 5, No. 3, preprint as pdf ^[70]
David Levy (2014). The RYBKA Case – Progress and Verdict. ICGA Journal, Vol. 37, No. 4 » Rybka Controversy

Forum Posts

2004

Re: CCT6: Rybka /Bodo ??? by Vasik Rajlich, CCC, January 27, 2004

2005

Rybka 1.0 beta release - need testers by Vasik Rajlich, CCC, November 30, 2005
Rybka 1.0 Announcement by Vasik Rajlich, CCC, December 05, 2005
Is Rybbka a fruit clone? by Ziad Haddad, CCC, December 06, 2005
Rybka - How much Fruit is inside? by Daniel Mehrmann, CCC, December 11, 2005
Rybka test position by K. Burcham, CCC, December 11, 2005 » Ktulu
Rybka uses PVS and not MTD(f). Its no Fruit-Clone by Chrilly Donninger, CCC, December 12, 2005
The Code for the Rybka-Mate-Bug by Chrilly Donninger, CCC, December 13, 2005
Unmasking the Secrets of Rybka and Fruit by Stuart Cracraft, CCC, December 15, 2005
Secrets of Rybka and Fruit from my point of view by Sergei S. Markoff, CCC, December 15, 2005
Spike-Rybka by Vasik Rajlich, CCC, December 28, 2005 » IPCCC 2005 b
The man behind Rybka and his thoughts as posted here on CCC by Mike Byrne, CCC, December 31, 2005

2006

Rybka and Fruit on Chessbase by Walter Faxon, CCC, January 14, 2006 » Fruit, ChessBase
The superior Rybka chess knowledge by Chrilly Donninger, CCC, January 18, 2006
Rybka's NPS - one presumption by Vladan Vučković, CCC, February 16, 2006 » Nodes per second
Rybka @ CCT8 by Vasik Rajlich, CCC, February 26, 2006

2007

outlook and plans for Rybka 3 by Vasik Rajlich, Rybka Forum, January 09, 2007
Rybka 2.3 release date now Monday February 12 by Vasik Rajlich, Rybka Forum, February 04, 2007
Rybka 2.3 readme by Vasik Rajlich, Rybka Forum, February 13, 2007
Rybka @ Leiden ICT7 by Vasik Rajlich, Rybka Forum, May 20, 2007
Open Letter and $100,000 Challenge to FIDE by Vasik Rajlich, Rybka Forum, May 31, 2007
How secure is the source code of Rybka? by SR, Rybka Forum, June 05, 2007
Rybka 2.3.2a readme by Vasik Rajlich, Rybka Forum, June 18, 2007
Rybka @ Amsterdam 15th WCCC by Vasik Rajlich, Rybka Forum, June 19, 2007
Strelka = Rybka 1.0 by DarkAvenger, Rybka Forum, July 07, 2007 » Strelka
What Strelka tells about Rybka's nodecount and depth by Ernest Bonnem, CCC, July 09, 2007
Longer comments by V. Rajlich by Marc Lacrosse, CCC, July 10, 2007
Re: Is Rybka a derivative of Fruit? by Vasik Rajlich, Rybka Forum, July 14, 2007
Fruit, Rybka, Strelka final conclusion! (I hope) by Michael Sherwin, CCC, July 13, 2007
Rybka vs Zappa in Mexico City by Vasik Rajlich, Rybka Forum, September 28, 2007
Rybka @ Leiden 27th Dutch CCC by Vasik Rajlich, Rybka Forum, October 29, 2007

2008

Strelka 2.0 by Vasik Rajlich, Rybka Forum, January 11, 2008 » Strelka
Re: Strelka 2.0 pg 4 by Anthony Cozzie, Rybka Forum, January 11, 2008
Rajlich/Osipov/Rybka/Strelka/Answers by Convekta by Eduard Nemeth, CCC, January 17, 2008 » Strelka, Convekta
Anthony Cozzie speak ! by Silvian, Rybka Forum, February 03, 2008 ^[71]
Rybka 3 with new GUI: are they serious?! by Jouni Uski, CCC, April 05, 2008 » Aquarium
Retry: Rybka 1.0 Beta Node Count Patch by Rick Fadden, CCC, April 19, 2008
Strelka Reverse Engineered from Rybka: Details Examined by Rick Fadden, CCC, May 01, 2008
Rybka @ Leiden 8th ICT by Vasik Rajlich, Rybka Forum, June 01, 2008
Rybka 3 -- a hundred elo! by Larry Kaufman, Rybka Forum, July 08, 2008
Rybka 3 - some info by Vasik Rajlich, Rybka Forum, July 19, 2008
Rybka 3: The dark truth behind the hype by Albert Silver, CCC, July 25, 2008
Rybka 3 Release Notes by Vasik Rajlich, Rybka Forum, August 04, 2008
Rybka 3 FAQ by Vasik Rajlich, Rybka Forum, August 05, 2008
Rybka v2.2n2 download by Vasik Rajlich, Rybka Forum, August 06, 2008
Rybka 1.0 vs. Strelka by Zach Wegner, CCC, August 19, 2008
Questions for Vas by Zach Wegner, CCC, August 25, 2008
A very simple question to Vas that can end it all by Christophe Théron, CCC, August 25, 2008
Rybka questions and answers by Chris Whittington, CCC, August 25, 2008
question to vas on similarity of rybka 1.0 to fruit by duncan, Rybka Forum, August 25, 2008
split 3 from Zach technical thread by Christophe Théron, CCC, August 27, 2008
My two cents by Anthony Cozzie, CCC, August 27, 2008
To campaign or not by Ed Schroder, CCC, August 28, 2008
How a court detects a derivative work by Christophe Théron, CCC, August 30, 2008
Is It Me or is the Source Comparison Page Rigged? by RegicideX, CCC, September 01, 2008 ^[72] ^[73]
Plagiarism and Rybka by Enrique Irazoqui, CCC, September 03, 2008
Rybka @ 16th WCCC in Beijing by Vasik Rajlich, Rybka Forum, October 04, 2008
Strelka = Rybka 1.0 =Fruit 2.1 = Toga?? Oh how disappointing by Oliver Brausch, CCC, October 21, 2008
Rybka @ 28th Dutch CCC by Vasik Rajlich, Rybka Forum, November 18, 2008

2009

Rybka @ Pamplona 17th ICGA World Computer Chess Championship by Vasik Rajlich from Rybka Forum, May 17, 2009 » WCCC 2009
Rybka @ 29th Open Dutch Computer Chess Championship by Vasik Rajlich, Rybka Forum, October 19, 2009 » DOCCC 2009
Official statement on [Deleted]? by Vasik Rajlich, Rybka Forum, October 21, 2009

2010

Rybka 4 update by Vasik Rajlich, Rybka Forum, April 11, 2010
Rybka 4 is final. (select games for fun) by Albert Silver, CCC, May 25, 2010
Rybka 4 Release Notes by Vasik Rajlich, Rybka Forum, May 26, 2010
ICT Leiden 2010: Rybka wins with 8/9. Opening report by Jeroen Noomen, Rybka Forum, May 30, 2010 » ICT 2010
Rybka @ 10th ICT Leiden 2010 by Vasik Rajlich, Rybka Forum, May 31, 2010 » ICT 2010
BB's Rybka/Ippolit comparison by Zach Wegner, OpenChess Forum, June 13, 2010
Deep Blue vs Rybka by Don Dailey, CCC, September 13, 2010
Kanazawa Diary (Rybka operator in Japan) by Hans van der Zijden, Rybka Forum, September 24, 2010 » WCCC 2010
WCCC 2010 in Kanzawa, Japan by Vasik Rajlich, Rybka Forum, October 2, 2010 » WCCC 2010
Rybka @ 30th Dutch Computer Chess Championship by Vasik Rajlich, Rybka Forum, November 16, 2010 » DOCCC 2010
Brief Q&A about Rybka 1.0 Beta and Fruit 2.1 by BB+, OpenChess Forum, December 14, 2010
Rybka Cluster Rental Program by Vasik Rajlich, Rybka Forum, December 30, 2010

2011

Node counting by BB+, OpenChess Forum, January 20, 2011 » Node
Fabien's open letter to the community by Tord Romstad, CCC, January 23, 2011
Fabien's open letter to the community by Tord Romstad, OpenChess Forum, January 23, 2011
Revisiting Strelka/Rybka by BB+, OpenChess Forum, January 25, 2011
Feb 12 version: Rybka 1.0 Beta / Fruit 2.1 document by BB+, OpenChess Forum, February 12, 2011
Attack of the clones | ChessVibes by David Levy, 19 February, 2011
Programmers write open letter about Rybka-Fruit issue | ChessVibes by Peter Doggers, March 01, 2011
Open letter to the ICGA about the Rybka-Fruit issue by Harvey Williamson, Hiarcs Forum, March 01, 2011
Programmers Open Letter to ICGA on Rybka/Fruit by BB+, OpenChess Forum, March 01, 2011
Rybka 1.6.1 by Robert Hyatt, Rybka Forum, March 13, 2011
Longer Article by Anthony Cozzie, CCC, March 17, 2011
History of eval changes in Rybka versions byBB+, OpenChess Forum, March 23, 2011
Rybka disqualified and banned from World Computer Chess Cham by Tim Chan, CCC, June 29, 2011
Rybka disqualified and banned from World Computer Chess Cham by TheHug, Rybka Forum, June 29, 2011
Rybka disqualified and banned from WCCC by Harvey Williamson, Hiarcs Forum, June 29, 2011
Rybka disqualified and banned from WCCC by Jeremy Bernstein, OpenChess Forum, June 29, 2011
Rybka ban thoughts by Dann Corbit, CCC, June 29, 2011
My two cents on Rybka's disqualification by Joona Kiiski, CCC, June 30, 2011
Dismissed with prejudice by Dann Corbit, CCC, July 01, 2011
Voir Dire by Dann Corbit, CCC, July 01, 2011 ^[74]
Vas say something by siam, Rybka Forum, July 01, 2011
The ICGA Process by BB+, OpenChess Forum, July 01, 2011
Progess (often) is ugly, a summary try by Rebel, OpenChess Forum, July 03, 2011
Is Rybka that needs ICGA or the opposite ? by Marco Costalba, CCC, July 03, 2011
The Intellectual Property Oxymoron by Gary Belton, CCC, July 03, 2011
The Evidence against Rybka by BB+, OpenChess Forum, July 04, 2011
Why did the ICGA ignore this advice? by John Sidles, Rybka Forum, July 06, 2011
Minority Report Plagiarism - Quantifying Evaluation Features by Trotsky, Rybka Forum, July 09, 2011
Back to R3/IPPOLIT(/R4?) by BB+, OpenChess Forum, July 14, 2011
In retrospect by Rebel, Rybka Forum, July 14, 2011
Minority Report 2 - Unravelling the technical report by Trotsky, Rybka Forum, July 22, 2011
Minority Report 3, PST + other lookup tables are they legal? by Trotsky, Rybka Forum, July 25, 2011
Thoughts on Fruit=Rybka EVAL by Rebel, OpenChess Forum, August 16, 2011
Apology to Vas by Rebel, Rybka Forum, August 17, 2011

2012

Rybka evidence recapitulation by BB+, OpenChess Forum, January 03, 2012
A Big Thanks and a Small Update by Vasik Rajlich, Rybka Forum, January 08, 2012
Fruit/Rybka timeline by BB+, OpenChess Forum, January 09, 2012
Rybka 1.0 source code by Ed Schröder, CCC, January 31, 2012 ^[75]

External Links

Rybka

Rybka from Wikipedia
Rybka (disambiguation) from Wikipedia
Rybka's ICGA Tournaments
Welcome to RybkaChess.com!
Rybka Chess Community Forum
Rybka Cluster - for the elite chess player
Interview with Vasik Rajlich by Christopher Conkie, Michael Diosi, Frank Quisinsky & Alexander Schmidt, December 20, 2005, hosted by Ed Schröder
ChessAssistance.com Rybka Review by Robert Pawlak, September 23, 2006
Interview with IM Vasik Rajlich, author of Rybka chess program Written by content team 24 July 2007 from LatestChess.com
Rybka Explained? by John L. Jerz
Does Rybka Properly Count Positions Evaluated? by John L. Jerz
The chess program Rybka as a Rational Agent by John L. Jerz
Rybka 3.0 – Not just the strongest chess program in the world, July 18, 2008, ChessBase News
Anthony Cozzie speaks about Rybka source code from Steve Lim / SuperSteve3d - Home, February 04, 2008 » Anthony Cozzie, Strelka ^[76]
Rybka's Monte Carlo analysis by Steve Lopez, ChessBase News, February 03, 2009
Rybka doch nicht unbesiegbar, Neues Deutschland, June 26, 2010 (German)

Controversy

Attack of the clones | ChessVibes by David Levy, 19 February, 2011
Schach-Software Rybka - Programmierer vermuten Intelligenzklau by Frank Patalong, Spiegel Online, March 03, 2011 (German)
Plagiatsvorwurf gegen Computerschach-Weltmeister, Heise online, March 01, 2011 (German)
Rybka disqualified and banned from World Computer Chess Championships | ChessVibes by Peter Doggers, June 29, 2011
Susan Polgar Chess Daily News and Information: Breaking News! Rybka banned!, June 29, 2011
Rybka disqualified and banned from World Computer Chess Championships - Chess Weekly
Rybka banned by International Games Federation – Rybka Ruling
Rybka, the world’s best chess engine, outlawed and disqualified | ExtremeTech by Sebastian Anthony on June 29, 2011
Computer chess champ stripped of its four titles by Claire Courchane, Washington Times, June 30, 2011
Rybka Disqualified, Banned On Plagiarism Charges | ITProPortal.com by Ravi Mandalia, June 30, 2011
Boylston Chess Club Weblog: Rybka banned from computer champs; stripped of all its titles, June 30, 2011
Computer chess reels from 'biggest sporting scandal since Ben Johnson' | Metro.co.uk by Tariq Tahir, June 30th, 2011
Schachcomputer-Weltmeister nachträglich disqualifiziert, Heise online, June 30, 2011 (German)
Weltmeisterprogramm Rybka verliert alle Titel by Frank Patalong, Spiegel Online, July 01, 2011 (German)
Developer of Computer Chess Champ Accused of Stealing Code by Dylan Loeb McClain, NYTimes.com, July 2, 2011
Geklontes Fischchen by Stefan Löffler, July 08, 2011, DiePresse.com (German)
Rybka and the ICGA, CSVN Computerschaak
Rybka vs ICGA a different view by Ed Schröder, November 09, 2011
Rybka evidence by Ed Schröder, November 09, 2011
A Gross Miscarriage of Justice in Computer Chess (part one) by Søren Riis, ChessBase News, January 02, 2012 ^[77] ^[78] ^[79]
A Gross Miscarriage of Justice in Computer Chess (part two) by Søren Riis, ChessBase News, January 03, 2012 ^[80]
A Gross Miscarriage of Justice in Computer Chess (part three) by Søren Riis, ChessBase News, January 04, 2012
A Gross Miscarriage of Justice in Computer Chess (part four) by Søren Riis, ChessBase News, January 05, 2012 ^[81]
Controversy over Rybka's disqualification and ban (UPDATE) | ChessVibes by Peter Doggers, January 08, 2012
ICGA/Rybka controversy: An interview with David Levy (1), ChessBase News, February 06, 2012
ICGA/Rybka controversy: An interview with David Levy (2), ChessBase News, February 10, 2012
ICGA/Rybka controversy: Feedback, ChessBase News, February 17, 2012

References

^ Bulletin Day 7 WCCC 2007 (ICGA Tournaments)
^
- Rybka disqualified and banned from World Computer Chess Championships | ChessVibes by Peter Doggers, June 29, 2011
^ Rybka - for the serious chess player - Purchase Rybka
^ Rybka 4 is here – and stronger than ever, ChessBase News, May 31, 2010
^ ChessOK, Chess Shop from the Developers of Rybka 3 Aquarium
^ Rybka - for the serious chess player - Rybka team
^ Rybka 1.0 beta release - need testers by Vasik Rajlich, CCC, November 30, 2005
^ Rybka Beta 1.0 - Chess.com
^ New Chess Engine - Rybka v 1.0 Beta Readme, Dec 4, 2005
^ Rybka 1.0 Announcement by Vasik Rajlich, CCC, December 05, 2005
^ The SSDF Rating List
^ CEGT Quad Versions 40/120 (AMD 3500+/4200+)
^ Rybka - for the serious chess player - Purchase Rybka
^ Rybka & Aquarium - ChessOK shop
^ Chess software - Rybka 4 from ChessBase
^ Rybka - for the serious chess player - Download Rybka 2.3.2a
^ Rybka disqualified and banned from World Computer Chess Championships | ChessVibes by Peter Doggers, June 29, 2011
^ re: rybka source code by Vasik Rajlich, Rybka Forum, July 24, 2007
^ Strelka 2.0 by Vasik Rajlich, Rybka Forum, January 11, 2008
^ My recent correspondence with Vasik Rajlich by Sven Schüle, CCC, June 13, 2010
^ Re: Strelka 2.0 pg 4 by Anthony Cozzie, Rybka Forum, January 11, 2008
^ A question to Larry Kaufman, by Erik, Rybka Forum, December 30/31, 2009
^ Rybka/Fruit: evaluation by Zach Wegner
^ Re: What do you folks make of this ? by Chris Whittington, OpenChess Forum, June 27, 2010
^ Mark Watkins (2011). A comparison of Rybka 1.0 Beta and Fruit 2.1, pdf, February 24, 2011 Version
^ What Strelka tells about Rybka's nodecount and depth by Ernest Bonnem, CCC, July 09, 2007
^ Does Rybka Properly Count Positions Evaluated? by John L. Jerz
^ To Jeroen and interested minds, re. Tiger node count by Christophe Théron, CCC, August 15, 2008
^ Re: Question to Larry Kaufman about Rybka by Larry Kaufman, CCC, February 05, 2010
^ Node counting by BB+, OpenChess Forum, January 20, 2011
^ Strelka = Rybka 1.0 by DarkAvenger, Rybka Forum, July 07, 2007
^ Strelka 2.0 by Vasik Rajlich, Rybka Forum, January 11, 2008
^ Rybka 1.0 vs. Strelka by Zach Wegner, CCC, August 19, 2008
^ Questions for Vas by Zach Wegner, CCC, August 25, 2008
^ Re: Is Rybka a derivative of Fruit? by Vasik Rajlich, Rybka Forum, July 14, 2007
^ question to vas on similarity of rybka 1.0 to fruit by duncan, Rybka Forum, August 25, 2008
^ Rybka uses PVS and not MTD(f). Its no Fruit-Clone by Chrilly Donninger, CCC, December 12, 2005
^ Is Rybbka a fruit clone? by Ziad Haddad, CCC, December 06, 2005
^ Rybka - How much Fruit is inside? by Daniel Mehrmann, CCC, December 11, 2005
^ Interview with Vasik Rajlich by Christopher Conkie, Michael Diosi, Frank Quisinsky & Alexander Schmidt, December 20, 2005, hosted by Ed Schröder
^ Official statement on [Deleted]? by Vasik Rajlich, Rybka Forum, October 21, 2009
^ I'm in doubt if RobboLito is a clone by Volker Pittlik, CCC, October 24, 2009
^ Fabien's open letter to the community by Tord Romstad, CCC, January 23, 2011
^ Fabien's open letter to the community by Tord Romstad, OpenChess Forum, January 23, 2011
^ The Chess Mind Blog - More Computer Chess Controversy
^ Attack of the clones | ChessVibes by David Levy, 19 February, 2011
^ In retrospect by Rebel, Rybka Forum, July 14, 2011
^ Apology to Vas by Rebel, Rybka Forum, August 17, 2011
^ ICGA Investigations Wiki
^ Programmers write open letter about Rybka-Fruit issue : ChessVibes by Peter Doggers, March 01, 2011
^ Open letter to the ICGA about the Rybka-Fruit issue by Harvey Williamson, Hiarcs Forum, March 01, 2011
^ Programmers Open Letter to ICGA on Rybka/Fruit by BB+, OpenChess Forum, March 01, 2011
^ Plagiatsvorwurf gegen Computerschach-Weltmeister, Heise online, March 01, 2011 (German)
^ Schach-Software Rybka - Programmierer vermuten Intelligenzklau by Frank Patalong, Spiegel Online, March 03, 2011 (German)
^ RYBKA 1.6.1 in Chess War V-VII
^ Re: Programmers Open Letter to ICGA on Rybka/Fruit by Olivier Deville, Openchess Forum, March 05, 2011
^ Le Fou numérique - Le Système du Suisse 3 - T
^ Re: Programmers Open Letter to ICGA on Rybka/Fruit by BB+, OpenChess Forum, March 05, 2011
^ Re: Programmers Open Letter to ICGA on Rybka/Fruit by Robert Hyatt, Openchess Forum, March 05, 2011
^ Rybka 1.6.1 by Robert Hyatt, Rybka Forum, March 13, 2011
^ Re: Programmers Open Letter to ICGA on Rybka/Fruit byBB+, OpenChess Forum, March 04, 2011
^ Re: Correction: List and ElChinito as Crafty clones, ... etc by Paul H, CCC, August 21, 2004
^ Open letter by Eugenio Castillo (ELChinito team) ... by Frank Quisinsky, CCC, August 28, 2004
^ Rybka disqualified and banned from World Computer Chess Championships | ChessVibes by Peter Doggers, June 29, 2011
^ Rybka and the ICGA, CSVN Computerschaak
^ BB's Rybka/Ippolit comparison by Zach Wegner, OpenChess Forum, June 13, 2010
^ Feb 12 version: Rybka 1.0 Beta / Fruit 2.1 document by BB+, OpenChess Forum, February 12, 2011
^ Rybka evidence recapitulation by BB+, OpenChess Forum, January 03, 2012
^ Part 1 covers Houdini, Rybka, Komodo, Stockfish, Critter, Naum, Chiron and Spike
^ A Pairwise Comparison of Chess Engine Move Selections by Adam Hair, hosted by Ed Schröder
^ Anthony Cozzie speaks about Rybka source code from Steve Lim / SuperSteve3d - Home, February 04, 2008
^ Why did the ICGA ignore this advice? by John Sidles, Rybka Forum, July 06, 2011
^ Re: A Big Thanks and a Small Update by John Sidles, Rybka Forum, January, 08, 2012
^ Voir dire from Wikipedia
^ Fruit 2.1 and Rybka 1.0 Beta 1.0 decompiled source code by Ed Schröder
^ Anthony Cozzie speak ! by Silvian, Rybka Forum, February 03, 2008
^ ChessBase: A Gross Miscarriage of Justice in Computer Chess by kingliveson, OpenChess Forum, January 02, 2012
^ Re: ChessBase: A Gross Miscarriage of Justice in Computer Chess by BB+, OpenChess Forum, January 02, 2012
^ Re: Hyatt Is Gone! by BB+ OpenChess Forum, Jan 03, 2012
^ Rybka evidence recapitulation by BB+, OpenChess Forum, January 03, 2012
^ Søren Riis (2012). A Gross Miscarriage of Justice in Computer Chess. pdf hosted by ChessBase

What links here?

Page	Date Edited
14th Computer Olympiad	Jul 23, 2017
ACCA 2007	Jul 14, 2014
ACCA 2008	Jul 14, 2014
ACCA 2009	Jul 14, 2014
ACCA Americas' Computer Chess Championship	Nov 20, 2014
ACCA World Computer Rapid Chess Championship	Jun 27, 2017
Albert Silver	Feb 25, 2018
Alessandro Scotti	Feb 27, 2014
Alexander Schmidt	May 17, 2016
Almond	Feb 14, 2012
Alon Greenfeld	Feb 24, 2017
Anthony Cozzie	Nov 5, 2016
Aquarium	Dec 4, 2016
Argonaut	Apr 15, 2013
Arno Nickel	Sep 25, 2015
Bodo	Oct 6, 2016
Bright	Oct 25, 2016
BugChess FR	Feb 24, 2013
CCT Tournaments	Jan 29, 2017
CCT10	May 5, 2013
CCT11	Feb 17, 2015
CCT6	May 29, 2014
CCT8	Apr 6, 2013
CCT9	Aug 25, 2013
CGW 2007	Jan 2, 2017
Chaturanga IT	Jan 7, 2016
Checkmate	Apr 13, 2018
Chess	Jan 21, 2018
Chess Assistant	Jul 16, 2017
Chess960CWC 2007	Aug 21, 2012
Chess960CWC 2008	Aug 21, 2012
Chess960CWC 2009	Aug 21, 2012
ChessBase	Nov 25, 2017
ChessOK	Jul 30, 2013
Chiron	Sep 24, 2017
Chris Whittington	Dec 9, 2017
Claims of Rybka Originality	May 17, 2016
Claims that Strelka is Rybka	Jun 6, 2012
Clones	Jan 16, 2017
Computer Chess Forums	Nov 26, 2017
Computer Olympiad	Mar 6, 2018
Crafty	Jan 28, 2018
Critter	Jan 25, 2014
Daniel Mehrmann	Dec 13, 2015
Dann Corbit	Dec 9, 2017
David Levy	Jan 3, 2017
Deep Fritz versus Deep Junior 2007	Oct 15, 2016
Deep Sjeng	Jan 7, 2016
Depth	Feb 25, 2018
DOCCC 2006	Aug 27, 2016
DOCCC 2007	Aug 15, 2015
DOCCC 2008	Aug 15, 2015
DOCCC 2009	Aug 15, 2015
DOCCC 2010	Aug 15, 2015
DOCCC 2011	Dec 1, 2013
Dutch Open Computer Chess Championship	Sep 25, 2014
Ed Schroder	Feb 26, 2018
Eduard Nemeth	Nov 22, 2014
Eigenmann Endgame Test	Jun 1, 2017
Engines	Mar 10, 2018
Eric van Reem	Sep 10, 2014
Ernest Bonnem	Jan 26, 2014
Fabien Rybka Letter	Feb 23, 2014
Fortress	Feb 1, 2018
Fritz	Feb 26, 2018
Fritz Reul	Nov 28, 2016
Fruit	Sep 27, 2016
GullChess	Jun 27, 2017
Hans Secelle	Nov 2, 2012
Hans van der Zijden	Dec 13, 2016
Harry Schnapp	Apr 11, 2013
Helmut Weigel	Dec 2, 2017
Hiarcs	Feb 25, 2018
Houdini	Apr 14, 2018
ICGA Journal	Dec 21, 2017
ICT 2006	Oct 14, 2015
ICT 2007	Sep 14, 2015
ICT 2008	Sep 14, 2015
ICT 2010	Sep 14, 2015
ICT 2012	Jun 11, 2012
Ikarus	Jul 5, 2016
International CSVN Tournament	Jan 8, 2018
IPCCC	Jan 20, 2017
IPCCC 2005 b	Apr 15, 2013
IPCCC 2006	Dec 8, 2012
IPCCC 2007	May 30, 2016
Ippolit	May 17, 2016
Ivan Bratko	Aug 16, 2017
Iweta Rajlich	Sep 23, 2017
Jeroen Noomen	Jul 21, 2017
Joel Veness	Dec 8, 2017
John L. Jerz	Jul 15, 2013
Jury Osipov	Jul 29, 2013
Kai Laskos	Jan 21, 2018
Karlo Bala Jr.	Feb 19, 2017
Knowledge	Jul 22, 2017
Komodo	Mar 6, 2018
Kramnik versus Deep Fritz 2006	Nov 28, 2017
Krzysztof Siewicz	Aug 9, 2014
Ktulu	May 16, 2015
Lance Perkins	Nov 10, 2011
Larry Kaufman	Jan 28, 2018
LearningLemming	Jun 29, 2013
Livingston Chess960 Computer World Championship	Aug 7, 2012
Loop (Program)	Mar 14, 2017
Marco Costalba	Feb 28, 2018
Mark Watkins	Dec 6, 2017
Martin Thoresen	Apr 29, 2015
Match Statistics	Mar 31, 2018
Matej Guid	Jan 6, 2018
Material Tables	May 5, 2017
Michael Sherwin	Dec 18, 2017
Milos Stanisavljevic	May 23, 2016
Monte-Carlo Tree Search	Apr 26, 2018
Naum	Nov 23, 2017
Nelson Hernandez	Nov 23, 2017
Node	Jul 20, 2015
Nodes per second	Feb 28, 2018
Norman Schmidt	Oct 12, 2017
Olivier Deville	Sep 29, 2016
Parallel Search	Dec 30, 2017
Piece-Square Tables	Mar 31, 2018
Playing Strength	Mar 31, 2018
Quantifying Evaluation features	Jun 6, 2012
Revelation	Jul 15, 2016
Revelation II	Jan 8, 2018
Robert W. Howard	Jul 1, 2014
Rolf Tüschen	Jun 6, 2012
Rondo	Jan 7, 2016
Rook on Open File	Apr 24, 2017
Ross Boyd	Mar 12, 2018
Ryan Benitez	May 16, 2015
Rybka	Mar 27, 2017
Rybka Controversy	Jan 18, 2018
Scaramanga	Mar 6, 2011
Score	Apr 14, 2018
Sergei Markoff	Mar 12, 2018
Shredder	Jan 21, 2018
Silent but deadly	Jun 17, 2015
Singular Extensions	Jan 9, 2018
Spark	Oct 19, 2017
SpiderChess	Oct 4, 2017
Spike	Jan 7, 2016
Stephan Oliver Platz	Dec 14, 2017
Steve Lopez	Dec 4, 2016
Stockfish	Apr 7, 2018
Strelka	May 17, 2016
Sunfish	Jan 11, 2018
Sven Schüle	Sep 20, 2016
Søren Riis	Jan 10, 2017
Tarrasch	Apr 15, 2017
TCEC	Apr 18, 2018
TCEC Season 10	Jan 3, 2018
TCEC Season 5	Jun 2, 2014
TCEC Season 6	Dec 2, 2014
TCEC Season 9	Nov 6, 2017
Test-Positions	Feb 25, 2018
Thinker	Jan 7, 2016
TRACE	Feb 14, 2013
Vadim Demichev	Jul 26, 2013
Vasik Rajlich	Sep 23, 2017
Victor Zakharov	May 20, 2016
WCCC 2006	Jan 28, 2018
WCCC 2007	Jan 2, 2017
WCCC 2008	Jan 3, 2017
WCCC 2009	Apr 2, 2017
WCCC 2010	Jan 6, 2017
WCRCC 2007	Nov 21, 2016
WCRCC 2008	Nov 21, 2016
WCRCC 2009	Jul 14, 2014
WCRCC 2010	Jul 14, 2014
Wieland Belka	Jul 13, 2013
Windows	Nov 2, 2017
World Computer Chess Championship	Mar 6, 2018
Zach Wegner	Jan 7, 2016
Zappa	Oct 24, 2017
Zappa versus Rybka 2007	Nov 25, 2017
Đorđe Vidanović	Feb 20, 2017

Up one Level

Shredder

GerdIsenberg — Sun, 21 Jan 2018 13:13:05 GMT

Home * Engines * Shredder

		Shredder, a chess engine by Stefan Meyer-Kahlen (SMK). Shredder won an astonished number of tournaments and titles, beside various World Computer Chess Championships, World Microcomputer Chess Championships and World Chess Software Championships, the IPCCC, the International CSVN Tournament, the CSVN Programmers Tournament, and more. Shredder had its debut at the WMCCC 1995 in Paderborn, and soon after winning the first title at the WMCCC 1996 in Jakarta, Shredder went commercial, distributed by Millennium 2000 GmbH - since Shredder 3 along with the Millennium Chess System (MCS), since Shredder 5 also developed by SMK supporting the UCI protocol, which was co-designed and implemented by the same author. Therefor, Shredder may use any UCI-compatible graphical user interface, in particular its own Shredder Classic GUI. The long-awaited Shredder 13 and its multiprocessor counterpart Deep Shredder 13 were released on October 30, 2016.
Deep Shredder 13 default desgin and window layout ^[1]

Photos & Games

WCCC 1999

WCCC 1999, round 6: Ferret - Shredder, Stefan Meyer-Kahlen and Bruce Moreland ^[2] ^[3]

[Event "WCCC 1999"]
[Site "Paderborn, Germany"]
[Date "1999.06.18"]
[Round "6"]
[White "Ferret"]
[Black "Shredder"]
[Result "1/2-1/2"]
 
1.e4 e5 2.Nf3 Nc6 3.Bc4 Bc5 4.b4 Bxb4 5.c3 Ba5 6.d4 exd4 7.O-O Nge7 8. cxd4 d5 
9.exd5 Nxd5 10.Ba3 Be6 11.Bb5 Bb4 12.Bxc6+ bxc6 13.Bxb4 Nxb4 14.Qa4 Qd6 15.Nc3 
Nd3 16.d5 Nc5 17.Qxc6+ Qxc6 18.dxc6 Ke7 19.Rfe1 Nd3 20.Re3 Nb4 21.Nd4 Rhd8 22.Rd1 
Kf6 23.a3 Nd5 24.Ne4+ Ke7 25.Ree1 Bg4 26.f3 Bc8 27.Nc5+ Kf6 28.Nb5 Be6 29.Na6 Rac8 
30.Nbxc7 h5 31.h3 h4 32.a4 Nxc7 33.Rxd8 Rxd8 34.Nxc7 Rc8 35.Nxe6 fxe6 36.Rc1 e5 
37.Kf2 Ke6 38.g3 hxg3+ 39.Kxg3 Kd6 40.Rd1+ Ke6 41.Rd7 Rxc6 42.Rxg7 Rc3 43.Rg4 Kf5 
44.h4 Rc1 45.h5 Rc6 46.Rg7 Ra6 47.Rg4 Rc6 48.Rg7 Ra6 49.Rg8 Rb6 50.Kh4 Rb4+ 51.Kg3
Rb6 52.Kh4 Rb4+ 53.Rg4 Rb2 54.Kg3 Rb6 55.a5 Rd6 56.Rg7 Ra6 57.Rg8 Rd6 58.Kh4 Rd4+ 
59.Kg3 Rd6 60.Rb8 Kg5 61.Re8 Rd5 62.a6 Ra5 63.Re7 e4 64.Rxa7 Ra3 65.Kf2 Rxf3+ 
66.Ke2 Kxh5 67.Ra8 Rf7 68.Ke3 Re7 69.Rb8 Kg6 70.Rb6+ Kf5 1/2-1/2

WCSC 2015

WCSC 2015, Shredder is winning the first blitz play-off game with Black vs. Ginkgo operated by Ingo Bauer

[Event "WCSC 2015 Play-off 2"]
[Site "Leiden, The Netherlands"]
[Date "2015.07.05"]
[Round "9.1"]
[White "Ginkgo"]
[Black "Shredder"]
[Result "0-1"]
 
1.e4 c5 2.Nf3 e6 3.d4 cxd4 4.Nxd4 a6 5.Bd3 Nf6 6.O-O d6 7.c4 Bd7 8.Nc3 Nc6 9.Nxc6 Bxc6 
10.Be3 Be7 11.f3 O-O 12.Qc2 Nd7 13.Rfd1 Nc5 14.Be2 Qb6 15.Rab1 a5 16.Nb5 Rfd8 17.Nd4 Bf6 
18.g3 Qa7 19.b3 Be8 20.a3 a4 21.b4 Nb3 22.Qd3 Nxd4 23.Bxd4 Qxd4+ 24.Qxd4 Bxd4+ 25.Rxd4 Kf8 
26.Kf2 b6 27.Rc1 e5 28.Rd2 f6 29.f4 Ke7 30.Rdc2 Rac8 31.Ke3 Rc6 32.Bf3 Rc7 33.h4 h5 34.Be2 
Rb8 35.Rd2 Bf7 36.Rcd1 Rd8 37.f5 g6 38.fxg6 Bxg6 39.Rg1 Rg8 40.Rgd1 Bf7 41.Kf2 Rd8 42.Ke3 
Be6 43.Rc1 Rg8 44.Kf2 Bg4 45.Bd3 Rc6 46.Kg2 Rf8 47.Rf1 Be6 48.Rc2 Rcc8 49.Rcc1 Bg4 50.Rc2 
Ke6 51.Rd2 Rc7 52.Rdf2 Ke7 53.Rc1 Be6 54.Kh2 Rg8 55.Rd2 Bf7 56.Be2 Bg6 57.Rcd1 Rd8 58.Bd3 
Bf7 59.Rc2 Be6 60.Rf1 Rdc8 61.Rfc1 Bd7 62.Kg2 Rh8 63.Be2 Bc6 64.Bf3 Rhc8 65.Kf2 Bb7 66.Bg2 
Rf8 67.Rf1 Bc8 68.Bf3 f5 69.Kg1 Rg8 70.Kh2 fxe4 71.Bxe4 Be6 72.Rfc1 Rgc8 73.Bd3 Rf8 74.Kg2 
d5 75.Re1 dxc4 76.Bg6 Bd5+ 77.Kh2 Kd6 78.Bxh5 e4 79.Bd1 c3 80.Rce2 e3 81.Kh3 Be6+ 82.Kg2 
Rf2+ 83.Rxf2 exf2 84.Kxf2 c2 85.Bxc2 Rxc2+ 86.Re2 Rxe2+ 87.Kxe2 Bg4+ 88.Kd3 Kd5 89.b5 Bh5 
90.Kc3 Ke4 91.Kc4 Be2+ 92.Kc3 Ke3 93.g4 Bxg4 94.Kc4 0-1

Achievements

Quote from Shredder Chess ^[4] :
The Shredder chess programs by Stefan Meyer-Kahlen provide a game playing and analysis tool for everybody and are accepted as one of the best chess programs of the world. Since 1996 Shredder has won twenty titles.

Description

Description given in 1999 from the ICCA tournament site ^[5] :

Shredder has started in 1995 as a project at university. Good tournament and test results encouraged me to spend more work in it and lead to the winning of the 1996 WMCCC in Jakarta. Shredder has been commercially available since then and continued to perform very well in computer chess championships. It was 3rd in Paris 1997 and managed to finish as the runner up in the blitz championship there. Shredder is written in ANSI-C and therefore it can easily compiled on various hardware platforms. I think Shredder has good chances in Paderborn this year because it is one of the strongest computer chess programs running on an micro around.

Portability

Since Shredder is written in C, it is available for various hardware platforms, such as PC, Macintosh, and PDAs, and various operating systems like Windows, Linux ^[6] and Mac OS ^[7] .

Clever & Smart

Clever & Smart was an experimental triple-brain version of Shredder which played the IPCCC 1998.

Deep Shredder

Deep Shredder, first released in 2001 based on Shredder 5 ^[8], is the multiprocessor version of Shredder. The most recent version, Deep Shredder 13 ^[9] released on October 30, 2016 ^[10], is the further developed 2015 World Computer Chess Software Champion, which was a complete rewrite based on bitboards. Deep Shredder 13 has improved more than 300 Elo over Shredder 12 ^[11].

Pocket Shredder

Pocket Shredder is a version for Windows PDAs, such as iPAQ ^[12] .

Shredder Mobile

Shredder Mobile runs on most mobile phones with Java ^[13] .

Shredder for Android

Shredder Classic GUI

Shredder comes with a clear and reliable graphical user interface which evolved from the Millennium Chess System - supporting the universal chess interface ^[14], also compatible with other UCI engines running under Windows, Linux or Mac OS. The Shredder GUI is favored by many programmers playing over the board tournaments with their engines, for instance Johannes Zwanzger and his WCCC 1995 winner Jonny.

Jonny's final WCCC 2015 screen in the game versus Hiarcs using the Shredder GUI

Release Dates

Shredder 1.0: 1996
Shredder 2.0: 1998
Shredder 3.0: 1999
Shredder 4.0 : 2000
Shredder 5.0 : 2001
Shredder 5.32 : June 2001
Shredder 6.0 : December 2001
Shredder 7.0 : December 2002
Shredder 7.04 : 2003
Shredder 8 : February 2004
Shredder Classic 1.1 : October 2004
Shredder 9 : February 2005
Shredder 9.1 :
Shredder 9.12 : December 2005
Shredder Classic 1.3 : ?
Shredder 10 : June 2006
Shredder 10.1 : April 2007
Shredder 11 : October 2007
Shredder 11 SE
Shredder WM Edition Bonn : October 2008
Shredder 12: October 2009
Shredder 12 SE
Shredder Classic 4 : November 2011
Deep Shredder 13: October 30, 2016

Publications

Tom King (2000). Shredder wins the 17th World Microcomputer Chess Championship. ICGA Journal, Vol. 23, No. 3 » WMCCC 2000
Theo van der Storm (2004). Shredder Shows Strength in International CSVN Tournament. ICGA Journal, Vol. 27, No. 3 » ICT 2004
Eric van Reem (2006). Shredder Wins Second Chess960 Computer-Chess World Championship. ICGA Journal, Vol. 29, No. 4 » Chess960CWC 2006
Matej Guid, Ivan Bratko (2007). Factors affecting diminishing returns for searching deeper. CGW 2007 » Crafty, Rybka, Shredder, Diminishing Returns
Matej Guid, Ivan Bratko (2007). Factors affecting diminishing returns for searching deeper. ICGA Journal, Vol. 30, No. 2, pdf

Forum Posts

1996 ...

Information about Shredder by Stefan Meyer-Kahlen, rgcc, October 22, 1996
Shredder2 by Mike Cooter, rgcc, July 26, 1998
What's wrong with Shredder? by Stefan Meyer-Kahlen, CCC, February 19, 1999
Re: Chess Genius 6.5 by pc...@delthis.co.uk, rgcc, November 24, 1999 » Chess Genius, Millennium Chess System

2000 ...

Shredder in the SSDF list by Stefan Meyer-Kahlen, CCC, April 10, 2000 » SSDF
Shredder wins the WMCCC 2000 by Enrique Irazoqui, CCC, August 25, 2000 » WMCCC 2000
Shredder 5 by Stefan Meyer-Kahlen, CCC, November 17, 2000
Shredder5 patch by Stefan Meyer-Kahlen, CCC, December 06, 2000
Wb2Uci from Odd Gunnar Malin is working well on Shredder5 GUI by Carlos E.A. Drake, Winboard Forum, March 06, 2002 » Wb2UCI
Shredder and Engine Book Learning by Stephen Ham, CCC, April 24, 2003 » Book Learning
Shredder wins in Graz after controversy by Darse Billings, CCC, December 09, 2003
Shredder 8 secret: search depth? by Jouni Uski, CCC, March 23, 2004
Re: Shredder 8 secret: search depth? by Vasik Rajlich, CCC, March 23, 2004 » Depth, Junior, Fritz

2005 ...

Shredder 9 improvements over Shredder 8 by Sandro Necchi, CCC, January 28, 2005
Shredder 9 by Alex Shalamanov, CCC, December 26, 2005
Non-deterministic behaviour of Deep Shredder - REALLY interesting by George Sobala, CCC, December 31, 2005
Shredder Classic 1.3 by phili_ppe, CCC, January 09, 2006
Shredder 10 by John Jack, CCC, February 17, 2006
Shredder 10.1 now released by AGove, CCC, April 11, 2007
Shredder for iPhonet by Stefan Meyer-Kahlen, CCC, July 06, 2007
Deep Shredder 11 by AGove, CCC, October 11, 2007
Shredder 11 Linux by Kurt Utzinger, CCC, June 08, 2008
UEP Shredder WC Edition by Ingo Bauer, CCC, October 18, 2008
Shredder 12 infos and release date by Ingo Bauer, CCC, October 03, 2009
Deep Shredder 12 Linux by Kurt Utzinger, CCC, October 11, 2009
Differences between Shredder12 and Shredder Classic 4? by Volker Pittlik, CCC, October 14, 2009
Shredder for Android by Stefan Meyer-Kahlen, CCC, November 17, 2009

2010 ...

Shredder 12 by George Bodkin, CCC, April 14, 2010
Which engine version is Shredder Classic 3? by Luca Hemmerich, CCC, May 09, 2010
Shredder for Android ... by Ingo Bauer, CCC, September 08, 2010
Shredder gets Gold by Peter Martan, CCC, October 02, 2010 » WCSC 2010
Shredder 4 classic with S12 SE engine for free by Volker Pittlik, CCC, November 06, 2011

2015 ...

Shredder-Chess-Engine will be updated by JoeBoden, CCC, February 09, 2015
Shredder is the new World Chess Software Champion by Mehmet Karaman, CCC, July 05, 2015 » WCSC 2015
New Shredder information? by Robert Flesher, CCC, December 27, 2015
Deep Shredder 13 Windows out by Stefan Meyer-Kahlen, CCC, October 30, 2016
Shredder 13 for Mac and Linux out by Stefan Meyer-Kahlen, CCC, November 22, 2016

External Links

Chess Engine

Shredder Computer Chess
Shredder Computer Chess | News
Shredder from Wikipedia
Shredder 5.0 - das Weltmeister-Programm! by Peter Schreiner, Schachclub Leinzell Informationen zu aktueller Schachsoftware, Dezember 2000 (German)
Shredder 9 on top of the world - A short introduction to Shredder 9 by Peter Schreiner, ChessBase News, March 01, 2005 ^[15]
Programs and essentials by Steve Lopez, ChessBase News, March 13, 2005 » Junior 9, Shredder 9
Shredder 10 now available - Interview with Shredder author Stefan Meyer-Kahlen, ChessBase News, May 26, 2006
ChessBase DeepShredder 12 by Frank Quisinsky, Schachwelt - Computerschach, January 30, 2010 (German)
First win against Shredder 12! by Dana Mackenzie, Dana Blogs Chess, July 03, 2011

Shredderbases

Shredderbases
Shredder 10 and the Shredderbases, ChessBase News, July 07, 2006
Shredderbases by Steve Lopez, ChessBase News, November 11, 2006

Misc

References

^ Shredder 13 Windows Screenshots from Shredder Chess
^ Image captured from Paderborn 1999 1.mp4 by Thorsten Czub hosted by Ed Schröder
^ Paderborn 1999 - Chess - Round 6 - Game 3 (ICGA Tournaments)
^ Shredder Computer Chess, 19th title added by editor
^ Shredder's ICGA Tournaments
^ Shredder Computer Chess Download - Linux
^ Shredder Computer Chess Download - Macintosh
^ Shredder 5.0 - das Weltmeister-Programm! - Deep Shredder verfügbar! - April 2001 by Peter Schreiner, Schachclub Leinzell Informationen zu aktueller Schachsoftware, Dezember 2000 (German)
^ Shredder Computer Chess Download - Deep Shredder 13
^ Deep Shredder 13 Windows out by Stefan Meyer-Kahlen, CCC, October 30, 2016
^ Re: Deep Shredder 13 Windows out by Ingo Bauer, CCC, October 30, 2016
^ Pocket Shredder: Chess for Windows Mobile
^ Shredder Mobile
^ Shredder Classic 3 user interface
^ Ten years of Computer Chess revisited by Kai Laskos, CCC, March 13, 2015

What links here?

Page	Date Edited
14th Computer Olympiad	Jul 23, 2017
Aegon 1996	Jan 22, 2017
Aegon 1997	Apr 7, 2017
Alon Greenfeld	Feb 24, 2017
Ant	Jun 1, 2015
Aquarium	Dec 4, 2016
Arena	Mar 16, 2018
Argonaut	Apr 15, 2013
Book Learning	Jan 1, 2017
Branching Factor	Jun 28, 2017
Brutus	Dec 24, 2016
CCT Tournaments	Jan 29, 2017
CCT1	Dec 30, 2012
CCT12	Jan 28, 2018
CCT2	Sep 7, 2012
CCT3	Feb 14, 2013
CCT4	Apr 22, 2013
CGW 2007	Jan 2, 2017
Chess Genius	Feb 26, 2018
Chess960CWC 2005	Jan 1, 2016
Chess960CWC 2006	Sep 25, 2014
Chess960CWC 2007	Aug 21, 2012
Chess960CWC 2008	Aug 21, 2012
Chess960CWC 2009	Aug 21, 2012
ChessBase	Nov 25, 2017
ChessPartner	Nov 13, 2017
Clever & Smart	Jan 20, 2017
Cluster Toga	Jan 7, 2016
Computer Olympiad	Mar 6, 2018
CPT 2008	Nov 6, 2014
CPT 2009	Jan 17, 2013
CPT 2010	Jan 17, 2013
CPT 2011	Dec 1, 2013
Crafty	Jan 28, 2018
CSVN Programmers Tournament	Apr 25, 2018
Dana Mackenzie	Jan 18, 2018
Darse Billings	Feb 14, 2017
DEC Alpha	Aug 15, 2015
Deep Sjeng	Jan 7, 2016
Depth	Feb 25, 2018
Detlef Pordzik	Dec 1, 2017
DGT Board	Feb 21, 2018
Dieter Steinwender	Jul 4, 2016
DOCCC 2006	Aug 27, 2016
DOCCC 2010	Aug 15, 2015
Eigenmann Endgame Test	Jun 1, 2017
Eiko Bleicher	Apr 24, 2014
Endgame Bitbases	Apr 5, 2017
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Eric van Reem	Sep 10, 2014
Fabien Letouzey	Feb 5, 2018
Falcon	Sep 2, 2016
Ferret	Jan 7, 2016
Freezer	Aug 14, 2016
Fridolin	Jun 27, 2017
Fritz	Feb 26, 2018
Fritz Reul	Nov 28, 2016
Fruit	Sep 27, 2016
Ginkgo	Jul 13, 2016
GridChess	Jul 13, 2016
GridGinkGo	Jul 13, 2016
GridProtector	Jul 13, 2016
GUI	Mar 16, 2018
Hannibal	Oct 4, 2017
ICGA Journal	Dec 21, 2017
ICT 2002	Nov 19, 2016
ICT 2003	Aug 18, 2016
ICT 2004	Aug 17, 2016
ICT 2005	Oct 14, 2015
ICT 2006	Oct 14, 2015
ICT 2010	Sep 14, 2015
Ingo Bauer	Jul 6, 2015
International CSVN Tournament	Jan 8, 2018
IPCCC	Jan 20, 2017
IPCCC 1999	Dec 21, 2012
IPCCC 2000	Dec 21, 2012
IPCCC 2001	Jan 9, 2014
IPCCC 2002	May 31, 2014
IPCCC 2003	Aug 17, 2016
IPCCC 2004	Dec 1, 2014
IPCCC 2005	Aug 21, 2015
IPCCC 2005 b	Apr 15, 2013
IPCCC 2006	Dec 8, 2012
IPCCC 2007	May 30, 2016
Ivan Bratko	Aug 16, 2017
Johan Havegheer	Feb 2, 2013
Johannes Zwanzger	Jan 7, 2016
Jonny	Nov 4, 2017
Jouni Uski	Sep 28, 2017
Junior	Feb 27, 2018
Komodo	Mar 6, 2018
Kramnik versus Deep Fritz 2002	Oct 16, 2017
Kramnik versus Deep Fritz 2006	Nov 28, 2017
Linux	Jan 21, 2018
Livingston Chess960 Computer World Championship	Aug 7, 2012
Match Statistics	Mar 31, 2018
Matej Guid	Jan 6, 2018
MILLENNIUM 2000 GmbH	Jul 13, 2017
Millennium Chess System	Jul 12, 2017
Opening Book	Feb 26, 2018
Ossi Weiner	Dec 18, 2017
Playing Strength	Mar 31, 2018
Protector	Oct 12, 2017
Pruning	Jan 1, 2018
Pseudorandom number generator	May 11, 2017
PT 45	May 19, 2014
PT 47	Dec 1, 2014
PT 49	Oct 22, 2015
PT 50	May 3, 2017
Quazar	Oct 29, 2015
Revelation	Jul 15, 2016
Revelation II	Jan 8, 2018
Rondo	Jan 7, 2016
Rookie	Jan 7, 2016
Ruffian	Jun 6, 2017
Ryan Benitez	May 16, 2015
Rybka	Mar 27, 2017
Rybka Controversy	Jan 18, 2018
Sandro Necchi	Mar 19, 2016
Shannon Trophy	Jul 7, 2017
Shredder	Jan 21, 2018
SSDF	Feb 25, 2018
Stefan Meyer-Kahlen	Jun 19, 2017
Steve Lopez	Dec 4, 2016
TCEC Season 5	Jun 2, 2014
TCEC Season 6	Dec 2, 2014
The Chess Programmers Tournament	Nov 8, 2011
Theo van der Storm	Apr 5, 2017
Thompson's Databases	Dec 24, 2014
Timo Haupt	Jan 8, 2016
Tom King	Aug 19, 2017
Transposition Table	Apr 19, 2018
UCI	Mar 4, 2018
Vasik Rajlich	Sep 23, 2017
Vincent Diepeveen	May 5, 2017
Volker Pittlik	Sep 4, 2013
Wb2UCI	Feb 1, 2018
WCCC 1999	Jul 13, 2017
WCCC 2002	Nov 24, 2017
WCCC 2003	Apr 2, 2017
WCCC 2004	Jan 28, 2018
WCCC 2005	Dec 27, 2016
WCCC 2006	Jan 28, 2018
WCCC 2007	Jan 2, 2017
WCCC 2008	Jan 3, 2017
WCCC 2009	Apr 2, 2017
WCCC 2010	Jan 6, 2017
WCCC 2011	Jan 7, 2017
WCCC 2013	Dec 7, 2016
WCCC 2015	Jun 13, 2017
WCCC 2016	Sep 18, 2017
WCCC 2017	Dec 31, 2017
WCSC 2010	Jan 6, 2017
WCSC 2011	Jan 7, 2017
WCSC 2013	Aug 17, 2016
WCSC 2015	Jun 13, 2017
WCSC 2016	Sep 18, 2017
WCSC 2017	Jul 4, 2017
Who's Who	Sep 6, 2017
Windows	Nov 2, 2017
WMCCC 1995	Jan 3, 2018
WMCCC 1996	Sep 15, 2016
WMCCC 1997	Apr 4, 2017
WMCCC 1999	Jan 7, 2016
WMCCC 2000	Feb 27, 2018
WMCCC 2001	Jul 25, 2017
World Chess Software Championship	Mar 6, 2018
World Computer Chess Championship	Mar 6, 2018
World Microcomputer Chess Championship	Jan 7, 2016
XXXX	Jan 7, 2016
Yace	Dec 31, 2017
Zach Wegner	Jan 7, 2016
Zappa versus Rybka 2007	Nov 25, 2017

Up one Level

SOS

GerdIsenberg — Wed, 05 Apr 2017 19:57:39 GMT

Home * Engines * SOS

		SOS is a chess program developed and written by Rudolf Huber in C. In its early times in the mid 90s, SOS running on various platforms and operating systems had an own futuristic graphical user interface. SOS supported the Chess Engine Communication Protocol ^[1] , was available as Young Talent by ChessBase running under the Fritz6 GUI ^[2] , and since Rudolf is co-designer of the protocol, it finally changed to UCI ^[3] , and is a Partner Chess Engine of Arena ^[4] ^[5] . SOS evolved from PVS to MTD(f) and further as ParSOS to parallel MTD(f).
Silicon on Sapphire ^[6]

Tournaments

SOS has its debut at Don Beal's 1993 QMW Uniform-Platform Computer Chess Championship. It further played various World Microcomputer Chess and World Computer Chess Championships, the WMCCC 1993, WCCC 1995, WMCCC 1997, WCCC 1999, and the WMCCC 2000, where SOS won the title of the Amateur World Microcomputer Chess Champion. ParSOS continued playing the WMCCC 2001, WCCC 2002, WCCC 2003, WCCC 2004 and the WCCC 2006. SOS played most IPCCCs, and also competed at International CSVN Tournaments.

Descriptions

^[7]

1995

SOS is a conventional chess program. It uses depth first minimax tree search with quiescence search, alpha-beta enhancement, minimal window search and null-move pruning. To improve the search efficiency, the history heuristic and a transpositional table is used. The search is extended to deeper plies on those move sequences which have a high probability of being part of the principal variation. For SOS, those sequences are recaptures and check evasions. Leaf node evaluation considers only material, piece placement and pawn structure and only about 10% of the CPU time is spent on this (not including the quiescence search which is capture only, but extends on "losing" captures which are checks and on checking sequences). The evaluation parameters are dynamic and continuously updated during tree search. SOS's weakest part is probably endgame knowledge. SOS actively plays a wide range of openings, but most of those lines are not very deep. With autoplay games against itself, the opening book is tuned to favour those lines which harmonize with SOS's style of play.

1999

SOS is an amateur program which was started in 1993 and has since then competed in a number of tournaments. The newest version runs on multiprocessor systems with a parallelized version of mtd(f) as its minimax search algorithm. SOS used to be a relatively fast searcher and relied on outsearching the opponent. This has changed now and more knowledge and special cases have been implemented which slow it down. Little effort is spent on the opening book. It plays a very broad range of openings. However it learns to avoid unsuccessful lines and tries not to repeat lost games. It uses publicly available endgame databases.

Forum Posts

New Winboard engine, SOS by Rudolf Huber, Germany ! by Frank Quisinsky, Winboard Forum, 27 October 1999
Chess knowledge (eg: SOS) by ujecrh, CCC, March 30, 2000
Testing SOS (Chessbase engine) = Extremely strong!! by Tomas Casanovas Martinez, CCC, June 18, 2000
Re: Question about SOS by Andrew Williams, CCC, June 19, 2000
SSDF(Crafty 17.07 - SOS)AMD K6-2 450, 1-5. by Tony Hedlund, CCC, August 19, 2000
SOS is amateur WMCC 2000 with 5.5 point out of 9 by Jorge Pichard, CCC, August 26, 2000
Goliath Light, Gromit, Patzer, SOS, etc. commercially sold by Theo van der Storm, CCC, August 28, 2001
Stalemate trap(SOS-Delfi) by George Lyapko, Winboard Forum, December 18, 2001 » Stalemate, Test-Positions, Delfi
The new UCI / WB GUI Arena is available with UCI Arena SOS .. by Frank Quisinsky, CCC, January 18, 2002
After ELChinito 3.25 on Christmas now SOS.4 on New Years day! by Frank Quisinsky, CCC, January 01, 2004 » Chinito

External Links

Chess Engine

SOS' ICGA Tournaments
Arena Chess GUI 3.0 - SOS
Interview with SOS programmer Rudolf Huber in German language! by Frank Quisinsky, Arena Chess GUI 3.0 - Archive 9, 132, May 10, 2005
SOS from WBEC Ridderkerk

Misc

References

^ New Winboard engine, SOS by Rudolf Huber, Germany ! by Frank Quisinsky, Winboard Forum, 27 October 1999
^ Support - ChessBase, May 28th, 2000
^ The new UCI / WB GUI Arena is available with UCI Arena SOS .. by Frank Quisinsky, CCC, January 18, 2002
^ Arena Chess GUI 3.0 - Partner Chess Engines
^ Arena Chess GUI 3.0 - SOS
^ Silicon on sapphire from Wikipedia.de
^ SOS' ICGA Tournaments

What links here?

Page	Date Edited
Arena	Mar 16, 2018
Bestia	Jan 5, 2013
CCT3	Feb 14, 2013
CCT7	Dec 16, 2017
ChessBase	Nov 25, 2017
Crux	Jan 30, 2017
Delfi	Jan 7, 2016
Eigenmann Endgame Test	Jun 1, 2017
Engines	Mar 10, 2018
George Lyapko	Jan 14, 2013
ICT 2001	Oct 14, 2015
ICT 2002	Nov 19, 2016
IPCCC 1994	Jul 31, 2013
IPCCC 1997	Aug 24, 2013
IPCCC 1998	Feb 25, 2018
IPCCC 1999	Dec 21, 2012
IPCCC 2000	Dec 21, 2012
IPCCC 2001	Jan 9, 2014
IPCCC 2002	May 31, 2014
IPCCC 2003	Aug 17, 2016
IPCCC 2005	Aug 21, 2015
IPCCC 2005 b	Apr 15, 2013
Mathematician	Apr 9, 2018
MILLENNIUM 2000 GmbH	Jul 13, 2017
Millennium Chess System	Jul 12, 2017
ParSOS	Jan 7, 2016
PocketGrandmaster	Sep 17, 2015
Rudolf Huber	Jan 7, 2016
Salvo Spitaleri	Mar 11, 2013
SCCC 1998	Dec 15, 2017
SOS	Apr 5, 2017
Stalemate	Feb 21, 2018
Stefan Meyer-Kahlen	Jun 19, 2017
Test-Positions	Feb 25, 2018
Tony Hedlund	Jun 19, 2017
UPCCC 1993	Mar 6, 2015
UPCCC 1994	Mar 9, 2012
WCCC 1995	Jul 12, 2017
WCCC 1999	Jul 13, 2017
WMCCC 1993	Dec 30, 2017
WMCCC 1997	Apr 4, 2017
WMCCC 2000	Feb 27, 2018

Up one level

Zappa

GerdIsenberg — Tue, 24 Oct 2017 18:58:11 GMT

Home * Engines * Zappa

		Zappa, a world class UCI compliant chess program developed by Anthony Cozzie. Zappa won the WCCC 2005 in Reykjavík ^[1] , and after the Rybka disqualification in 2011 the WCCC 2007 in Amsterdam, the DOCCC 2005 and CCT7.During the World Chess Championship 2007 in Mexico City, September 2007, Zappa played a match versus Rybka and scored 5.5 / 10 to win the match ^[2] ^[3] ^[4] . Zappa's book authors for different events were Arturo Ochoa (CCT7) and Erdogan Günes ^[5] .
Strictly Commercial ^[6] ^[7] ^[8]

Photos

^[9]



Anthony Cozzie before round 7, Zappa - Junior, WCCC 2005 ^[10]

Zappa Team, Anthony Cozzie and Erdogan Günes, Closing Dinner WCCC 2006, Turin

Genealogy

Zappa is not directly named for Frank Zappa, but from a scene from Austin Powers 2, where Dr. Evil's base in the moon is divided in two units: Moon Unit Alpha and Moon Unit Zappa - the latter being the name of Frank Zappa's daughter, Moon Unit Zappa ^[11] .

Strictly Commercial

Immediately after the successful WCCC 2005, there were plans to commercialize Zappa. First attempts with Vincent Diepeveen involved failed ^[12] . In April 2006 ^[13] , a commercial version dubbed Zap!Chess running under the Fritz GUI was released by ChessBase ^[14] . The version which played the Rybka match, Zappa Mexico, is distributed by Stefan Meyer-Kahlen ^[15] .

Quote from No Commercial Potential : The Saga of Frank Zappa (1972) by David Walley, p. 4 ^[16] ^[17] ^[18] :

Jawaka	`Information is not knowledge` `Knowledge is not wisdom` `Wisdom is not truth` `Truth is not beauty` `Beauty is not love` `Love is not music` `Music is the best`

Program Internals

Board Representation

Zappa utilizes bitboards and uses rotated bitboards to generate sliding attacks on the fly. Anthony once experimented with incremental updated attack tables, which was a win on 32-bit systems ^[19] .

Hash Collisions

Excerpt from The Effect of Hash Signature Collisions in a Chess Program, that is Crafty and Zappa ^[20] :

Both programs are traditional computer chess programs that use the alpha/beta algorithm to search a minimax game tree. The search is done in three distinct phases.

Phase 1 is the normal full-width search that is done to some fixed depth as limited by the total time allowed for a move. This fixed-depth search is modified by various search extensions.

Phase 2 is an add-on search done after the basic search has reached a satisfactory depth. Phase 2 only considers captures in Crafty, while Zappa also includes some checking moves.

Phase 3 is the static evaluation, which takes the current position after phase 2 has completed, and computes a numerical score based on the material, the locations of the pieces, pawn structure, and many other positional considerations. In Crafty/Zappa, all of the hashing is done in phase1 of the search, there is no hashing in the quiescence search.

Singular Extensions

Zap!Chess, the commercial ChessBase version, has an implementation of Singular Extensions, the famous Deep Blue search algorithm. They are disabled by default, but they increase the tactical strength of the program at the cost of positional strength ^[21] .

Parallel Search

Zappa was designed to run on multiple processors and massive parallel systems using shared memory and threads and has an efficient parallel search ^[22] . Zappa Mexico can be used on Windows or Linux computers with up to 512 CPU cores.

100% Finished

In March 2008 Anthony Cozzie announced that "the Zappa project is 100% finished", which includes both tournaments and future releases ^[23] .

Rondo

In 2010, Zach Wegner started to work with Anthony Cozzie, who, still in computer chess retirement, has given control for further development of his massive parallel program, now called Rondo, to Zach ^[24] ^[25] .

Publications

The Editor (2005). ZAPPA Wins the Computer-Chess Tournament 7. ICGA Journal, Vol. 28, No. 2 » CCT7
Robert Hyatt, Anthony Cozzie (2005). The Effect of Hash Signature Collisions in a Chess Program. ICGA Journal, Vol. 28, No. 3
Anthony Cozzie (2007). Zappa vs. Rybka. ICGA Journal, Vol. 30, No. 4
Monty Newborn (2011). Beyond Deep Blue: Chess in the Stratosphere. Springer, ISBN-13: 978-0857293404, amazon

Chapter 9: 2005: Zappa Red Hot at 13th WCCC, page 119
Chapter 14: 2007: Zappa Upsets Rybka in Mexico City, 5.5–4.5, page 169

Forum Posts

2003

Zappa CCT5 Report by Anthony Cozzie, CCC, January 21, 2003 » CCT5

2004

Zappa @ CCT6 by Anthony Cozzie, CCC, February 01, 2004 » CCT6
The Zappa Attack Table Code by Anthony Cozzie, CCC, May 05, 2004

2005 ...

Zappa 1.0 released by Volker Pittlik, CCC, February 22, 2005
Zappa - TCB 1-0 by Anthony Cozzie, CCC, August 14, 2005 » WCCC 2005
Sjeng-Zappa by Anthony Cozzie, CCC, August 14, 2005
FUTE-Zappa by Anthony Cozzie, CCC, August 15, 2005
Zappa=Fruit live by Anthony Cozzie, CCC, August 15, 2005
Zappa - Jonny 1-0 by Anthony Cozzie, CCC, August 16, 2005
The Baron - Zappa 0-1 by Anthony Cozzie, CCC, August 18, 2005
Zappa - Junior by Anthony Cozzie, CCC, August 19, 2005
Zappa-Isichess by Anthony Cozzie, CCC, August 19, 2005
Shredder-Zappa by Anthony Cozzie, CCC, August 20, 2005
Zappa - Crafty by Anthony Cozzie, CCC, August 20, 2005
Diep-Zappa by Anthony Cozzie, CCC, August 21, 2005
Zappa scaling #s by Anthony Cozzie, CCC, August 23, 2005
Zappa web update & a few other things by Anthony Cozzie, CCC, August 27, 2005
Zappa commercial and available in september by Thomas Logan, CCC, August 27, 2005
Re: Zappa Retail: No UCI? by Anthony Cozzie, CCC, September 04, 2005
Zappa UCI: You are all a bunch of HYPOCRITES by Gian-Carlo Pascutto, CCC, September 04, 2005
I will not buy Zappa and Sjeng by Sandro Necchi, CCC, September 06, 2005
Zappa 1.1 by Ernst Walet, CCC, September 14, 2005
Re: what do we know about zappa by Anthony Cozzie, CCC, December 12, 2005
Zappa Hardware Upgrade by Anthony Cozzie, CCC, December 23, 2005
Zappa Report by Anthony Cozzie, CCC, December 30, 2005 » IPCCC 2005 b
Re: Zappa Report by Ingo Althöfer, CCC, December 30, 2005 ^[26]

2006

Zappa? by James T. Walker, CCC, January 27, 2006

2007

Zappa Mexico UCI going commercial by Kaj Soderberg, CCC, September 09, 2007
Zappa V Rybka Mexico 2007 - Zappa wins 5.5-4.5 - The Games by Harvey Williamson, Hiarcs Forum, September 27, 2007

2008 ...

bad news from zappa ... by Powell, CCC, Mar 09, 2008

2010 ...

info about zappa on 512 cores ? by Daniel Shawul, CCC, June 23, 2012
Threads-Test - SF, Zappa, Komodo - 1 vs. 2, 4, 8, 16 Threads by Andreas Strangmüller, CCC, May 04, 2014 » Thread, Stockfish, Zappa, Komodo
Threads factor: Komodo, Houdini, Stockfish and Zappa by Andreas Strangmüller, CCC, May 17, 2014 » Thread, Komodo, Houdini, Stockfish, Zappa

2015 ...

Empirical results with Lazy SMP, YBWC, DTS by Kai Laskos, CCC, April 16, 2015 » Lazy SMP, YBWC, DTS
What is the secret of Zappa? by Frank Quisinsky, CCC, September 11, 2016

External Links

Zappa Chess

Zappa

Frank Zappa from Wikipedia
Moon Zappa from Wikipedia
Dweezil Zappa from Wikipedia
Frank Zappa - Wikiquote
The Mothers of Invention from Wikipedia
Zappanale from Wikipedia
Zappa Wiki Jawaka!
(3834) Zappafrank (Planet)
3834 Zappafrank from Wikipedia
The Planet Zappafrank
Pachygnatha Zappa
Zappa confluentus - "A Fish Called Zappa"
Berlin Names Street After Frank Zappa, The Washington Post, July 30, 2007
Frank Zappa - Cosmik Debris, YouTube Video
Frank Zappa, Jean-Luc Ponty, George Duke, Tom Fowler, Bruce Fowler, Ruth Underwood, Ian Underwood, Ralph Humphrey
Frank Zappa - Illinois Enema Bandit ^[28] , YouTube Video
Frank Zappa, Ray White, Steve Vai, Tommy Mars, Bobby Martin, Ed Mann, Scott Thunes, Chad Wackerman
Frank Zappa - Whippin' Post, live at "The Pier", New York City, 26th August 1984, YouTube Video
Frank Zappa, Ray White, Ike Willis, Bobby Martin, Allan Zavod, Scott Thunes, Chad Wackerman

References

^ WCCC 2005 Photojournal by Anthony Cozzie
^ WM Mexiko-City 2007: 108 Bilder, Namen, Themen, kommentiert, ... (German) Chess Tigers News October 08, 2007
^ Zappa fillets the Fish: Mexico 2007 by Anthony Cozzie
^ Anthony Cozzie (2007). Zappa vs. Rybka. ICGA Journal, Vol. 30, No. 4
^ Zappa Chess Engine
^ Strictly Commercial from Wikipedia
^ Strictly Commercial: The Best of Frank Zappa - Frank Zappa | AllMusic
^ Strictly Commercial - Zappa Wiki Jawaka
^ By Gerd Isenberg
^ Zappa - Junior by Anthony Cozzie, CCC, August 19, 2005
^ Zappa Chess Engine - Genealogy
^ Re: Zappa Retail: No UCI? by Anthony Cozzie, CCC, September 04, 2005
^ World Computer Chess Champion: Zap!Chess, ChessBase News, April 13, 2006
^ ChessBase Shop - Zap!Chess
^ Zappa Mexico from shredderchess.com
^ No Commercial Potential: The Saga Of Frank Zappa
^ Frank Zappa - Wikiquote
^ No Commercial Potential: The Saga of Frank Zappa - Zappa Wiki Jawaka
^ The Zappa Attack Table Code by Anthony Cozzie, CCC, May 05, 2004
^ Robert Hyatt, Anthony Cozzie (2005). The Effect of Hash Signature Collisions in a Chess Program. ICGA Journal, Vol. 28, No. 3
^ World Computer Chess Champion: Zap!Chess, ChessBase News, April 13, 2006
^ Zappa scaling #s by Anthony Cozzie, CCC, August 23, 2005
^ bad news from zappa ... by Powell, CCC, Mar 09, 2008
^ Zach, is this true? by Gabor Szots, CCC, June 06, 2010
^ Zappa's ICGA Tournaments
^ Ingo Althöfer (1993). On Telescoping Linear Evaluation Functions. ICCA Journal, Vol. 16, No. 2, pp. 91-94
^ Erwin l'Ami from Wikipedia
^ Michael H. Kenyon from Wikipedia

What links here?

Page	Date Edited
Andreas Strangmüller	May 15, 2017
Anthony Cozzie	Nov 5, 2016
Arturo Ochoa	May 4, 2017
Automated Tuning	Feb 27, 2018
CCT Tournaments	Jan 29, 2017
CCT10	May 5, 2013
CCT5	Feb 22, 2013
CCT6	May 29, 2014
CCT7	Dec 16, 2017
CCT8	Apr 6, 2013
CCT9	Aug 25, 2013
ChessBase	Nov 25, 2017
Daniel Mehrmann	Dec 13, 2015
Deep Fritz versus Deep Junior 2007	Oct 15, 2016
DOCCC 2005	Aug 15, 2015
Dutch Open Computer Chess Championship	Sep 25, 2014
Eigenmann Endgame Test	Jun 1, 2017
Engines	Mar 10, 2018
Erdogan Günes	Jul 7, 2017
Fabien Letouzey	Feb 5, 2018
Fritz Reul	Nov 28, 2016
Fruit	Sep 27, 2016
Futé	Apr 13, 2017
Helmut Weigel	Dec 2, 2017
Houdini	Apr 14, 2018
ICGA Journal	Dec 21, 2017
ICT 2007	Sep 14, 2015
IPCCC 2005 b	Apr 15, 2013
Jos Uiterwijk	Aug 11, 2017
King of Kings	Sep 4, 2013
Komodo	Mar 6, 2018
Kramnik versus Deep Fritz 2006	Nov 28, 2017
Loop (Program)	Mar 14, 2017
Maarten Schadd	Jan 2, 2017
Mathematician	Apr 9, 2018
Parallel Search	Dec 30, 2017
Peter Berger	Feb 29, 2016
Rondo	Jan 7, 2016
Rybka Controversy	Jan 18, 2018
Shannon Trophy	Jul 7, 2017
Stockfish	Apr 7, 2018
Thread	Apr 22, 2018
University of Illinois at Urbana-Champaign	Oct 12, 2016
Volker Pittlik	Sep 4, 2013
WCCC 2005	Dec 27, 2016
WCCC 2006	Jan 28, 2018
WCCC 2007	Jan 2, 2017
WCRCC 2007	Nov 21, 2016
Who's Who	Sep 6, 2017
World Computer Chess Championship	Mar 6, 2018
Yngvi Björnsson	Jun 26, 2017
Zach Wegner	Jan 7, 2016
Zappa	Oct 24, 2017
Zappa versus Rybka 2007	Nov 25, 2017

Up one level

Wikispaces : chessprogramming - items matching description

AnMon

Table of Contents

Photos & Games

Description

See also

Forum Posts

External Links

Chess Engine

Misc

References

What links here?

Chess Tiger

Table of Contents

Descriptions

1997

1999

Screenshots

MS-DOS

iOS

Selected Games

See also

Forum Posts

1998 ...

2000 ...

2005 ...

2010 ...

External Links

Chess Tiger

Misc

References

What links here?

Comet

Table of Contents

Screenshot

Description

Selected Games

See also

Forum Posts

1997 ...

2000 ...

2005 ...

2010 ...

External Links

Chess Engine

Comet

References

What links here?

Crafty

Table of Contents

Team Members

Tournaments

Descriptions

1997

2008

Generation II

Leading or Trailing Zeros

LSB

Last One

Selected Games

WCCC 2004

WCCC 2006

Copyright

Crafty Clones

See also

Publications

Forum Posts

1995 ...

2000 ...

2005 ...

2010 ...

2015 ...

External Links

Chess Engine

Misc

References

What links here?

Doctor?

Table of Contents

Program Characteristics