Wikispaces : chessprogramming - items matching description

Amateur

GerdIsenberg — Sat, 25 Feb 2012 10:40:10 GMT

Home * Engines * Amateur

Amateur,
a free chess engine by Will Singleton written in C. Amateur's primary platform was the Macintosh, it was early used as engine for the Fixation internet chess interface. In July 2002 Version 2.0 was released compatible with the Chess Engine Communication Protocol. Amateur's version history ^[1] indicates the use of null move pruning in conjunction with multi-cut. Amateur played multiple online tournaments such as the CCT Tournaments at FICS and ICC.

History

Amateur is a development of a program already written in 1977 in 6502 assembly, then expanded in 1986 on the 68000 ^[2]:

My current program is a development of a program I wrote in 1977 in 6502 assembly, and then expanded in 1986 on the 68000. I converted it to C last year, and then over time put in all I learned from this newsgroup and a full set of ICCA journals. It's been a slow, incremental process, but at this point, right now, I can say that it's an honest program, and I know what's in it and how it works.

In 2002 Will released a WinBoard version, also mentioning starting from scratch again ^[3]:

I released it to kind of memorialize all the work that went into it, and I certainly have learned a lot. But I can't improve it much more, given the limitations of its "design." So the next version will be a new project, from scratch. The goal is to have a good, extensible design, using whatever knowledge I've gained along the way.

Forum Posts

Has this name been used before? by Willie Wood, CCC, December 12, 1997
Winboard for the Mac by Willie Wood, CCC, January 22, 1998
Under 2600 Club by Will Singleton, CCC, December 07, 1998
amateur experiment by Will Singleton, CCC, March 26, 2000
New versions of Fixation and Amateur released by Will Singleton, CCC, August 29, 2000
Re: Amateur new winboard engine by Will Singleton, CCC, July 12, 2002

External Links

References

^ Amateur from WBEC Ridderkerk
^ Re: Bionic Vs Crafty Debate: some data required by Will Singleton, CCC, January 25, 1999
^ Re: Amateur new winboard engine by Will Singleton, CCC, July 12, 2002

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
Amateur	Feb 25, 2012
CCT1	Dec 30, 2012
CCT2	Sep 7, 2012
CCT3	Feb 14, 2013
CCT4	Apr 22, 2013
CCT5	Feb 22, 2013
CCT6	May 29, 2014
CCT7	Dec 16, 2017
CCT9	Aug 25, 2013
Engines	Mar 10, 2018
Slow Chess	May 17, 2016
Terra	Feb 11, 2015
WCRCC 2008	Nov 21, 2016
Will Singleton	Mar 6, 2015

Up one Level

Arasan

GerdIsenberg — Sun, 08 Apr 2018 18:38:18 GMT

Home * Engines * Arasan

அரசன்		Arasan, an open source engine written by Jon Dart in C++. Arasan's development started in the early 90s, the first version, released in 1994 was a 16-bit program running under Windows 3.1 using an 8x8 Board, incremental updated attack tables and its own GUI, evolving to a portable 32-bit and later 64-bit program, utilizing bitboards to determine its sliding piece attacks with rotated bitboard lookups. In 2008, rotated were replaced by Magic bitboards, which gave Arasan about a 20-25% speedup ^[1]. Despite its own GUI, Arasan early supported the Chess Engine Communication Protocol and later UCI as well, to run under Windows, Linux and Mac OS ^[2]. The latest version of Arasan and all major versions, including Version 1.0 from March 1994, are available as source code from the Arasan.org site ^[3] . Jon's change logs, bug fix reports and tournament reports over the time are available from forum archives, as well the recent ones from the Arasan blog ^[4]
அரசன் ^[5] (Arasan) , King in Tamil language ^[6]

Bitboard Trials

Jon Dart, May 1996 ^[7]

Lately I've been working on a new major release of Arasan. I have spent the last few months working on the search engine, trying to improve speed and performance. I tried some experiments with a bitboard move representation, but I have backed off on that for now.

With bitboards, I got a nice reduction in tree size (bitboards allow a more accurate swap-down analysis than I had before, and this improves move ordering and allows better "culling" of losing captures in the quiescence search).

However, currently the program relies pretty heavily on incrementally generated attack information, and I didn't have that implemented to work with bitboards, so I had to compute attacks as needed. Unfortunately, the current program "needs" to do this much more often than Crafty does, so the loss from computing attacks more than balanced out the gains from bitboards. This is fixable, I'm sure, but I've put off further work on it for now.

Magic Bitboards

Jon Dart, August 2008 ^[8] :

The main change has been to re-work the code to use "magic" bitboard logic instead of rotated bitboards. This has given about a 20-25% speedup. I have also had to re-write the evaluation function to take advantage of bitboard attack functions for king safety and mobility.

PEXT/PDEP Bitboards

Arasan 20.3, released in November 2017, performs PEXT/PDEP Bitboards if compiled for the BMI2 instruction set ^[9] to replace Fancy Magic Bitboards in looking up sliding piece attacks ^[10]

Automated Tuning

Arasan 19.2, released in November 2016, now applies Texel's Tuning Method by default and supports the Adam gradient descent algorithm ^[11] ^[12].

Tournament Play

Arasan went online in December, 1996 ^[13] , and played almost all major online computer chess tournaments, such as CCT Tournaments, ACCA Americas' Computer Chess Championship, ACCA World Computer Rapid Chess Championship, TCEC, and International Gsei Web Tournaments. Arasan 15.1 ^[14] won the ACCA 2012 ^[15] , Arasan 16.0 the WCRCC 2013 ^[16] . Over the board, Arasan is active at the CSVN Programmers Tournaments operated by Tessa Pijl. Arasan was runner-up behind The Baron in May 2014 at the PT 46 one point behind, as well in June 2015 at the PT 48 with the same score according to the tiebreak rules ^[17].

Photos & Games

PT 48, Two Kings fighting, Johan de Koning and Tessa Pijl in Arasan vs. The King ^[18]

[Event "PT 48"]
[Site "Leiden, NL"]
[Date "2015.06.14"]
[Round "7"]
[White "Arasan"]
[Black "The King"]
[Result "1-0"]
 
1.d4 d5 2.c4 c6 3.Nf3 Nf6 4.Nc3 e6 5.e3 Nbd7 6.Bd3 dxc4 7.Bxc4 b5 8.Bd3 a6 
9.a4 b4 10.Ne4 c5 11.Nxf6+ Nxf6 12.dxc5 Bxc5 13.e4 Bb7 14.Qe2 O-O 15.O-O e5 
16.Bg5 h6 17.Bh4 Qd6 18.Bg3 Rfe8 19.Rfd1 Re7 20.Bh4 Qc6 21.Rac1 Rc8 22.Rc4 Re6 
23.Bxf6 Rxf6 24.Rdc1 Qb6 25.Kh1 a5 26.Qc2 b3 27.Qe2 Qd6 28.R4c3 Rf4 29.g3 Rf6 
30.Bc4 Rb8 31.Rxb3 Bb4 32.Rd3 Qc7 33.Kg2 Rf8 34.Rdd1 Rc6 35.b3 Re8 36.Kg1 Rc8 
37.Rd5 Re6 38.Rd3 Rf6 39.Rcd1 Re8 40.Nh4 Qb6 41.Nf5 Rf8 42.Rf3 Kh8 43.Nh4 Kg8 
44.Rd7 Bc8 45.Rd5 Rd6 46.Rxd6 Qxd6 47.Rd3 Qc7 48.Qh5 Kh7 49.Nf3 f6 50.Nh4 Bd7 
51.Bf7 Bc8 52.Bg6+ Kg8 53.Bf5 Qc2 54.Qf3 Re8 55.Kg2 Rf8 56.Rd5 Bc5 57.Bxc8 Rxc8 
58.Rd7 Bf8 59.Qg4 h5 60.Qg6 Qe2 61.Nf3 Qc2 62.Qf7+ Kh8 63.Qxh5+ Kg8 64.Nd2 Rb8 
65.g4 Rc8 66.Qf7+ Kh8 67.Qh5+ Kg8 68.Qg6 Kh8 69.Qf5 Kg8 70.g5 fxg5 71.Nf3 Qc6 
72.Nxg5 Qh6 73.Rd3 Rc7 74.Rf3 Bb4 75.Rh3 Bf8 76.Rxh6 1-0

Forum Posts

1995 ...

Arasan 2.0 (Windows chess program) available via ftp by Jon Dart, rec.games.chess, July 4, 1995
Arasan 2.1 (Windows chess program) available via ftp by Jon Dart, rec.games.chess.misc, October 23, 1995
Arasan 2.2 (Windows chess program) available via ftp by Jon Dart, rec.games.chess.misc, December 10, 1995
Arasan progress report by Jon Dart, rgcc, May 23, 1996
Arasan 3.0 (Windows chess program) available by Jon Dart, rgcc, July 8, 1996
Arasan goes online by Jon Dart, rgcc, January 6, 1997
Arasan 4.0 is available by Jon Dart, rgcc, July 15, 1997
Arasan 5.0 released by Jon Dart, CCC, January 13, 1999

2000 ...

Arasan 5.4 released by Jon Dart, CCC, May 25, 2000
Arasan vs. IM Paunovic by Jon Dart, CCC, June 16, 2000
Arasan now under Linux by Jon Dart, CCC, September 02, 2000
A few notes from Arasan's games in CCT2 by Jon Dart, CCC, November 05, 2000 » CCT2
CCT4 notes - Arasan by Jon Dart, CCC, January 20, 2002 » CCT4
Arasan 6.0 by Jon Dart, CCC, September 24, 2002
Arasan 6.3 by Jon Dart, CCC, January 26, 2003
Arasan 7.0 by Jon Dart, CCC, August 09, 2003
Arasan 7.4 by Jon Dart, CCC, February 28, 2004
Arasan 7.4 64-bit Speedup by Slater Wold, CCC, March 30, 2004
Arasan 8.0 by Jon Dart, CCC, August 22, 2004
Arasan 8.2 by Jon Dart, CCC, November 26, 2004

2005 ...

Arasan 8.4 by Jon Dart, CCC, February 26, 2005
Arasan in CCT8 by Jon Dart, CCC, February 26, 2006 » CCT8
Arasan @ WCRCC tournament by Jon Dart, CCC, July 23, 2007 » WCRCC 2007
Arasan 10.0 by Jon Dart, CCC, September 02, 2007
Arasan 10.2 by Jon Dart, CCC, February 16, 2008
Arasan 10.4 by Jon Dart, CCC, June 27, 2008
Arasan 11.0 by Jon Dart, CCC, November 28, 2008
Arasan 11.3 by Jon Dart, CCC, March 24, 2009
Arasan 11.4 by Jon Dart, CCC, June 20, 2009
Arasan 11.5 by Jon Dart, CCC, September 05, 2009
Arasan 11.6 by Jon Dart, CCC, November 18, 2009

2010 ...

Arasan 11.7 by Jon Dart, CCC, February 07, 2010
Arasan 12.0 released by Jon Dart, CCC, August 07, 2010
Arasan 12.2 released by Jon Dart, CCC, November 11, 2010

2011

Arasan 12.3 released by Jon Dart, CCC, February 02, 2011
Arasan 13.0 by Jon Dart, CCC, August 18, 2011
Arasan 13.1 by Jon Dart, CCC, August 23, 2011
MORE about Arasan 13.1 by Fernando Villegas, CCC, August 26, 2011
Arasan 13.2 by Jon Dart, CCC, October 02, 2011
Arasan 13.3 by Jon Dart, CCC, November 14, 2011 » ACCA 2011
Arasan 13.4 by Jon Dart, CCC, December 07, 2011

2012

Arasan 14.0 by Jon Dart, CCC, March 04, 2012
Arasan 14.2 by Jon Dart, CCC, June 12, 2012
Arasan 14.3 by Jon Dart, CCC, July 18, 2012
Arasan 15.0 by Jon Dart, CCC, September 20, 2012
Arasan 15.1 by Jon Dart, CCC, November 19, 2012

2013

Arasan 15.2 by Jon Dart, CCC, February 26, 2013
Arasan 15.4 by Jon Dart, CCC, April 24, 2013
Arasan 15.6 by Jon Dart, CCC, May 21, 2013
Arasan on github by Jon Dart, CCC, May 22, 2013 ^[19]
Arasan games from WCRCC by Jon Dart, CCC, July 21, 2013 » WCRCC 2013
Arasan 16.0 by Jon Dart, CCC, July 24, 2013
Arasan 16.1 by Jon Dart, CCC, September 01, 2013
Arasan 16.2 by Jon Dart, CCC, October 25, 2013
Arasan 16.3 by Jon Dart, CCC, December 06, 2013

2014

test position: Rookie-Arasan by Jon Dart, CCC, January 27, 2014 » Rookie, Zugzwang
Arasan 17.0 by Jon Dart, CCC, March 27, 2014
Arasan GUI fixes by Jon Dart, CCC, April 02, 2014
Arasan 17.1 by Jon Dart, CCC, May 07, 2014
Arasan 17.2 by Jon Dart, CCC, May 30, 2014
Arasan 17.3 by Jon Dart, CCC, September 01, 2014
Arasan 17.4 by Jon Dart, CCC, October 08, 2014

2015 ...

Arasan 17.5 by Jon Dart, CCC, January 24, 2015
Experiments with eval tuning by Jon Dart, CCC, March 10, 2015 » Automated Tuning, Texel's Tuning Method
Arasan 18.0 by Jon Dart, CCC, July 30, 2015
Arasan 18.1 by Jon Dart, CCC, November 02, 2015
Arasan 18.2 by Jon Dart, CCC, December 03, 2015

2016

Arasan 18.3 by Jon Dart, CCC, February 02, 2016
Arasan Syzygy support (working with Windows, too) by Jon Dart, CCC, March 10, 2016 » Syzygy Bases
Arasan 19.0 + updated test suite by Jon Dart, CCC, April 29, 2016
Arasan 19.1 by Jon Dart, CCC, August 09, 2016
Arasan 19.2 by Jon Dart, CCC, November 03, 2016

2017

Arasan 20.0 by Jon Dart, CCC, January 31, 2017
building for Android by Jon Dart, CCC, April 19, 2017 » Android
Arasan 20.1 by Jon Dart, CCC, April 28, 2017
Arasan Programmer's Guide by Jon Dart, CCC, June 21, 2017
Arasan 20.2 by Jon Dart, CCC, July 15, 2017
Arasan 20.3 by Jon Dart, CCC, November 05, 2017

2018

Arasan 20.4 by Jon Dart, CCC, January 03, 2018
Arasan 20.4.1 by Jon Dart, CCC, January 05, 2018
Arasan 20.5 by Jon Dart, CCC, April 08, 2018

External Links

Chess Engine

Arasan Chess by Jon Dart
Arasan Programmer's Guide by Jon Dart ^[20]
Arasan Test Suite
Arasan 8.4 released, short interview with Jon Dart by Frank Quisinsky, March 01, 2005, Arena Chess GUI, Archive 5, 72
jdart1/arasan-chess · GitHub ^[21]
Arasan 17.0 64-bit in CCRL 40/40
Arasan 18.0 64-bit in CCRL 40/40

Misc

References

^ Arasan Blog - Aug 26, 2008
^ Arasan chess
^ Arasan Downloads
^ Arasan Tech Blog
^ Tamil script from Wikipedia
^ அரசன் (சதுரங்கம்) - தமிழ் விக்கிப்பீடியா
^ Arasan progress report by Jon Dart, rgcc, May 23, 1996
^ Arasan Blog - Aug 26, 2008
^ Arasan 20.3 by Jon Dart, CCC, November 05, 2017
^ arasan_source20.3.zip/src/attacks.h
^ Arasan 19.2 by Jon Dart, CCC, November 03, 2016
^ Diederik P. Kingma, Jimmy Lei Ba (2015). Adam: A Method for Stochastic Optimization. arXiv:1412.6980v8, ICLR 2015
^ Arasan goes online by Jon Dart, rgcc, January 6, 1997
^ Arasan 15.1 by Jon Dart, CCC, November 19, 2012
^ Seventh Annual ACCA Americas' Computer Chess Championships by Jon Dart, CCC, November 18, 2012
^ Arasan games from WCRCC by Jon Dart, CCC, July 21, 2013
^ Baron 1st, Arasan 2nd by Jon Dart, CCC, June 14, 2015
^ PT48 Round 7
^ jdart1/arasan-chess · GitHub
^ Arasan Programmer's Guide by Jon Dart, CCC, June 21, 2017
^ Arasan on github by Jon Dart, CCC, May 22, 2013

What links here?

Page	Date Edited
1st CSVN OIT	May 18, 2014
Abrok	Nov 28, 2014
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
ACCA Americas' Computer Chess Championship	Nov 20, 2014
ACCA World Computer Rapid Chess Championship	Jun 27, 2017
Alaric	Mar 4, 2014
Alfil	Sep 3, 2015
Android	Jan 9, 2018
Arasan	Apr 8, 2018
Automated Tuning	Feb 27, 2018
CCT10	May 5, 2013
CCT11	Feb 17, 2015
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
DGT Pi	Oct 22, 2017
Donna	Aug 17, 2017
Eigenmann Endgame Test	Jun 1, 2017
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Fernando Villegas	Aug 15, 2016
Hossa	Jan 7, 2016
IGT 2017	Oct 2, 2017
IGWT 2013	Jun 23, 2014
IGWT 2014	Feb 2, 2016
IGWT III	May 15, 2017
IGWT IV	May 17, 2017
Jon Dart	Dec 17, 2017
King	Feb 26, 2013
Leila	May 8, 2017
Magic Bitboards	Apr 13, 2018
MessChess	Mar 6, 2014
Neural Networks	Mar 12, 2018
Nightmare NL	Dec 12, 2016
Pepito	Nov 27, 2014
PicoChess	Mar 12, 2018
Pseudorandom number generator	May 11, 2017
PT 46	Dec 9, 2014
PT 47	Dec 1, 2014
PT 48	Oct 15, 2015
PuppetMaster	Sep 17, 2015
Recommended Reading	Nov 17, 2017
RomiChess	Jan 2, 2018
Rookie	Jan 7, 2016
RuyTune	Jun 8, 2017
Syzygy Bases	Apr 19, 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
Terra	Feb 11, 2015
Tessa Pijl	Oct 28, 2017
Test-Positions	Feb 25, 2018
Texel's Tuning Method	Dec 2, 2017
WCRCC 2007	Nov 21, 2016
WCRCC 2008	Nov 21, 2016
WCRCC 2010	Jul 14, 2014
WCRCC 2012	Jul 14, 2014
WCRCC 2013	Jul 14, 2014
WCRCC 2014	Jul 27, 2014
WCRCC 2015	Jul 19, 2015
WCRCC 2016	Jun 27, 2017
WCRCC 2017	Jun 27, 2017
Witchess	Apr 22, 2015
Zugzwang	Dec 8, 2017

Up one Level

Arthur

GerdIsenberg — Thu, 07 Jan 2016 18:10:46 GMT

Home * Engines * Arthur

		Arthur, a Chess Engine Communication Protocol compatible, portable chess engine written by Walter Ravenek in the 90s, with an own graphical user interface for the Apple Macintosh computer. Arthur played various Dutch Open Computer Chess Championships with strong results, for instance becoming third at the DOCCC 1998 behind The King and CilkChess. It further played multiple Aegon Tournaments in the 90s, the IPCCC 1994, the WMCCC 1997 in Paris and the WCCC 1999 in Paderborn.
Statue of King Arthur ^[1]

Descriptions

from the ICGA tournament site ^[2]

1997

Arthur is an amateur chess program that has been developed as a literate program, i.e., with description and source code integrated in a single document. The complete print-out is some 500 pages. The program uses conventional search techniques, with some specific extensions developed by the author. The program is knowledge intensive and plays mainly positional games. Arthur has been a regular guest in the AEGON Man vs. Machine tournaments and the Open Dutch Computer Chess Championships. Over the last three years it has finished between the top amateur programs.

1999

Arthur is a strong Dutch amateur program. It has finished as the best amateur program in the Open Dutch Computer Chess Championships for the last three years, performing reasonably well against commercial programs. The program consists of a platform independent chess engine, which is connected to a graphical user interface for the Macintosh. A WinBoard version will be available in the near future. Arthur is quite capable tactically, but it tends to play a positional game, when given the chance.

Publications

Raymond Smullyan (2010). King Arthur in Search of His Dog and Other Curious Puzzles. Dover Books on Mathematics

Forum Posts

Re: Computer Judgment by Walter Ravenek, rgcc, October 25, 1995
Re: Dutch CCC - Arthur on 300MHz G3 2nd weekend by Richard A. Fowell, CCC, November 29, 1998

External Links

Chess Engine

Arthur's ICGA Tournaments

Misc

References

^ Statue of King Arthur, designed by Albrecht Dürer and cast by Peter Vischer the Elder, early 16th century, Arthur from Wikipedia
^ Arthur's ICGA Tournaments

What links here?

Page	Date Edited
Aegon 1995	Apr 6, 2017
Aegon 1996	Jan 22, 2017
Aegon 1997	Apr 7, 2017
Arthur	Jan 7, 2016
DOCCC 1993	Dec 12, 2016
DOCCC 1994	Aug 15, 2015
DOCCC 1995	Jun 7, 2016
DOCCC 1996	Jun 7, 2016
DOCCC 1997	Aug 15, 2015
DOCCC 1998	Feb 25, 2018
Engines	Mar 10, 2018
Eowyn	Aug 24, 2013
IPCCC 1994	Jul 31, 2013
PowerPC	Oct 6, 2017
Walter Ravenek	Jan 7, 2016
WCCC 1999	Jul 13, 2017
WMCCC 1997	Apr 4, 2017

Up one level

Battle Chess

GerdIsenberg — Mon, 12 Dec 2016 15:53:38 GMT

Home * Engines * Battle Chess

		Battle Chess, a chess program, famous for its animated move and specially capture sequences in 3D mode, released for various home and personal computer platforms as well as video game consoles, beside others for Apple II, Commodore 64, Commodore Amiga, Atari ST, IBM PC, Apple Macintosh, Acorn Archimedes, 3DO and Nintendo Entertainment System. The game was developed by a team around Brian Fargo and Michael Quarles, including Jay Patel, Bruce Schlickbernd, and Todd Camasta ^[1], released in 1988 by Fargo's company Interplay ^[2] soon after ending the relationship with Electronic Arts ^[3].
Cover art of Battle Chess ^[4]

Games

Battle Chess 4000 for MS-DOS played the Harvard Cup 1993, and surprised by winning from Michael Rohde and a drawing from Boris Gulko ^[5] ^[6]:

[Event "4th Harvard Cup G/25"]
[Site "Boston, MA USA"]
[Date "1993.11.06"]
[Round "03"]
[White "Michael Rohde"]
[Black "BattleChess 4000 SVGA"]
[Result "0-1"]
 
1.Nf3 Nf6 2.c4 g6 3.Nc3 d5 4.cxd5 Nxd5 5.Qa4+ Nc6 6.Nxd5 Qxd5 7.e4 Qe6
8.Bb5 Bd7 9.O-O Bg7 10.d3 Qd6 11.Be3 Bxb2 12.Rab1 Bg7 13.d4 a6
14.e5 Qe6 15.d5 Qxd5 16.Rfd1 Qe6 17.Bc4 Nxe5 18.Bxe6 Nxf3+ 19.gxf3 Bxa4
20.Bb3 Bc6 21.Bd5 Bxd5 22.Rxd5 e6 23.Rd2 b6 24.Rc2 Be5 25.f4 Bd6 26.Kg2 O-O
27.Rc6 Rfd8 28.Kf3 Kf8 29.Ke2 Ke7 30.h3 Kf6 31.Rd1 Rab8 32.Kf3 Kf5
33.Rg1 h6 34.h4 Rd7 35.Rcc1 Be7 36.Rh1 h5 37.Rc6 Rb7 38.Rh2 Rd3 39.Rh1 Bd6
40.Rg1 Bxf4 0-1
 
 
[Event "4th Harvard Cup G/25"]
[Site "Boston, MA USA"]
[Date "1993.11.06"]
[Round "05"]
[White "Boris Gulko"]
[Black "BattleChess 4000 SVGA"]
[Result "1/2-1/2"]
 
1.d4 Nf6 2.Bf4 d5 3.e3 Bf5 4.c4 Nc6 5.Nc3 e6 6.Nf3 Bb4 7.a3 Bxc3+
8.bxc3 O-O 9.Bg5 Qe7 10.Bd3 Bxd3 11.Qxd3 dxc4 12.Qxc4 h6 13.Bh4 Qd8
14.O-O Qd5 15.Qd3 Ne4 16.Rab1 Nd6 17.Nd2 Ne5 18.Qe2 Ng6 19.Bg3 Qc6
20.c4 Nf5 21.Rb4 Nxg3 22.hxg3 b6 23.Qh5 Rad8 24.Rc1 Rd6 25.Qb5 e5
26.Qxc6 Rxc6 27.d5 Rd6 28.e4 Re8 29.c5 Rd7 30.Ra4 Ra8 31.cxb6 cxb6
32.Rc6 Re8 33.Rac4 f6 34.a4 Ra8 35.Kf1 Kf7 36.Nf3 Ne7 37.Rc7 Ke8 38.Rc2
Kd8 39.R7c3 Rc8 40.Rxc8+ Nxc8 41.Ke2 Nd6 42.Kd3 f5 43.Nxe5 fxe4+ 44.Kd4
Rc7 45.Nc6+ Ke8 46.g4 Kd7 47.Re2 Kc8 48.Ke5 Kd7 49.Rc2 Rc8 50.Kd4 Rc7
51.Rc3 Ke8 52.Ke5 Kd7 53.Kd4 Ke8 54.Re3 Kf7 55.f3 exf3 56.gxf3 h5
57.Re6 Rxc6 58.dxc6 Kxe6 59.gxh5 Ne8 60.Kc4 Kd6 61.Kd4 Nf6 62.c7 Kxc7
63.Ke5 Nxh5 64.Kf5 Ng3+ 65.Kg6 Ne2 66.Kxg7 Nd4 67.f4 Ne6+ 68.Kf6 Nxf4
69.Ke5 Ne2 70.Kd5 Nc3+ 71.Kc4 Nxa4 72.Kb5 Nc5 73.Kb4 Kd6 74.Kb5 Kd5
75.Kb4 a6 76.Kc3 a5 77.Kb2 b5 78.Kc3 b4+ 79.Kb2 Kc4 80.Kc2 Nd3
81.Kd2 b3 82.Ke3 b2 83.Ke4 a4 84.Kf5 a3 85.Ke6 Nb4 1/2-1/2

Forum Posts

Battle Chess 4000 + NT4 = Yuk by Mark Taylor, rgcc, April 9, 1999
Deep Thought, Kasparov, Fidelity, Ferret, CM4000,Junior, Battle Chess by K. Burcham, CCC, March 23, 2002
Chess Programming Questions by Randall Jouett, rgcc, May 21, 2002
Battle Chess needs help by Julien Marcel, CCC, May 17, 2012

External Links

Battle Chess from Wikipedia
Commodore 64/128 Old Computer Chess Game Collection - Battle Chess from The Spacious Mind » Commodore 64, Commodore 128
Warring Battle Chess reactions | Apple II Bits » Apple II
Battle Chess series - MobyGames
Battle Chess (1993) 3DO cover art - MobyGames
Battle Chess for 3DO (1993) - MobyGames
Battle Chess 4000 Screenshots for DOS - MobyGames
Battle Chess Special Edition - GOG.com
Interplay - Battle Chess
Interplay wins injunction against Topware's Battle vs Chess game by John Callaham, December 25, 2010
Interplay Wins over TopWare in "Battle vs. Chess" Affair by Theo Valich, February 12, 2012
Battle Chess - Subdued Software LLC
Amazon.com: Battle Chess Bundle (Jewel Case): Video Games
Battle Chess for Windows from Home of the Underdogs » Windows
Starring the Computer - The Rachel Papers (1989) » Amiga
Battle Chess for Acorn Archimedes - GameFAQs » Acorn Archimedes
The Computer Chronicles - Amiga 2500 (1989), YouTube Video
Battle Chess starting around 8:30 ^[7]

References

^ Commodore 64/128 Old Computer Chess Game Collection - Battle Chess from The Spacious Mind
^ Interplay - Battle Chess
^ Battle Chess from Wikipedia
^ Battle Chess from Wikipedia
^ Larry Kaufman (1993). The 4th Harvard Cup. Computer Chess Reports, Vol. 4, No. 2
^ Downloads | Man-Computer | Games, CSVN site
^ Re: Kathlen Spracklen's TV interview about Sargon (1985) by Julien Marcel, CCC, January 12, 2014 » Kathe Spracklen - Lady Sargon

What links here?

Page	Date Edited
Acorn Archimedes	Dec 17, 2016
Amiga	Mar 24, 2016
Apple II	Dec 22, 2017
Battle Chess	Dec 12, 2016
Death Chess 5000	Apr 5, 2013
Engines	Mar 10, 2018
Grandmaster Chess	Dec 7, 2016
Harvard Cup 1993	Nov 8, 2016
Heuristic Software	May 4, 2013
Virtual Chess	Mar 25, 2017

Up one level

Belofte

GerdIsenberg — Thu, 29 Jun 2017 16:00:04 GMT

Home * Engines * Belofte

Belofte,
a chess engine written in C by Yves De Billoëz and released under the GPL license v2. Belofte is a console application, but supports the Chess Engine Communication Protocol aka WinBoard/XBoard protocol.

Features

The engine supports Winboard v1 and v2 protocol alongside the Belofte protocol. The engine also supports EPD test sets and can be run with initialization files. Games are saved in PGN format. PGN files can be converted into an opening book. Internally, Belofte keeps a two-dimensional 8x8 board performing pure negamax alpha-beta so far with a once estimated depth rather than iterative deepening ^[1].

History

Development started in 2005 and version 0.2.x made appearance on freechess.org chess server and in source code. At that time, it was released with a custom license (but still free for the open source community). Versions 0.3 till 0.6 were converted to C++ and developed under windows but compilation on other platforms failed. Source code for those versions is available. Look for the branch in the source repository. In 2017, the old version was re-released under GPL license and a new version 0.9.x is making its appearance. It is a branch from the 0.2 release and gradually, all changes from the 0.3+ branches will be included.

Rating

The engine performs currently at 1000-1200 Elo. In some tournaments, it achieved around 1500 ELO.

Forum Posts

New engine: belofte by Yves De Billoëz, CCC, June 29, 2017

External links

References

^ belofte / Code / [6fd788] /src/alg1_search.c

What links here?

Page	Date Edited
Engines	Mar 10, 2018

Up one level

Bestia

GerdIsenberg — Sat, 05 Jan 2013 17:15:26 GMT

Home * Engines * Bestia

		Bestia, a Chess Engine Communication Protocol compliant chess engine written by George Lyapko in Pascal and compiled with Delphi ^[1], first released in July 2000 ^[2], with executables to run under Windows, and more recently, to x86-64 Mac OS ^[3]. Beside the transposition table, Bestia features a pawn hash table, and is able to learn from its failures ^[4] ^[5]. Bestia participated at three Hungarian Chessprogram Open, and won two times operated by Gábor Szõts, the MASPV 2001 and the MASPV 2003, both with a 100% score.
Number of the beast ^[6]

Photos & Games

MASPV 2003, round 4, Bestia - Merlin ^[7] Gábor Szõts and Balázs Jákó ^[8]

[Event "MASPV 2003"]
[Site " Sopron, Hungary"]
[Date "2003.04.19"]
[Round "4"]
[White "Bestia_094"]
[Black "Merlin"]
[Result "1-0"]
 
1.d4 d6 2.e4 g6 3.Nc3 Nf6 4.Be3 a6 5.Nf3 Bg7 6.a4 Nbd7 7.Bc4 O-O 8.e5 
dxe5 9.dxe5 Ng4 10.e6 Nde5 11.exf7+ Nxf7 12.Ng5 Qxd1+ 13.Rxd1 Ne5
14.Bd5 c6 15.Bb3 Kh8 16.O-O Nxg5 17.Bxg5 Bg4 18.f3 Bxf3 19.gxf3 Nxf3+
20.Rxf3 Rxf3 21.Bxe7 Re8 22.Rd7 Bxc3 23.bxc3 b6 24.Kg2 Rf5 25.Be6 Rf4
26.Bg5 Rff8 27.Bf7 Rxf7 28.Rxf7 Kg8 29.Rf6 Rc8 30.Be3 b5 31.a5 Kg7
32.Rd6 Kg8 33.Kf3 Rf8+ 34.Ke2 Rc8 35.Rd7 Re8 36.Ra7 Re4 37.Rxa6 Kf7
38.Rxc6 Ke8 39.Rb6 Ra4 40.Rxb5 Kd7 41.Kd3 Ra1 42.Rb7+ Kc8 43.Ra7 h5
44.a6 Kb8 45.Rb7+ Ka8 46.Rb6 Rd1+ 47.Ke2 Rd8 48.Rxg6 Rh8 49.h4 Kb8
50.a7+ Ka8 51.Bd4 Rf8 52.Rg5 Re8+ 53.Kd3 Rf8 54.c4 Rf3+ 55.Ke4 Rf8
56.Rxh5 Rc8 57.Re5 Rg8 58.h5 Rg4+ 59.Kd3 Rg3+ 60.Be3 Rg8 61.h6 Rc8
62.h7 Rh8 63.Rb5 1-0

Forum Posts

New WB engine "Bestia" available for download by George Lyapko, Winboard Forum, July 05, 2000
Surpising result from Bestia v0.2d by George Lyapko, Winboard Forum, September 06, 2000
Bestia v0.3d available by George Lyapko, Winboard Forum, September 26, 2000
Bestia lives up to its name by Dann Corbit, Winboard Forum, January 31, 2001
Bestia 0.3H verses Quark 1.15 Alpha by Dann Corbit, Winboard Forum, February 05, 2001 » Quark
Bestia 0.8 available for download by George Lyapko, Winboard Forum, July 20, 2001
Commented games Utzinger-Bestia 0.8 [40'/40] 1-0 by Kurt Utzinger, CCC, November 27, 2001
Stalemate trap(SOS-Delfi) by George Lyapko, Winboard Forum, December 18, 2001 » Stalemate, Test-Positions, SOS, Delfi
Which is the strongest Delphi chess program? by Andreas Herrmann, Winboard Forum, March 14, 2002 » Delphi
Bestia 0.90 vs Ufim 3.02 (1) 120'/40 (1/2) Commented game by Kurt Utzinger, Winboard Forum, March 04, 2003 » Ufim
Bestia 0.90 vs Ufim 3.02 (3) 120'/40 (1-0) Commented game by Kurt Utzinger, Winboard Forum, March 07, 2003
Bestia 0.90 vs Ufim 3.02 (5) 120'/40 [0-1] Commented game by Kurt Utzinger, Winboard Forum, March 08, 2003
Ufim 3.02 vs Bestia 090 (8) 120'/40 [1-0] Commented game by Kurt Utzinger, Winboard Forum, March 10, 2003
MASPV results - The champion is Bestia! by Gábor Szõts, Winboard Forum, April 22, 2003 » MASPV 2003
Olympiads 2004 : Bestia Nationality by Nicolas Normand, Winboard Forum, March 08, 2004
Re: How is learning triggered? by George Lyapko, Winboard Forum, May 25, 2006

External Links

Chess Engine

Free Winboard engine Bestia
Free Winboard engine Bestia from Wayback Machine
Bestia from WBEC Ridderkerk
Bestia 0.90 in CCRL 40/4
Bestia 0.90 in KCEC

Bestia Misc

Beast

References

^ MASPV 2001
^ New WB engine "Bestia" available for download by George Lyapko, Winboard Forum, July 05, 2000
^ Chess Engine List from Ron Murawski's Computer-Chess Wiki
^ Re: How is learning triggered? by George Lyapko, Winboard Forum, May 25, 2006
^ Bestia from WBEC Ridderkerk
^ The number of the beast is 666 by William Blake
^ MASPV 2003 - PGN
^ MASPV 2003 photos

What links here?

Page	Date Edited
Bestia	Jan 5, 2013
Engines	Mar 10, 2018
George Lyapko	Jan 14, 2013
Hungarian Chessprogram Open	Jan 6, 2013
MASPV 2001	Jan 9, 2013
MASPV 2003	Jan 9, 2013
MASPV 2007	May 5, 2013
Ufim	Mar 22, 2014

Up one level

Betsabe

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

Home * Engines * Betsabe

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

Description

Board Representation

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

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

Search

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

Evaluation

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

Selected Games

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

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

Forum Posts

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

External Links

Chess Engine

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

Misc

References

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

What links here?

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

Up one level

BikJump

GerdIsenberg — Mon, 11 Aug 2014 15:27:51 GMT

Java Version

Platforms

History and Future Plans

External Links

What Links Here?

Home * Engines * BikJump

BikJump,
an UCI chess engine written in C++ by Aart Bik that features:

UCI compliant chess engine (runs in e.g. Chessbase Fritz, Chess for Android, or Arena GUI).
Iterative deepening with alpha-beta pruning and quiescent search.
Transposition table, null move pruning, and tactical extensions.
Ability to query Nalimov Endgame Tablebases (3,4,5,6-piece) during search.

All source code of BikJump (except the probing and decompression code for the endgame tablebases, which are used with kind permission of Eugene Nalimov and Andrew Kadatch) has been built from the ground up by Aart as a simple after-hours project to gain some experience with chess engine programming and experiment with new ideas.

Java Version

A derived Java version is used as built-in engine in Chess for Android and Chess for Glass. This application also supports the Universal Chess Interface (UCI) and the Chess Engine Communication Protocol to allow users to play against more powerful third party engines or even play tournaments between engines.

Platforms

BikJump is available for the following platforms:

History and Future Plans

BikJump was first released In January, 2007. The first generation (v1.x) was based on a mailbox representation, and over time increased in strength from about 1750 to 2000 RUEL. The second and current generation (v2.x), based on a bitboard representation, was released in November, 2008. Aart now has started work on "Deep" BikJump, featuring multi-threading to perform the search in parallel (commonly referred to as SMP support). Upcoming versions will be designated with the suffix P (e.g. v2.1P) to denote this new parallel support.

External Links

What Links Here?

Page	Date Edited
Aart Bik	Mar 1, 2018
BikJump	Aug 11, 2014
Chess for Android	Mar 1, 2018
Chess for Glass	Dec 26, 2016
Eigenmann Endgame Test	Jun 1, 2017
Engines	Mar 10, 2018
Mathematician	Apr 9, 2018
PuppetMaster	Sep 17, 2015

Up one Level

BlackMamba

GerdIsenberg — Sat, 26 Nov 2016 20:37:27 GMT

Home * Engines * BlackMamba

		BlackMamba, a free UCI compliant chess engine by Matteo D'Annibale supported by Maurizio Platino ^[1], with Windows and Mac OS executables available. BlackMamba, a single core engine, apparently utilizing bitboards, features detection of pawn blockages and runtime detection of SSE42 population count and large page support ^[2]. The Italian Computer Chess Association - G 6 considers BlackMamba as "free" engine ^[3], which includes both derivative engines and engines whose teams do not accept examinations accordant to the current regulation of the G 6 for original engines ^[4].
Black mamba ^[5]

Forum Posts

Blackmamba 1.0 by Gabriel Leperlier, CCC, April 11, 2012
Blackmamba 1.2 by Matteo D'Annibale, CCC, December 28, 2012
Blackmamba 1.2 by Matteo D'Annibale, OpenChess Forum, December 28, 2012
BlackMamba 1.2c by Matteo D'Annibale, CCC, January 20, 2013
BlackMamba 1.4 - new release by Matteo D'Annibale, CCC, April 20, 2013
BlackMamba 2.0 by Matteo D'Annibale, CCC, February 08, 2014

External Links

Chess Engine

Misc

References

^ Le pagine dei chess engines italiani « G 6
^ BlackMamba chess engine
^ Black Mamba « G 6
^ Le pagine dei chess engines italiani « G 6 (Italian)
^ Black mamba in defensive posture, photo taken by Bill Love, Blue Chameleon Ventures, January 05, 2012

What links here?

Page	Date Edited
BlackMamba	Nov 26, 2016
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Matteo D'Annibale	Feb 8, 2014

Up one Level

CFish

GerdIsenberg — Thu, 01 Feb 2018 18:55:27 GMT

Home * Engines * Stockfish * CFish

		CFish, a port of Stockfish written in plain C by Ronald de Man, first published on GitHub in July 2016. Possibly inspired by the asmFish project to speed up Stockfish using a programming language closer to the machine, the purpose of CFish is to explore possible optimization issues of C versus C++ compilers ^[1].
Joachim Beuckelaer - Fish Market ^[2]

Forum Posts

2016

CFish by Dann Corbit, CCC, August 31, 2016
Cfish solves the dreaded URI hard problem by Dann Corbit, CCC, September 05, 2016
cfish for the mac by Michael B, CCC, September 11, 2016 » Macintosh
New CFish Windows binary (from today's code) by Dann Corbit, CCC, October 13, 2016
Cfish for the Mac by Michael B, CCC, October 17, 2016
Cfish 8 for the MacOS by Michael B, CCC, November 05, 2016

2017 ...

Cfish update -> macOS exe's for download by Michael B, CCC, November 13, 2017
Cfish-54302a... Search of startpos to depth 50 by Louis Zulli, CCC, January 17, 2018 » Initial Position
Cfish 9 is OUT! by Louis Zulli, CCC, January 31, 2018

External Links

GitHub - syzygy1/Cfish: C port of Stockfish

References

^ Re: CFish by Louis Zulli, CCC, September 01, 2016
^ Fish Market by Joachim Beuckelaer 16th century, Bonnefantenmuseum, Maastricht, Wikimedia Commons, Cod from Wikipedia

What links here?

Page	Date Edited
asmFish	Feb 14, 2018
CFish	Feb 1, 2018
Engines	Mar 10, 2018
Initial Position	Apr 14, 2018
Portfish	Sep 8, 2016
Ronald de Man	Nov 20, 2017
Stockfish	Apr 7, 2018
Syzygy Bases	Apr 19, 2018

Up one Level

Cheese

GerdIsenberg — Sat, 17 Feb 2018 16:49:43 GMT

Home * Engines * Cheese

		Cheese, a Chess Engine Communication Protocol and UCI compliant free chess engine by Patrice Duhamel, written in C. The development started in early 2006, using rotated bitboards and alpha-beta search, improving rapidly, and first released in October 2007 as version 1.0. Since 2012, one can expect yearly updates with steady improvements. Since version 1.8 in March 2016, Cheese is able to play Chess960 (FRC). It is available for all major platforms and operating systems, Windows, Linux, Mac OS and Android ^[1].
Coulommiers cheese ^[2]

Selected Features

^[3]

Board Representation

Search

Evaluation

Misc

Forum Posts

2006 ...

Testing and debugging chess engines by Patrice Duhamel, Winboard Forum, December 03, 2006 » Debugging
new engine : Cheese v1.0b by Patrice Duhamel, Winboard Forum, November 07, 2007
Cheese 1.1 by Patrice Duhamel, Winboard Forum, January 02, 2008
Cheese 1.1b by Patrice Duhamel, Winboard Forum, January 22, 2008
Cheese 1.2 released by Patrice Duhamel, CCC, May 24, 2008
Cheese 1.3 by Patrice Duhamel, CCC, November 01, 2008

2010 ...

Cheese 1.4 by Patrice Duhamel, CCC, March 17, 2012
Cheese 1.5 by Patrice Duhamel, CCC, July 06, 2013
Cheese 1.6 by Patrice Duhamel, CCC, May 10, 2014

2015 ...

Chess for Android by Patrice Duhamel, CCC, January 04, 2015 » Chess for Android
Cheese 1.7 by Patrice Duhamel, CCC, April 04, 2015
Cheese 1.8 by Patrice Duhamel, CCC, March 19, 2016
Cheese 1.9 by Patrice Duhamel, CCC, May 06, 2017
Cooking Cheese with Texel's tuning method by Patrice Duhamel, CCC, June 16, 2017 » Texel's Tuning Method
Cheese 1.9.1 by Patrice Duhamel, CCC, September 16, 2017
Cheese 1.9.2 by Patrice Duhamel, CCC, February 17, 2018

External Links

Chess engine

Misc

References

^ Cheese Chess - Downloads
^ A Coulommiers cheese made from unpasteurised cow's milk, Image by Myrabella, May 13, 2010, CC BY-SA 3.0, Wikimedia Commons
^ based on Cheese Chess - Features

What links here?

Page	Date Edited
Cheese	Feb 17, 2018
Chess for Android	Mar 1, 2018
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Quark	May 11, 2017
Texel's Tuning Method	Dec 2, 2017

Up one Level

Cheng

GerdIsenberg — Sun, 30 Jul 2017 19:17:42 GMT

Home * Engines * Cheng

Cheng,
an UCI compliant open source chess engine by Martin Sedlak, written in C++ as exercise in generic programming, first released as Cheng3 in April 2011. Cheng is able to play Chess960, target platforms are Windows, Linux, Mac OS and Android systems ^[1]. Cheng4 0.38, released in January 2015, is available at GitHub under the permissive zlib license ^[2].

Description

Cheng ^[3] is a bitboard engine using fancy magic bitboards to determine sliding piece attacks. It applies staged move generation.

Search

The parallel multi-threaded search performs PVS alpha-beta with a shared transposition table inside a fractional ply iterative deepening framework with aspiration windows, featuring Lazy SMP ^[4]. Search routines are instantiated at compile time from a generic routine with three boolean template parameters, PV-node, in check, and null move pruning on-off, similar quiescence search has four instances for on-off combinations of PV-node and check. Further selectivity is applied by mate distance pruning, razoring, IID, futility pruning, check extensions and late move reductions. Move ordering is improved by the killer- and history heuristic.

Evaluation

Evaluation employs three further hash tables - evaluation hash table, material hash table and pawn hash table. The evaluation function determines hardware population count support at compile time, passed as template parameter to internal eval functions, finally adding a tempo bonus. Pawn and piece specific evaluators are further implemented with a color template, considering pawn structure, mobility, king safety and various piece pattern. Most of the gain in Cheng4 0.38, released in January 2015, is due to eval tuning using the Texel's Tuning Method by Peter Österlund ^[5].

Forum Posts

2011

cheng3 uci v1.0 by Martin Sedlak, CCC, April 19, 2011
cheng3 1.03 released by Martin Sedlak, CCC, May 27, 2011
cheng3 1.05 released by Martin Sedlak, CCC, September 26, 2011
cheng3 1.06 released by Martin Sedlak, CCC, November 23, 2011

2012 ...

cheng3 1.07 released by Martin Sedlak, CCC, January 21, 2012
cheng4 0.35 by Martin Sedlak, CCC, September 24, 2013
cheng4 0.36 by Martin Sedlak, CCC, November 10, 2013
cheng4 0.36a (FRC bugfix) by Martin Sedlak, CCC, November 15, 2013

2014 ...

cheng4 0.36c - last version by Martin Sedlak, CCC, January 30, 2014
Tragic that Martin Sedlak has discontinued Cheng by User923005, OpenChess Forum, January 31, 2014
Cheng: A great lost to the community by Frank Quisinsky, CCC, January 15, 2015
cheng4 0.38 release by Martin Sedlak, CCC, January 18, 2015
Lazy SMP in Cheng by Martin Sedlak, CCC, February 02, 2015 » Lazy SMP
Lazy SMP scaling Cheng0.38 by Bertil, FishCooking, February 24, 2015
Empirical results with Lazy SMP, YBWC, DTS by Kai Laskos, CCC, April 16, 2015 » Lazy SMP, YBWC, DTS
Cheng 4.39 release by Martin Sedlak, CCC, July 20, 2015
Cheng 4.39 Android version bugfix by Martin Sedlak, CCC, November 13, 2015

External Links

Chess Engine

GitHub - kmar/cheng4: cheng4 chess engine
Cheng chess engine hosted by Emil Vlasák
Index of /chess/engines/Jim Ablett/CHENG by Jim Ablett hosted by Kirill Kryukov
Cheng4 0.36a 64-bit in CCRL 40/40

Misc

Cheng (Disambiguation) from Wikipedia

References

^ UCI and XBoard Engines for Android by Aart Bik
^ GitHub - kmar/cheng4: cheng4 chess engine
^ Description based on Cheng4 036c
^ Lazy SMP in Cheng by Martin Sedlak, CCC, February 02, 2015
^ cheng4 0.38 release by Martin Sedlak, CCC, January 18, 2015

What links here?

Page	Date Edited
Cheng	Jul 30, 2017
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Gavon	Apr 30, 2018
Lazy SMP	Jan 4, 2018
Martin Sedlak	Dec 25, 2017
Parallel Search	Dec 30, 2017
Shared Hash Table	Sep 11, 2017
TCEC Season 6	Dec 2, 2014
TCEC Season 7	Jan 23, 2015
TCEC Season 8	Nov 30, 2015

Up one level

Chess Player 2150

GerdIsenberg — Sun, 01 Jan 2017 21:11:10 GMT

Home * Engines * Chess Player 2150

		Chess Player 2150, a commercial chess program developed by Chris Whittington in 1989, marketed by his company Oxford Softworks. The program ran on various most 68000 based platforms, like Atari ST and Commodore Amiga, and the 2175 version was also ported to run on Apple Macintosh and 8086 PCs. According to Thorsten Czub, Chess Player 2150 used a selective Shannon Type B Strategy, with its immanent affinity to blunder once in a game ^[1]. Chess Player 2150, played the 1st Computer Olympiad 1989.
Chess Player 2150 ^[2]

Chess Player 2175

The successor, the Chess Player 2175, also commercially called Chess Champion 2175 and Checkmate ^[3] played the 2nd Computer Olympiad 1990, won the Bronze medal at the 3rd Computer Olympiad 1991, but suffered from a promotion bug at the 4th Computer Olympiad 1992 and later withdrew from the tournament ^[4].

Forum Posts

Re: La Máquina Preservadora. Programas de Ajedrez by duct, Meca Foro, May 20, 2016 (Spanish)
Chess Champion 2175 by Colin Gough, CCC, December 31, 2016

External Links

References

^ Oldie-Artikel 4 by Thorsten Czub
^ Atari ST Old Computer Chess Game Collection - Chess Player 2150 from The Spacious Mind
^ Checkmate Amiga - HOL database
^ Mark Uniacke (1992). The Chess Tournament of the AST 4th Computer Olympiad. ICCA Journal, Vol. 15, No. 3

What links here?

Page	Date Edited
1st Computer Olympiad	Jul 25, 2017
2nd Computer Olympiad	Jul 12, 2017
3rd Computer Olympiad	Jul 25, 2017
4th Computer Olympiad	Jul 15, 2017
Aegon 1991	Mar 26, 2017
Atari ST	Dec 7, 2016
Chess Player 2150	Jan 1, 2017
Chess Simulator	Dec 7, 2016
Chess System Tal	Jan 13, 2017
Chris Whittington	Dec 9, 2017
Complete Chess System	Dec 7, 2016
E6P	Dec 17, 2016
Engines	Mar 10, 2018
Oxford Softworks	May 6, 2013
SuperChess	Dec 7, 2016

Up one Level

Chessmaster

GerdIsenberg — Sun, 21 Jan 2018 13:19:48 GMT

Home * Engines * Chessmaster

		Chessmaster, a series of chess programs developed and released by Ubisoft. It is the best-selling chess franchise in history, with more than five million units sold as of 2002 ^[1] . Due to its sophisticated GUI, graphics and animations, adjustable playing strength and countless features, Chessmaster is dedicated to the mass market, and due to the strong engine with configurable "personalities", integrated database support, annotated games, and chess lessons and tutorials, also interesting for advanced users. Chessmaster XI, released in 2007, is the most recent version ^[2]. Dedicated for chess beginners and casual chess fans, Chessmaster Challenge differs from Chessmaster 10th Edition in its simplified interface, and scaled-down tutorials. It’s a non-retail product available for trial and purchase through download only ^[3] ^[4].
Face and hands of the Chessmaster ^[5]

Screenshots

CM 2100 & CM 4000

^[6]


Chessmaster 2100		Chessmaster 4000

Chessmaster 10th

Chessmaster 10th Edition Demo ^[7]

Chessmaster Challenge

Chessmaster Challenge 2D Graphics Board ^[8]

Chessmaster XI

Chessmaster XI - House of Staunton chess sets, 3D Graphics Board ^[9]

Chess Engines

MyChess II

Chessmaster was first released as Chessmaster 2000 in 1986 by Software Toolworks, Inc., a software and computer game publisher located in Los Angeles ^[10], co-developed by its founder Walt Bilofsky ^[11] and Michael E. Duffy ^[12], with a chess engine by David Kittinger, loosely based on MyChess II published by the same vendor since 1984 ^[13] . CM 2000 was released for various 8- and 16-bit home computer platforms based on 6502, Z80, 68000 and 8086 processors, such as Amiga, Apple II, Atari 8-bit, Atari ST, ZX Spectrum, Commodore 64, Amstrad CPC, Macintosh, and DOS PCs. The PC version was a rewrite in C based on the 6502 assembly version ^[14], which also went into Novag's dedicated Constellation some years before, as mentioned by Larry Kaufman in the USOCCC 1986 tournament report ^[15]:

Novag's programmer Dave Kittinger also was the programmer of the three PC software entries under the name "Chessmaster". As they employ a version of the rather dated "Constellation" program they were not expected to be competitive with the dedicated units, except for "Chessmaster 2000 Apple" which employed extensive technology to run at high speed.

Sargon 3

After a deal with Fidelity Electronics in 1988, Software Toolworks continued the Chessmaster series for Apple computers with a Sargon III based program by Kathe and Dan Spracklen, market as Fidelity Chessmaster 2100 ^[16]. PC versions of CM 2100 were based on a Kittinger program ^[17].

Chessmaster 3000

The Chessmaster 3000 was released in 1991 for MS-DOS and Windows 3.x PCs, as well for Apple Macintosh, based on a Kittinger program as confirmed by John Merlino ^[18] ^[19] ^[20], and mentioned in CCR 5.1 ^[21]:

Kittinger's first program for personal computers was incorporated into the popular program Chessmaster 2000 developed by Software Toolworks. Kittinger's program was then modified and used in some of the versions of Chessmaster 2100 and Chessmaster 3000.

Fernando Villegas recalled Michael E. Duffy and Andrew Iverson working on the engine ^[22], which does not necessarily imply they had an own one developed from scratch, but interfacing the Kittinger engine to the GUI.

The King

With the release of Chessmaster 4000 Turbo in 1993, The King by Johan de Koning became the CM engine until the present, with annual, biennial and triennial releases for major Windows versions until Chessmaster XI in 2007, incorporating the The King 3.50 with a parallel search able to support multiple processors. The King Version 3.12 has become a WinBoard engine within the ChessMaster 8000 and newer versions ^[23] . Some versions were also made available for Mac OS computers, and the Xbox Live Arcade ^[24].

Releases

^[25]

1986: Chessmaster 2000 - based on MyChess II by David Kittinger
1989: Fidelity Chessmaster 2100 - based on Sargon III by Kathe and Dan Spracklen
1991: Chessmaster 3000 - Kittinger program
1993: Chessmaster 4000 Turbo - The King by Johan de Koning
1995: Chessmaster 4000 - The King 2.0
1996: Chessmaster 5000 - The King 2.x
1997: Chessmaster 5500 - The King 2.55
1998: Chessmaster 6000 - The King 2.6D or 2.61
1999: Chessmaster 7000 - The King 3.x
2000: Chessmaster 8000 - The King 3.12a, 3.12c, 3.12d
2002: Chessmaster 9000 - The King 3.23
2004: Chessmaster 10th - The King 3.33
2007: Chessmaster XI - The King 3.50

Endgame Tablebases

Chessmaster 9000 and later versions support their own compact 3-5-man Endgame Tablebases designed by Johan de Koning, which can be generated with the Final Endgame Generator (FEG) via the Windows Command Prompt ^[26]. Tablebase researcher Marc Bourzutschky further created some theoretically important six piece EGTBs in 2003 ^[27].

Companies

Software Toolworks was founded in 1980 by Walt Bilofsky, who was one of three programmers who designed and created the Chessmaster in the mid 80s ^[28]. In 1994, Software Toolworks, Inc. was merged to Mindscape ^[29] ^[30] in conjunction with the acquirement by Pearson PLC ^[31] with Michael E. Duffy ^[32] and David Grenewetzki ^[33] involved, in 1998 sold to The Learning Company, in the same year bought by Mattel and renamed to Mattel Interactive. In 2000, The Gores Group carves out the re-renamed Learning Company from Mattel, and the Game Studios of The Learning Company was sold to Ubi Soft - all employees were given the opportunity to become employees of their most well-known studio, Red Storm Entertainment ^[34] .

Associated People

Programmers

Engine

Database

Tablebase

Marc Bourzutschky

Chess Tutorials

Project Lead & Misc Programming

Selected Games

Aegon 1995, round 5, David Bronstein - Chessmaster 4000 ^[37]

[Event "Aegon 1995"]
[Site "The Hague NED"]
[Date "1995.05.02"]
[Round "5"]
[White "David Bronstein"]
[Black "Chessmaster 4000"]
[Result "1-0"]
 
1.e4 c5 2.b4 cxb4 3.a3 d5 4.exd5 Qxd5 5.Nf3 e5 6.axb4 Bxb4 7.c3 Bd6 8.Na3 Nc6
9.Bc4 Qe4+ 10.Be2 Qg6 11.Nc4 Bc7 12.d4 exd4 13.cxd4 Be6 14.Ne3 Nge7 15.O-O Rd8
16.Ba3 Bb6 17.Qa4 O-O 18.Ne5 Qf6 19.Nxc6 bxc6 20.Bc5 Bxc5 21.dxc5 Rd2 22.Bf3
Rfd8 23.Qxa7 Nf5 24.Nxf5 Bxf5 25.Qc7 Qd4 26.Ra7 Rf8 27.Qxc6 Bd3 28.Rfa1 Qxf2+
29.Kh1 Bf5 30.Qc7 Bg4 31.Qg3 Bxf3 32.Qxf2 Rxf2 33.gxf3 Rxf3 34.c6 Rc3 35.c7 h5
36.Rd1 Rc2 37.Rd8 g5 38.Rxf8+ Kxf8 39.Ra8+ Ke7 40.c8=Q 1-0

Publications

Tim Carter (1992). Knight Stalker - Software Toolworks' Chessmaster 3000. Computer Gaming World, 08/1992, pdf
Nick Schoonmaker (1996). Chess Master 4000 - Windows 95 Review. Computer Chess Reports, Vol. 5, Nos. 3+4, p. 49
Al Cargill (1996). CM 4000 Personalities. Computer Chess Reports, Vol. 5, Nos. 3+4, p. 72

Forum Posts

1994

Chessmaster 4000T Performance Benchmark by Harold Jack Meadows, rgc, October 22, 1994
ChessMaster 3000 by Donald B. Moran, rgc, December 05, 1994
Software Toolworks (Mindscape) is there, and *yes* they do care! by Joe Stella, rgc, December 24, 1994
CM5000 We welcome input! by Carlos Justiniano, rgc, December 29, 1994

1995 ...

Re: CM5000 is it out yet? by Eric Schiller, rgc, March 27, 1995
Net Contact List of Chessmaster by Carlos Justiniano, rgc, April 06, 1995
CM5000 Ideas, Part 1 of 2 by dtre...@gss.efn.org, rgc, April 06, 1995
CM5000 Ideas, Part 2 of 2 by dtre...@gss.efn.org, rgc, April 06, 1995
ChessMaster 4000 by ArturoA433, rgc, April 09, 1995
Which Version of "The King" Powers "The Chessmaster 4000 Turbo"? by Ernst A. Heinz, CCC, May 08, 1998
Re: Versions of Chessmaster by Fernando Villegas, CCC, May 09, 1998
Chess Master 3000 is Underated by Komputer Korner, rgcc, June 17, 1998
Re: Good news for ChessMaster 6000 users by Detlef Pordzik, CCC, November 01, 1998
Chessmaster and SSDF by Micheal Cummings, CCC, November 09, 1998
Chessmaster 6000 1.0.2 Patch now available by John Merlino, CCC, December 22, 1998
Chessmaster 6000 1.0.3 Patch now available by John Merlino, CCC, February 04, 1999
How really strong is ChessMaster 6000? by Leonid, CCC, July 03, 1999
Chessmaster 7000 "FAQ" by John Merlino, CCC, September 23, 1999
Chessmaster 7000 Patch v1.0.6 by John Merlino, CCC, December 17, 1999

2000 ...

Potential STRONG Chessmaster personality by John Merlino, CCC, January 07, 2000
Re: Chessmaster on winboard? by John Merlino, CCC, February 28, 2000 » WinBoard
An open call to all USCF rated players from the Chessmaster developers by John Merlino, CCC, May 24, 2000
Chessmaster 8000 FAQ by John Merlino, CCC, July 19, 2000
Chessmaster 8000 Updated FAQ by John Merlino, CCC, September 06, 2000

2001

Further news in the Chessmaster saga (some parts are OT) by John Merlino, CCC, March 05, 2001
Software Toolworks to Ubi Soft (OT) by John Merlino, CCC, March 20, 2001
A questionarre for all Chessmaster users by John Merlino, CCC, October 22, 2001

2002

Chessmaster 9000 Beta Report by John Merlino, CCC, May 07, 2002
Frank Poole v HAL 9000 -- or is it CM9000? by John Merlino, CCC, July 10, 2002 » HAL
is chessmaster a french program? by Rajen Gupta, CCC, July 28, 2002
Chessmaster 9000's EGDBs by John Merlino, CCC, August 12, 2002
The Life and Times of Chessmaster by John Merlino, CCC, August 16, 2002
Re: Please Explain Depth in Chessmaster 9000 by John Merlino, CCC, September 03, 2002 » Depth
CM9000 default selective search by Javier Ros Padilla, CCC, September 18, 2002

2003

Need help with CM 9000 and WB2UCI by Ralph Patriquin, CCC, January 02, 2003 » Wb2UCI
Chessmaster 2000 for Amiga, Release: 1986 by Omid David, CCC, January 16, 2003
Re: Just Curious - Does anyone know Johan de Koning of Chessmaster fame? by John Merlino, CCC, February 28, 2003
Usage of general.ctg book+CB learner by ChessMaster in SSDF testing by Gian-Carlo Pascutto, CCC, October 30, 2003

2004

Chessmaster X release forecast by Johan de Koning, CCC, February 29, 2004
Why dont engines support the egtb format that Chessmaster uses? by Jason Kent, CCC, April 01, 2004
Re: Chessmaster and DGT by Odd Gunnar Malin, CCC, April 24, 2004 » DGT Board
Chessmaster 10th Edition Announced by John Merlino, CCC, May 14, 2004
Chessmaster 9000 and SSDF summary by Johan de Koning, CCC, May 15, 2004
Chessmaster Fidelity 2100 by Alain Zanchetta, CCC, June 10, 2004
Chessmaster 10th Edition Demo by John Merlino, CCC, June 22, 2004
Re: Chessmaster 10th Edition demo (technalities) by Johan de Koning, CCC, July 20, 2004
Chessmaster 9000 for Macintosh has been released by Richard A. Fowell, CCC, December 30, 2004

2005 ...

A question to the ChessMaster tuners by Peter Berger, CCC, February 20, 2005
Historical Chessmaster ? by Mike Byrne, CCC, April 23, 2005
What is "randomness" for a CM9k personality? by Wilma, rgcc, June 12, 2005
Chessmaster 11 - 19/10/07 by Wardy, Hiarcs Forum, August 07, 2007
Chessmaster 11 - first thoughts... by Steve Maughan, CCC, November 05, 2007
Chessmaster 11 by Fernando Villegas, Hiarcs Forum, January 08, 2008
Chessmaster 11 settings testing - Default 4CPU added by Graham Banks, CCC, March 12, 2008
Chessmaster Grandmaster version by Dann Corbit, May 17, 2008
Be aware - very aware - Chessmaster for Nintendo DS by Monsieur Plastique, Hiarcs Forum, November 15, 2008
Chessmaster 11 from Ubisoft works as WinBoard-engine? by Norbert Raimund Leisner, CCC, May 25, 2009 » WinBoard
Chessmaster 4, 5, 5.5, 6 & 7 under Windows XP by Nick M., CCC, December 25, 2009

2010 ...

Chessmaster Personality Development by Mark Loftus, CCC, October 17, 2011
David K: did you write CM3000 code? Great discussion here... by Fernando Villegas, CCC, April 24, 2012
Blincoe Knows the Truth about CM3000 by Fernando Villegas, CCC, April 24, 2012
Chessmaster (+engine) version history by Vincent Lejeune, CCC, August 28, 2013
Which is the best personality CM XI ? (in elo strength) by Gustavo Mallada, CCC, January 07, 2014

CM11 Settings and Testing

^[38]

CM11 settings and testing by Graham Banks, CCRL Discussion Board, January 26, 2008
CM11 Championship (completed) by Graham Banks, CCRL Discussion Board, January 19, 2009
CM11 Teams Challenge II (completed) by Graham Banks, CCRL Discussion Board, February 22, 2009
CM11 Teams Challenge III (completed) by Graham Banks, CCRL Discussion Board, April 15, 2009
CM11 Slugfest (completed) by Graham Banks, CCRL Discussion Board, June 19, 2009
CM11 Knockout 2010 (completed) by Graham Banks, CCRL Discussion Board, May 12, 2010
CM11 Slugfest II (completed) by Graham Banks, CCRL Discussion Board, May 30, 2010
CM11 Champions 2011 (completed) by Graham Banks, CCRL Discussion Board, July 18, 2011

External Links

Ubisoft - Chessmaster XI
Chessmaster from Wikipedia
Walt's Home Page - Software Publisher
The chess games of Chessmaster from chessgames.com
Chessmaster 11 | Forums
Jason Kent's Chess Notes
Chessmaster series - MobyGames
VC&G | The Chessmaster Died in 1997 by Benj Edwards, August 27, 2012
The Life, and Death, of PC Gaming's Most Famous Cover Star
Chessmaster in CCRL 40/4
Chessmaster in CCRL 40/40

CM 2000

CM 2100

CM 3000

CM 4000

CM 5000

CM 5500

CM 6000

CM 7000

CM 8000

Chessmaster 8000 - MobyGames
Chessmaster 8000 Review - GameSpot
Chessmaster 8000 Credit Information - GameFAQs
The Chessmaster 8000 - PC - GameSpy
Chessmaster 8000 (Video Game 2000) - IMDb
What can Winboard do? by Aaron Tay, March 01, 2002, hosted by Ron Murawski » WinBoard

CM 9000

CM 10th Edition

CM Challenge

CM XI

References

^ Chessmaster from Wikipedia
^ Ubisoft - Chessmaster XI
^ Ubisoft - Chessmaster Challenge
^ Chessmaster Challenge Game - Download and Play Free Version!
^ Will Hare (1919 – 1997), VC&G | The Chessmaster Died in 1997 by Benj Edwards, August 27, 2012
^ Septober - Computerschach by Herbert Marquardt
^ Chessmaster 10th Edition Demo : Ubi Soft Entertainment Software : Free Download & Streaming : Internet Archive
^ Chessmaster Challenge Game - Download and Play Free Version!
^ PC-Screenshots | Chessmaster XI: The Art of Learning | Ubisoft
^ The Software Toolworks Home Page
^ Walt's Home Page - Software Publisher
^ The Chessmaster 2000 - MobyGames
^ MYCHESS for DOS (1984) - MobyGames
^ Re: Hello all by Dave Kittinger, CCC, April 25, 2012
^ Larry Kaufman (1986). 2nd U.S. Open Computer Chess Championship. Computer Chess Reports 1986, Fall/Winter Edition
^ Reply by Mark Manyen in Fidelity Chessmaster 2100 from The Spacious Mind
^ Re: Hello all by Dave Kittinger, CCC, April 25, 2012
^ Re: Historical Chessmaster ? by John Merlino, CCC, April 24, 2005
^ Re: Historical Chessmaster ? by John Merlino, CCC, April 24, 2005
^ Re: Hello all by Dave Kittinger, CCC, April 25, 2012
^ The Editor (1994). David Kittinger, Professional Biography. Computer Chess Reports, Vol. 5, No. 1, p. 21
^ Re: David K: did you write CM3000 code? Great discussion here by Fernando Villegas, CCC, April 25, 2012
^ What can Winboard do? by Aaron Tay, March 01, 2002, hosted by Ron Murawski
^ Chessmaster LIVE for Xbox 360 (2008) - MobyGames
^ Chessmaster (+engine) version history by Vincent Lejeune, CCC, August 28, 2013
^ An Introduction to FEG and Endgame Databases
^ De Koenig's endgame databases by Emil Vlasák
^ Walt's Home Page - Software Publisher
^ Software Toolworks (Mindscape) is there, and *yes* they do care! by Joe Stella, rgc, December 24, 1994
^ Net Contact List of Chessmaster by Carlos Justiniano, rgc, April 06, 1995
^ Mindscape from Wikipedia mentions: Mindscape sold to Pearson PLC for $503 million in 1994
^ Michael E. Duffy mentions sale of The Software Toolworks to Pearson PLC for $462 million, April 1994, Michael E. Duffy & Associates
^ David Grenewetzki mentions $462 million sale of The Software Toolworks to Pearson PLC, Mai 1993, David Grenewetzki - LinkedIn
^ Software Toolworks to Ubi Soft (OT) by John Merlino, CCC, March 20, 2001
^ The Art of Learning Project
^ CM5000 We welcome input! by Carlos Justiniano, rgc, December 29, 1994
^ David Bronstein vs Chessmaster from chessgames.com
^ Re: Which is the best personality CM XI ? (in elo strength) by Graham Banks, CCC, January 07, 2014

What links here?

Page	Date Edited
3D Graphics Board	Sep 23, 2017
Aegon 1994	Mar 26, 2017
Aegon 1995	Apr 6, 2017
Aegon 1997	Apr 7, 2017
Alain Zanchetta	Feb 20, 2018
Almond	Feb 14, 2012
Andrew Iverson	Apr 21, 2014
Atari 8-bit	Aug 3, 2016
Atari ST	Dec 7, 2016
Bryan Whitby	Jan 2, 2017
Carlos Justiniano	Jun 25, 2017
Chess-Master	Sep 7, 2017
Chessmaster	Jan 21, 2018
Constellation	Oct 2, 2016
David Bringhurst	May 15, 2014
David Grenewetzki	Apr 19, 2014
David Kittinger	Dec 27, 2017
Depth	Feb 25, 2018
Disney's Aladdin Chess Adventures	May 15, 2014
Donald W. Laabs	May 15, 2014
Eigenmann Endgame Test	Jun 1, 2017
Engines	Mar 10, 2018
Eric Schiller	Dec 5, 2016
Fidelity Electronics	Dec 1, 2017
Grandmaster Chess	Dec 7, 2016
HAL	Jun 14, 2016
Hans Kuijf	Jul 16, 2017
Harvard Cup 1992	Mar 26, 2017
Harvard Cup 1994	Apr 21, 2014
Harvard Cup 1995	Nov 9, 2012
Henrik Markarian	Apr 21, 2014
Heuristic Software	May 4, 2013
Javier Ros Padilla	Sep 2, 2015
Jessica Harmsen	Jul 29, 2012
Johan de Koning	Jul 3, 2017
John Merlino	Feb 26, 2015
Leonid Liberman	May 23, 2015
Majestic Chess	Jan 20, 2018
Marc Bourzutschky	Dec 16, 2013
Mark Manyen	Apr 21, 2014
Mephisto Vancouver	Sep 2, 2017
Michael Byrne	Jun 23, 2017
Michael E. Duffy	Apr 19, 2014
MyChess	Dec 25, 2017
Rex	Jan 7, 2016
Santos Gerardo Lazzeri	Mar 19, 2016
Sargon	Dec 25, 2017
Search with Random Leaf Values	Apr 23, 2018
Shawn Benn	Jan 2, 2015
TASC SmartBoard	Feb 25, 2018
Terry Everett	Dec 1, 2017
The King	Jan 21, 2018
United States Open Computer Chess Championship	Dec 2, 2017
USB Chess Board	Apr 21, 2015
USOCCC 1986	Dec 1, 2017
USOCCC 1987	Nov 30, 2017
USOCCC 1988	Dec 1, 2017
Walt Bilofsky	Apr 18, 2014
Wb2UCI	Feb 1, 2018
ZX Spectrum	Aug 3, 2016

Up one level

Cinnamon

GerdIsenberg — Sat, 23 Sep 2017 10:52:39 GMT

Home * Engines * Cinnamon

		Cinnamon, an UCI compliant open source chess engine by Giuseppe Cannella, written in C++11, published under GPL Version 3. Cinnamon was first released in February 2013 ^[1] under that name, while former versions of the engine were called Butterfly. It targets multiple hardware platforms and operating systems such as Windows, Linux, Mac OS and Android, also available for the Raspberry Pi, and further provides a JavaScript library to play with chessboardjs or any js GUI. Cinnamon is bundled with the Tarrasch GUI for Windows ^[2].
Cinnamon ^[3]

Features

^[4]

Forum Posts

OSX compiler wanted by Giuseppe Cannella, Winboard Forum, July 06, 2013
Cinnamon 1.1 for Mac OS X 32-bit by Norbert Raimund Leisner, CCC, July 07, 2013

External Links

Chess Engine

Misc

References

^ Cinnamon « G 6
^ cinnamon chess engine - open source chess engine
^ Cinnamon: sticks (ceylon cinnamon from Sri Lanka), powder, and flowers. Created from 31 images stacked with CombineZP, by Simon A. Eugster, CC BY-SA 3.0, Wikimedia Commons, Cinnamomum from Wikipedia
^ cinnamon/README.md at master · gekomad/cinnamon · GitHub

What links here?

Page	Date Edited
Cinnamon	Sep 23, 2017
DGT Pi	Oct 22, 2017
Engines	Mar 10, 2018
Gavon	Apr 30, 2018
Giuseppe Cannella	Sep 26, 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

Critter

GerdIsenberg — Sat, 25 Jan 2014 13:11:36 GMT

Home * Engines * Critter

		Critter, an UCI compatible cross-platform chess engine by Richard Vida, executables freely available for personal use to run under Windows, Linux, Android and Mac OS ^[1] . Starting in late 2008, Critter was first written in Object Pascal compiled with Delphi, now available as open source engine ^[2] ^[3] , and was ported to C / C++ in 2009 ^[4] . It consistently evolved through various board representations from 0x88 to bitboards, as acknowledged by Richard Vida, also incorporating ideas from strong open source programs like Ippolit ^[5] , to a world class engine which achieved top five of most engine rating lists ^[6] .In 2012, Critter had its over the board debut at the ICT 2012, where it became strong runner-up behind the Rybka cluster.
Critter Country ^[7]

Description

Critter applies a principal variation search with aspiration windows, null move pruning ^[8] and other state of the art forward pruning, reduction and extension techniques, such as the Botvinnik-Markoff extensions ^[9] . It can search in parallel with up to eight threads ^[10] , supports Gaviota tablebases ^[11] , and is able to play Chess960 ^[12] . Critter features a tapered eval with a score pair class and overloaded operators ^[13] ^[14] , and blockage detection in late endgames ^[15] .

Selected Games

ICT 2012, round 7, Rybka - Critter ^[16] ^[17]

[Event "ICT12"]
[Site "Leiden"]
[Date "2012.05.13"]
[Round "7"]
[White "Rybka"]
[Black "Critter"]
[Result "1/2-1/2"]
 
1.d4 d5 2.c4 e6 3.Nf3 c6 4.e3 Bd6 5.b3 f5 6.Bd3 Nf6 7.O-O Qe7 8.Bb2 O-O
9.Qc1 b6 10.Ba3 Bb7 11.Bxd6 Qxd6 12.Nc3 dxc4 13.Bxc4 Nbd7 14.Re1 b5
15.Bd3 b4 16.Na4 c5 17.Nxc5 Bxf3 18.gxf3 Rfc8 19.Bc4 Nxc5 20.dxc5 Rxc5
21.a3 bxa3 22.Qxa3 Nd5 23.Red1 Qc7 24.Kg2 Rd8 25.Bxd5 Rdxd5 26.Qa4 Qe7
27.Rxd5 Rxd5 28.Qxa7 Qxa7 29.Rxa7 Rb5 30.Re7 Rb6 31.Kg3 Kf8 32.Rd7 Rxb3
33.Kf4 Rb5 34.h4 h6 35.Kg3 Rb8 36.h5 Re8 37.Rb7 Re7 38.Rb5 Kf7 39.e4 Kf6
40.exf5 exf5 41.Kf4 Re2 42.Rxf5+ Ke6 43.Rb5 Rxf2 44.Rb6+ Kf7 45.Rb7+ Kf6
1/2-1/2

Release Dates

Critter 0.38 : 2009-05
Critter 0.39a : 2009-06
Critter 0.42 : 2009-10
Critter 0.52 : 2010-01
Critter 0.52b : 2010-02
Critter 0.60 : 2010-04
Critter 0.70 : 2010-05
Critter 0.80 : 2010-07
Critter 0.90 : 2010-11
Critter 1.0 : 2011-03
Critter 1.01 : 2011-03
Critter 1.2 : 2011-06
Critter 1.4 : 2011-12
Critter 1.4a : 2012-01
Critter 1.6 : 2012-06
Critter 1.6a : 2012-06

Publications

Arno Nickel (2012). Die schöne neue Welt der Schachengines. SCHACH 2,3,5,6 2012, pdf (German) ^[18]

Forum Posts

2009

Critter 0.34 : 2146 by Patrick Buchmann, CCC, April 18, 2009
Critter 0.38 : 2330 by Patrick Buchmann, CCC, May 22, 2009
Critter 0.40 released by Richard Vida, CCC, July 26, 2009
Critter 0.40 : 2471 by Patrick Buchmann, CCC, August 01, 2009
Critter: Pascal vs C by Richard Vida, CCC, August 27, 2009 » C, Pascal
Critter 0.42 available by Richard Vida, CCC, October 08, 2009 » Pascal
Critter 0.42 : 2649 by Patrick Buchmann, CCC, October 11, 2009

2010

Critter 0.52 available by Richard Vida, CCC, Jan 25, 2010 » C
Critter 0.52b added to the IPON list ... by Ingo Bauer, CCC, February 04, 2010
Strange knight underpromotion by Critter by Richard Vida, CCC, March 04, 2010
Critter goes SMP (version 0.60 is released) by Richard Vida,CCC, April 13, 2010
Critter 0.60: 2718 by Patrick Buchmann, CCC, April 14, 2010
Critter 0.70 is out by Richard Vida, CCC, May 23, 2010
Critter 0.80 by Richard Vida, CCC, July 24, 2010
Critter 0.90 released by Richard Vida, CCC, November 29, 2010
Critter - looking at static evaluation by Richard Vida, CCC, December 11, 2010

2011

Critter 1.0 available by Richard Vida, CCC, March 16, 2011
Critter 1.0 for Linux by Richard Vida, CCC, March 22, 2011 » Linux
My experience with Linux/GCC by Richard Vida, CCC, March 23, 2011
Critter bugfix update by Richard Vida, CCC, March 28, 2011 ^[19]
Critter 1.2 update + new homepage by Richard Vida, CCC, June 25, 2011 » Android
Critter 1.2 SEEMS to be a member of the Ippo family by Kai Laskos, CCC, July 02, 2011
for Pascal fans: Critter by Richard Vida, CCC, September 16, 2011

2012 ...

Re: World Computer Chess Championship ? by Richard Vida, CCC, June 11, 2012
Re: Critter 1.6 released! by Richard Vida, CCC, June 15, 2012
Continuation of Critter would be very appreciated by Mike Scheidl, CCC, May 15, 2013

External Links

Chess Engine

Critter for win32/64, linux and android platforms hosted by Emil Vlasák
SourceForge.net: Critter Chess - Project Web Hosting - Open Source Software (Pascal Version)
Critter (chess) from Wikipedia
Critter at CCRL 40/40

Misc

References

^ Critter for win32/64, linux and android platforms hosted by Emil Vlasák, Mac OS version compiled by Jeremy Bernstein
^ for Pascal fans: Critter by Richard Vida, CCC, September 16, 2011
^ SourceForge.net: Critter Chess - Project Web Hosting - Open Source Software
^ Critter: Pascal vs C by Richard Vida, CCC, August 27, 2009
^ Re: World Computer Chess Championship ? by Richard Vida, CCC, June 11, 2012
^ Critter (chess) from Wikipedia
^ Critter Country from Wikipedia run by The Walt Disney Company
^ Interview with Richard Vida by Frank Quisinsky, February 20, 2010
^ Re: World Computer Chess Championship ? by Richard Vida, CCC, June 11, 2012
^ Critter goes SMP (version 0.60 is released) by Richard Vida, CCC, April 13, 2010
^ Critter 0.70 is out by Richard Vida, CCC, May 23, 2010
^ Critter 0.80 by Richard Vida, CCC, July 24, 2010
^ Re: talk about IPP's evaluation by Richard Vida, CCC, November 07, 2009 » Ippolit, SIMD and SWAR Techniques
^ My experience with Linux/GCC by Richard Vida, CCC, March 23, 2011
^ Chiron 1.1 bug? by Richard Vida, CCC, December 24, 2011
^ Leiden Round 7: Rybka vs Critter by Ray, Rybka Forum, May 13, 2012
^ ICT 12 - PGN download, CSVN
^ Part 1 covers Houdini, Rybka, Komodo, Stockfish, Critter, Naum, Chiron and Spike
^ Difficult position to Critter by Jouni Uski, CCC, March 24, 2011

What links here?

Page	Date Edited
Arno Nickel	Sep 25, 2015
Blockage Detection	Oct 19, 2017
Chiron	Sep 24, 2017
Critter	Jan 25, 2014
Delphi	Dec 16, 2016
Engines	Mar 10, 2018
Gaviota Tablebases	Apr 22, 2018
Houdini	Apr 14, 2018
ICT 2012	Jun 11, 2012
Kai Laskos	Jan 21, 2018
Komodo	Mar 6, 2018
Languages	Nov 26, 2017
Naum	Nov 23, 2017
Richard Vida	Aug 11, 2013
Rybka	Mar 27, 2017
Scid on the Go	Jan 26, 2015
Spike	Jan 7, 2016
Stockfish	Apr 7, 2018
Strelka	May 17, 2016
TCEC Season 5	Jun 2, 2014
TCEC Season 6	Dec 2, 2014
TCEC Season 7	Jan 23, 2015
TCEC Season 9	Nov 6, 2017
Who's Who	Sep 6, 2017

Up one level

DayDreamer

GerdIsenberg — Mon, 22 Aug 2016 15:43:11 GMT

Home * Engines * Daydreamer

		Daydreamer, (DayDreamer) an UCI compliant open source chess engine by Aaron Becker, written in C (C99) with Windows, Linux, and Mac OS binaries available ^[1], also able to play Chess960. Developed since early 2009, the program was named Daydreamer after a bug in an early version caused it to occasionally follow up very strong play with bizarre blunders, as though it had lost its focus on the game and its mind was wandering aimlessly ^[2]. First released in August 2009 ^[3], it initially used Tomasz Michniewski's simplified evaluation function ^[4], while subsequent versions were rapidly improving since mid 2010. DayDreamer played the CCT12 and ACCA 2010 online tournaments.
A daydreaming gentleman ^[5]

Description

Board Representation

Daydreamer uses piece-lists and a 16x16 vector attacks board around a 0x88 board inside its middle 16x8 slots ^[6]. Move generation of pieces is unrolled over directions, capture generation of sliding pieces for quiescence uses the leading efficient blocker loop, i.e. for one vertical direction ^[7]:

  for (to=from+16; pos->board[to]==EMPTY; to+=16) {}
  if (can_capture(piece, pos->board[to])) {
    moves = add_move(pos, create_move(from, to, piece,
                     pos->board[to]), moves);
  }

Search

The search is PVS alpha-beta with transposition table, IID, null move pruning combined with mate threat extensions, razoring, futility pruning and late move reductions inside an iterative deepening framework with aspiration windows and floating point fractional ply depth, the latter credited to Ivan Bonkin and his Bison program ^[8] ^[9].

Opening Book

Daydreamer supports PolyGlot and ctg opening books ^[10], the huffman codes and ctg move decoding based on Stephan Vermeire's ctg code for Brutus ^[11].

Endgame Tablebases

Daydreamer is able to probe Gaviota Tablebases as well as Scorpio Bitbases ^[12].

Evaluation

Daydreamer's evaluation might be lazy with respect to bounds and margins based on cached material, considering imbalances, and piece-square table scores only. Otherwise, supported by a pawn hash table, it takes pawn structure, mobility, king safety and various other terms into account, speculatively aggregating middle- and endgame scores, which were finally tapered by a range of 24 game phases.

Selected Games

ACCA 2010, round 6, DayDreamer - Gaviota ^[13]

[Event "ACCA 2010"]
[Site "FICS, San Jose, California USA"]
[Date "2010.11.07"]
[Round "6"]
[White "DayDreamer"]
[Black "Gaviota"]
[Result "1-0"]
 
1.e4 e6 2.d4 d5 3.Nc3 Bb4 4.e5 c5 5.a3 Bxc3+ 6.bxc3 Ne7 7.Qg4 O-O 8.Bd3 Nbc6 
9.Nf3 f5 10.exf6 Rxf6 11.Qh5 h6 12.O-O c4 13.Be2 Qa5 14.Bd2 Bd7 15.Ne5 Be8 
16.Qh4 Nxe5 17.dxe5 Nf5 18.Qh3 Rf8 19.a4 Bxa4 20.g4 Nd4 21.Bd1 b5 22.Kh1 Rf7 
23.g5 Nf5 24.gxh6 Qc7 25.Bh5 Re7 26.Bg6 Bxc2 27.Rg1 Qxe5 28.Bh7+ Kf8 29.Rae1 
Be4+ 30.f3 Ke8 31.fxe4 dxe4 32.hxg7 Kd7 33.g8=Q Rxg8 34.Rxg8 Kc7 35.Ra1 Kb7 
36.Bxf5 Qxf5 37.Qh8 a5 38.Rg5 Qf3+ 39.Kg1 e5 40.Qd8 Qf6 41.Qxa5 Qb6+ 42.Qxb6+ 
Kxb6 43.Be3+ Kc6 44.Ra6+ Kd7 45.Bc5 e3 46.Bxe7 1-0

Forum Posts

2009

Announcing Daydreamer 1.0 by Aaron Becker, CCC, August 16, 2009
Daydreamer 1.01 : 2037 by Patrick Buchmann, CCC, August 24, 2009
Announcing Daydreamer 1.5 by Aaron Becker, CCC, September 04, 2009
Daydreamer 1.51 : 2272 by Patrick Buchmann, CCC, November 14, 2009
Announcing Daydreamer 1.6 by Aaron Becker, CCC, December 22, 2009

2010 ...

Daydreamer 1.61: 2361 by Patrick Buchmann, CCC, January 02, 2010
Test tournament starts: Gaviota, Daydreamer, Greko, Atak by Harun Taner, CCC, January 10, 2010 » Gaviota, Daydreamer, GreKo, Atak
Daydreamer 1.7 by Aaron Becker, CCC, March 19, 2010
Daydreamer 1.7 : 2519 by Patrick Buchmann, CCC, March 22, 2010
Daydreamer 1.75 by Aaron Becker, CCC, April 02, 2010
Daydreamer 1.75 : 2569 by Patrick Buchmann, CCC, April 05, 2010
Compiling Daydreamer in Visual Studio by Gregory Strong, CCC, May 01, 2010
Developments of the last two years by Aaron Becker, CCC, March 02, 2013
Re: copy/make vs make/unmake by Aaron Becker, CCC, January 07, 2014 » Copy-Make, Make Move, Unmake Move

External Links

Chess Engine

AaronBecker/daydreamer · GitHub
Downloads · AaronBecker/daydreamer · GitHub
Index of /chess/engines/Jim Ablett/DAYDREAMER compiled by Jim Ablett, hosted by Kirill Kryukov
Index of /chess/engines/Jim Ablett/+++ LINUX ENGINES ++/32 BIT/daydreamer compiled by Jim Ablett, hosted by Kirill Kryukov
Daydreamer 1.75 64-bit in CCRL 40/40

Misc

References

^ Downloads · AaronBecker/daydreamer · GitHub
^ daydreamer/README.md
^ Announcing Daydreamer 1.0 by Aaron Becker, CCC, August 16, 2009
^ daydreamer/README.md
^ A daydreaming gentleman; from an original 1912 postcard published in Germany, Daydream from Wikipedia
^ daydreamer/position.h at release · AaronBecker/daydreamer · GitHub
^ daydreamer/move_generation.c at release · AaronBecker/daydreamer · GitHub
^ daydreamer/README.md - Thanks
^ Bison by Иван Бонькин (Ivan Bonkin), Russia! from sdchess.ru - searcher.h
^ GitHub - AaronBecker/daydreamer: A chess engine, focused on search, written in C - Changes from 1.6 to 1.7
^ daydreamer/book_ctg.c at release · AaronBecker/daydreamer · GitHub
^ daydreamer/scorpio_bb.c at release · AaronBecker/daydreamer · GitHub
^ The 2010 Fifth Annual ACCA Americas' Computer Chess Championships -- Results

What links here?

Page	Date Edited
Aaron Becker	Jul 22, 2015
ACCA 2010	Jul 14, 2014
Atak	Aug 9, 2016
CCT12	Jan 28, 2018
CTG	Aug 22, 2016
DayDreamer	Aug 22, 2016
Donna	Aug 17, 2017
Dreamer	Aug 5, 2015
Engines	Mar 10, 2018
Gaviota	Jan 21, 2018
Greko	Feb 27, 2018
Harun Taner	May 17, 2015
Mathematician	Apr 9, 2018
Open Source Engines	Jul 14, 2015

Up one level

Demolito

GerdIsenberg — Thu, 01 Mar 2018 17:28:15 GMT

Home * Engines * Demolito

		Demolito, an UCI compliant open source chess engine by Lucas Braesch, licensed under the GNU General Public License, written in C, first announced at OpenChess in January 2017 ^[1], a revised stable release published in June 2017 as completely rewritten new DiscoCheck featuring SMP and Chess960 ^[2], with executables available for Linux, Mac OS and Android.
Being Demolished ^[3]

Forum Posts

New UCI Engine: Demolito by lucasart, OpenChess Forum, January 14, 2017
Demolito Chess Engine by Norbert Raimund Leisner, CCC, January 16, 2016
Demolito UCI x64 25th January 2017 - 30th January 2017 by Norbert Raimund Leisner, CCC, February 08, 2017
New DiscoCheck is cooking by Lucas Braesch, CCC, June 04, 2017
New version: Demolito 2017-08-26 by Lucas Braesch, CCC, August 27, 2017
Demolito 20180301 released by Lucas Braesch, CCC, March 01, 2018

External Links

Chess Engine

Misc

References

^ New UCI Engine: Demolito by lucasart, OpenChess Forum, January 14, 2017
^ New DiscoCheck is cooking by Lucas Braesch, CCC, June 04, 2017
^ High Reach Demolition Excavator - Hydraulic demolition scissors on chassis CAT 365B L. Arm is 30 m long, Image by Michal Maňas, June 21, 2006, CC BY-SA 2.5, Wikimedia Commons
^ Demolito/types.h at master · lucasart/Demolito · GitHub
^ Demolito/recurse.h at master · lucasart/Demolito · GitHub

What links here?

Page	Date Edited
Demolito	Mar 1, 2018
DiscoCheck	Jun 23, 2017
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Ethereal	Mar 20, 2018
Xiphos	Apr 22, 2018

Up one Level

DiscoCheck

GerdIsenberg — Fri, 23 Jun 2017 08:02:15 GMT

Home * Engines * DiscoCheck

		DiscoCheck, (former DoubleCheck) a free open source engine under the GNU General Public License, written in C++. DiscoCheck is UCI compatible and can be compiled for Linux, Android ^[1] , Windows, and Mac OS X. It performs PVS alpha-beta with transposition table, null move pruning, LMR and various enhancements inside an iterative deepening framework with aspiration windows. DiscoCheck determines sliding piece attacks with magic bitboards, first using Pradu Kannan's implementation, later the GPL conform version by Borko Bošković as used in MinkoChess (then called Umko) ^[2] . Early versions used the author's own implementation of rotated bitboards, adapted from his earlier engine BibiChess 0.5. In June 2017, a new DiscoChess dubbed Demolito was announced, completely rewritten, featuring SMP and Chess960 ^[3] ^[4].
Disco ball ^[5]

Forum Posts

Discocheck "Boney M" is out by Lucas Braesch, CCC, June 28, 2012
DiscoCheck 4.0.0 (release candidate) by Lucas Braesch, CCC, January 27, 2013
DiscoCheck 4.1 released by Lucas Braesch, CCC, March 23, 2013
DiscoCheck 4.2 by Lucas Braesch, CCC, May 21, 2013
DiscoCheck 4.3 is out by Lucas Braesch, CCC, July 14, 2013
DiscoCheck 5.0 released by Lucas Braesch, CCC, October 25, 2013
DiscoCheck 5.1 by Lucas Braesch, CCC, December 08, 2013
DiscoCheck 5.2 released by Lucas Braesch, CCC, January 11, 2014
New DiscoCheck is cooking by Lucas Braesch, CCC, June 04, 2017

External Links

Chess Engine

lucasart/chess · GitHub
UCI and XBoard Engines for Android maintained by Aart Bik » Android
DiscoCheck at CCRL 40/40

Misc

Disco from Wikipedia
Disco (disambiguation) from Wikipedia
Frank Zappa - Disco Boy, YouTube Video
lineup: Frank Zappa, Adrian Belew, Tommy Mars, Peter Wolf, Patrick O'Hearn, Terry Bozzio, Ed Mann

References

^ UCI and XBoard Engines for Android maintained by Aart Bik
^ Double/DiscoCheck from WBEC Ridderkerk
^ New DiscoCheck is cooking by Lucas Braesch, CCC, June 04, 2017
^ GitHub - lucasart/Demolito: UCI Chess Engine
^ Disco ball Image by Sarah, February 24, 2010, CC BY 2.0, Wikimedia Commons

What links here?

Page	Date Edited
Demolito	Mar 1, 2018
DiscoCheck	Jun 23, 2017
Discovered Check	Feb 1, 2018
Draw Evaluation	Mar 12, 2018
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Gavon	Apr 30, 2018
Wrong color Bishop and rook pawn	Oct 19, 2017

Up one Level

Wikispaces : chessprogramming - items matching description

Amateur

Table of Contents

History

Forum Posts

External Links

References

What links here?

Arasan

Table of Contents

Bitboard Trials

Magic Bitboards

PEXT/PDEP Bitboards

Automated Tuning

Tournament Play

Photos & Games

See also

Forum Posts

1995 ...

2000 ...

2005 ...

2010 ...

2015 ...

External Links

Chess Engine

Misc

References

What links here?

Arthur

Table of Contents

Descriptions

1997

1999

See also

Publications

Forum Posts

External Links

Chess Engine

Misc

References

What links here?

Battle Chess

Table of Contents

Games

See also

Forum Posts

External Links

References

What links here?

Belofte

Table of Contents

Features

History

Rating

Forum Posts

External links

References

What links here?

Bestia

Table of Contents

Photos & Games

See also

Forum Posts

External Links

Chess Engine

Bestia Misc

Beast

References

What links here?

Betsabe

Table of Contents

Description

Board Representation

Search

Evaluation

Selected Games

See also

Forum Posts

External Links

Chess Engine