Wikispaces : chessprogramming - items matching description

Alaric

GerdIsenberg — Wed, 05 Mar 2014 07:57:26 GMT

Home * Engines * Alaric

		Alaric, (TerraPi) a WinBoard and UCI compliant chess engine written by Peter Fendrich in C++. It uses both bitboards and other structures to represent the board and to generate moves, and further utilizes transposition table, pawn hash table, history tables, and two killer slots per ply. Inside its principal variation search with null move pruning, a precise prediction of node types takes place in order to guide the search ^[1].
Alaric I ^[2]

Etymology

The chess engine Alaric is named after Alaric I (around 370 – 410 AD), King of the Visigoths from 395, who managed to walk with his forces right through the Roman empire, invaded Italy and sacked Rome in 410. Before that in the year 394 he served as a leader of Germanic troops under Roman command of Theodosius I but wasn't happy with how the Goths were treated ^[3].

Tournament Play

Alaric played the CCT9 with a result of 3½/7, and, under the handle TerraPi, a successful WCRCC 2007, becoming 6th with 8½/14 ^[4]. One year later, at the WCRCC 2008, Alaric even became 4th with 9½/14 ^[5]. Alaric's opening book was cooked by Günther Simon ^[6].

Selected Games

CCT9

CCT9, Buzz - Alaric ^[7]

[Event "CCT9"]
[Site "Internet Chess Club"]
[Date "2007.02.17"]
[Round "?"]
[White "Buzz"]
[Black "Alaric"]
[Result "0-1"]
 
1.c4 e6 2.d4 c5 3.d5 exd5 4.cxd5 Nf6 5.Nc3 d6 6.e4 Be7 7.Be2 Qa5 8.Kf1 O-O 
9.f4 Na6 10.e5 Ne8 11.a3 Qc7 12.Nf3 Bg4 13.Bxa6 bxa6 14.exd6 Nxd6 15.h3 Bd7 
16.g4 Bf6 17.Kg2 Rfe8 18.Re1 Rxe1 19.Nxe1 Re8 20.Nd3 Nc4 21.Qf3 Bd4 22.Kg3
h5 23.gxh5 Bf5 24.Kh2 Qb8 25.h6 Qb3 26.Ne5 Nxe5 27.fxe5 Bxe5+ 28.Kg2 Qc2+ 
29.Qe2 Be4+ 30.Kf2 Bd4+ 31.Kg3 Qb3 32.Kh4 Bf6+ 33.Bg5 Bxg5+ 34.Kxg5 f6+ 
35.Kh4 g5+ 36.Kh5 Kf7 37.Re1 Bg6+ 38.Kg4 Rxe2 39.Rxe2 Bd3 40.Rf2 Bf1 41.Rxf1 
Qxb2 42.Kg3 Qxc3+ 43.Rf3 Qe5+ 44.Kf2 Qxd5 45.Ke2 Kg6 46.h7 Kxh7 47.Rc3 Qd4 
48.Rd3 Qe5+ 49.Re3 Qb2+ 50.Kd3 Qd4+ 51.Ke2 c4 52.Re7+ Kh6 53.Kf1 Qd1+ 54.Re1 
Qf3+ 55.Kg1 c3 56.Rf1 Qg3+ 57.Kh1 c2 58.h4 Kh5 59.Rc1 Kxh4 60.Rxc2 Kh3 61.Re2 
Qf3+ 62.Kg1 Qxe2 63.a4 Qg2# 0-1

WCRCC 2008

WCRCC 2008, round 2, Alaric (TerraPi) - Arasan ^[8] ^[9]

[Event "WCRCC 2008"]
[Site "Internet Chess Club"]
[Date "2008.06.21"]
[Round "2"]
[White "TerraPi"]
[Black "Arasan"]
[Result "1-0"]
 
1.e4 e5 2.Nf3 Nc6 3.Bb5 a6 4.Ba4 Nf6 5.O-O Be7 6.Re1 b5 7.Bb3 O-O 8.c3 d5 
9.exd5 Nxd5 10.Nxe5 Nxe5 11.Rxe5 c6 12.d4 Bd6 13.Re1 Qh4 14.g3 Qh3 15.Re4 
g5 16.Qe1 Bf5 17.Nd2 Nf6 18.f3 Nxe4 19.Nxe4 Bxe4 20.fxe4 Be7 21.e5 Qg4 22.Qd1 
Qxd1+ 23.Bxd1 Rab8 24.Bf3 Rfc8 25.Be3 Kg7 26.Be4 h6 27.Rf1 a5 28.Kg2 Rc7 
29.Kf3 Rh8 30.h3 Rd8 31.Kg4 a4 32.Rd1 Rf8 33.Kf5 Rb8 34.Rh1 Rh8 35.h4 Rcc8 
36.b3 axb3 37.axb3 Rc7 38.hxg5 Bxg5 39.Bxg5 hxg5 40.Rxh8 Kxh8 41.Kxg5 Kg7 
42.c4 bxc4 43.bxc4 Rc8 44.g4 Rd8 45.d5 cxd5 46.cxd5 Rc8 47.d6 Rc1 48.Kf4 Rf1+ 
49.Ke3 Re1+ 50.Kf3 Kh6 51.Kf4 Kg7 52.g5 Rf1+ 53.Ke3 Rd1 54.Bd3 Kf8 55.g6 fxg6 
56.Bxg6 Rg1 57.Bd3 Re1+ 58.Kd4 Ke8 59.Bc4 Kd7 60.Kd5 Rd1+ 61.Kc5 Re1 62.e6+ 
Kd8 63.Kd4 Kc8 1-0

Forum Posts

About the "final" Terra and Alaric by Peter Fendrich, Winboard Forum, January 28, 2005
Alaric new version by Peter Fendrich, Winboard Forum, February 12, 2007
New Alaric by Peter Fendrich, Winboard Forum, March 30, 2007
Alaric 704 : 2607 by Patrick Buchmann, CCC, April 06, 2007
Alaric test for Fritz users by Peter Fendrich, CCC, July 01, 2007
Alaric 707 by Peter Fendrich, Winboard Forum, July 14, 2007
Alaric 707 : 2670 by Patrick Buchmann, CCC, July 15, 2007
Where is Alaric? by Mike Scheidl, CCC, January 08, 2008
some notes re Arasan games in ACCA by Jon Dart, CCC, June 22, 2008 » WCRCC 2008, Arasan
WCRCC: Sjeng-TerraPi sac by Jon Dart, CCC, June 25, 2008 » WCRCC 2008, Deep Sjeng
Operator for Alaric in World Comp Rapid Chess Championship by Peter Fendrich, CCC, August 12, 2009 » WCRCC 2009

External Links

Chess Engine

Misc

References

^ Alaric - About the engine
^ Portrait of Alaric in C. Strahlheim, Das Welttheater, 4. Band, Frankfurt a.M., 1836, Alaric I from Wikipedia
^ Alaric - About Alaric and the Goths
^ Alaric @ WCRCC tournament by Peter Fendrich, July 24, 2007
^ Alaric's results by Peter Fendrich, June 23, 2008
^ Alaric - Downloads
^ Buzz (Computer) vs Alaric (Computer) (2007) from chessgames.com
^ 2008 Second Annual ACCA World Computer Chess Championships - Results
^ some notes re Arasan games in ACCA by Jon Dart, CCC, June 22, 2008

What links here?

Page	Date Edited
Alaric	Mar 4, 2014
CCT9	Aug 25, 2013
Contempt Factor	Mar 10, 2018
Eigenmann Endgame Test	Jun 1, 2017
Engines	Mar 10, 2018
Günther Simon	Jul 30, 2017
Peter Fendrich	May 19, 2017
Terra	Feb 11, 2015
Thread	Apr 22, 2018
WCRCC 2007	Nov 21, 2016
WCRCC 2008	Nov 21, 2016

Up one Level

Arminius

GerdIsenberg — Sat, 05 Aug 2017 19:36:14 GMT

Home * Engines * Arminius

		Arminius, a chess engine by Volker Annuss, which is a complete restructured successor of Hermann ^[1] . Both engines, Hermann and Arminius use a neural network to calculate a probability how likely it is in iterative deepening that the best move will change when searching one ply deeper. They both use properties of the position and results from previous iterations that are correlated with a change in the best move in the next iteration. Arminius also considers relative node counts ^[2]. Arminius' tournament debut was the DOCCC 2011. Arminius 2017, the version that won the third place at PT 51, is using its own format of 6-men WDL endgame bitbases ^[3]. In August 2017, Arminius started to practice Black Magic ^[4]
Arminius Source ^[5]

Forum Posts

Re: Programmers: what's the story behind the name of your engine by Volker Annuss, CCC, June 21, 2011 » Hermann
Re: "panic time" and "easy moves" by Volker Annuss, CCC, February 17, 2013 » Time Management, Neural Networks
The effect of dual channel RAM by Volker Annuss, CCC, March 01, 2015 » Memory
Arminius 2015-08-06 by Volker Annuss, CCC, August 06, 2015
Another way of evaluating material imbalances by Volker Annuss, CCC, January 01, 2017 » Material
Arminius 2017-01-01 released by Volker Annuss, CCC, January 01, 2017
Black magic bitboards by Volker Annuss, CCC, August 03, 2017
Re: Black magic bitboards by Volker Annuss, CCC, August 04, 2017

External Links

Chess Engine

Arminius in CCRL 40/40

Misc

Arminius from Wikipedia
Battle of the Teutoburg Forest from Wikipedia
Heinrich von Kleist (1777–1811), Die Hermannsschlacht (1808)
Category:Arminius - Wikimedia Commons
Arminia from Wikipedia.de (German)
Arminia Bielefeld from Wikipedia
Slayer - Black Magic, Wacken 2014, YouTube Video

References

^ Pandix wins Dutch Open, CSVN site, October 22, 2011
^ Re: "panic time" and "easy moves" by Volker Annuss, CCC, February 17, 2013
^ editor's personal communication with Volker Annuss at PT 51, April 30, 2017
^ Re: Black magic bitboards by Volker Annuss, CCC, August 04, 2017
^ Arminius spring near the Lippe spring and Arminiuspark, Bad Lippspringe, Image by Gmoeller, 2005, CC BY 1.0, Römer-Lippe-Route – Reiseführer auf Wikivoyage, Wikimedia Commons

What links here?

Page	Date Edited
Arminius	Aug 5, 2017
DOCCC 2011	Dec 1, 2013
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Hermann	Dec 7, 2017
ICT 2013	Dec 1, 2013
Magic Bitboards	Apr 13, 2018
Material	Mar 31, 2018
Memory	Dec 8, 2017
Neural Networks	Mar 12, 2018
PT 45	May 19, 2014
PT 48	Oct 15, 2015
PT 49	Oct 22, 2015
PT 50	May 3, 2017
PT 51	Oct 5, 2017
PT 52	Nov 14, 2017
TCEC Season 5	Jun 2, 2014
TCEC Season 6	Dec 2, 2014
TCEC Season 7	Jan 23, 2015
Volker Annuss	Aug 3, 2017

Up one Level

Barbarossa

GerdIsenberg — Tue, 20 Dec 2016 15:59:13 GMT

Home * Engines * Barbarossa

		Barbarossa, an UCI compliant open source chess engine by Nicu Ionita, first released in Fall 2013 as successor of Abulafia ^[1] , both written in Haskell ^[2] ^[3] . It uses bitboards to represent the board, and magic bitboards ^[4] to determine sliding piece attacks. Barbarossa applies an alpha-beta search ^[5] utilizing a transposition table indexed by Zobrist keys, and uses the functional programming concept of monad transformers ^[6] ^[7] in continuation passing style to control the search. Some evaluation parameters were tuned by Rémi Coulom's CLOP, and more recently by MMTO as introduced by Kunihito Hoki and Tomoyuki Kaneko in the domain of Shogi ^[8] ^[9] .
Barbarossa ^[10]

Forum Posts

Abulafia, chess, Haskell and some (new?) ideas by Nicu Ionita, CCC, April 20, 2012
Barbarossa 0.1.0 by Nicu Ionita, CCC, November 24, 2013
New release of Barbarossa by Nicu Ionita, CCC, February 22, 2015
Barbarossa 0.3.0 released by Nicu Ionita, CCC, October 06, 2015
Barbarossa-0.4.0 release by Nicu Ionita, CCC, December 20, 2016

External Links

Chess Engine

Misc

References

^ Barbarossa 0.1.0 by Nicu Ionita, CCC, November 24, 2013
^ Abulafia, chess, Haskell and some (new?) ideas by Nicu Ionita, CCC, April 20, 2012
^ Haskell (programming language) from Wikipedia
^ Barbarossa/Magics.hs at master · nionita/Barbarossa · GitHub
^ Barbarossa/Albeta.hs at master · nionita/Barbarossa · GitHub
^ Haskell/Monad transformers - Wikibooks
^ Haskell/Understanding monads - Wikibooks
^ Kunihito Hoki, Tomoyuki Kaneko (2014). Large-Scale Optimization for Evaluation Functions with Minimax Search. JAIR Vol. 49, pdf
^ MMTO for evaluation learning by Jon Dart, CCC, January 25, 2015
^ Bust of Friedrich I., "Barbarossa", gilded bronze, ca. 1160, given to his godfather Count Otto of Cappenberg in 1171. It was used as a reliquary in Cappenberg Abbey, St. Johannes Evangelist Church, Wikimedia Commons

What links here?

Page	Date Edited
Abulafia	Oct 4, 2017
Barbarossa	Dec 20, 2016
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Nicu Ionita	May 3, 2017

Up one level

Beowulf

GerdIsenberg — Fri, 05 May 2017 17:33:49 GMT

Home * Engines * Beowulf

		Beowulf, a Chess Engine Communication Protocol compatible open source engine, the game-playing brains behind the ChessBrain project, a distributed computing project similar to SETI@home, that aims to harness the collective calculating power of individual computers over the internet to play a game of chess ^[1] . Colin Frayn is head of the project and primary Beowulf author, supported by Dann Corbit, Ron Murawski, Carlos Justiniano et al.. The version history ends with version 2.3, February 13, 2004, version 2.4 from August 21, 2010 is the latest released version with several bug fixes ^[2] . Beowulf is published under GNU General Public Licence V2.
Beowulf fighting the dragon ^[3]

Features

^[4]

Rotated Bitboard Move Generator
Advanced Static Analysis Function
Static Exchange Evaluator for Quiescence Pruning
Quiescence Search delta cuts
Adaptive Depth Null move with Verification Search
Adaptive Razoring ^[5]
Innovative Design of Hashtables
Internal Iterative Deepening
Aspiration Window Search
History and Killer Move Heuristics
Numerous Search Extensions
XBoard/WinBoard Support
Opening Book Support
Endgame Tablebase Support (Nalimov)
Matt Taylor's Folded BitScan (board.c)
Isaac64 pseudorandom number generator by Bob Jenkins, 1996, ^[6] modifications by Ron Murawski, 2001

Forum Posts

On Beowulf - long post by Vincent Diepeveen, CCC, April 04, 2001
Beowulf v1.5 Has Been Released by Colin Frayn, CCC, June 21, 2001
Beowulf 1.6d by Dann Corbit, CCC, August 30, 2001
Beowulf v1.7 Released by Colin Frayn, CCC, October 11, 2001
Beowulf v1.8 Released by Colin Frayn, CCC, December 08, 2001
Beowulf v1.9 Released by Colin Frayn, CCC, February 06, 2002
Beowulf v2.0 Release! by Colin Frayn, CCC, October 06, 2002
Beowulf hot spots shown pictorially by Dann Corbit, CCC, June 20, 2002
Beowulf v2.1 by Colin Frayn, CCC, October 06, 2002
New Beowulf Finally *officially) Released by Colin Frayn, CCC, December 16, 2002
Beowulf has Moved! by Colin Frayn, CCC, June 30, 2005
Beowulf Fixed (I hope) by Colin Frayn, CCC, September 07, 2005
Beowulf 2.4 Windows 64-bit build available by Jim Ablett, CCC, December 15, 2007
Beowulf 2.4 Windows-executable version by Norbert Raimund Leisner, CCC, August 23, 2008
Beowulf v2.4a chess engine by Norbert Raimund Leisner, CCC, August 22, 2010
TrappyBeowulf - A Beowulf mod to use [Trappy Minimax] by Jim Ablett, CCC, January 30, 2013 ^[7]

External Links

Chess Engine

Misc

References

^ ChessBrain
^ Re: Beowulf v2.4a chess engine by Tony Mokonen, CCC, August 25, 2010
^ A 1908 depiction of Beowulf fighting the dragon by J. R. Skelton, Illustration in the children's book Stories of Beowulf (H. E. Marshall), published in New York in 1908 by E. P. Dutton & Company, Beowulf from Wikipedia, The Dragon (Beowulf) from Wikipedia
^ Beowulf version history
^ Beowulf 2.4 Windows 64-bit build available by Jim Ablett, CCC, December 15, 2007
^ ISAAC, a fast cryptographic random number generator
^ probabilityZero/TrappyBeowulf · GitHub by Mike Vollmer

What links here?

Page	Date Edited
APHID	Jun 26, 2017
Beowulf	May 5, 2017
Bitboard Board-Definition	Jun 23, 2014
Brainless	Jun 24, 2017
ChessBrain	Jun 28, 2017
ChessMaps	Dec 7, 2017
Colin Frayn	Jun 25, 2017
Dann Corbit	Dec 9, 2017
Eigenmann Endgame Test	Jun 1, 2017
Engines	Mar 10, 2018
Horizon	Mar 17, 2013
King of Kings	Sep 4, 2013
Koundinya Veluri	Feb 2, 2013
Plisk	Dec 31, 2014
Warlord	Apr 15, 2014

Up one Level

Brutus

GerdIsenberg — Sat, 24 Dec 2016 20:29:56 GMT

Home * Engines * Brutus

		Brutus, a FPGA based chess entity developed by Chrilly Donninger, supported by Alex Kure and Ulf Lorenz. Brutus consists of usual PCs with Xilinx Virtex FPGA boards inside, and was designed in dependence on the Belle and Deep Thought chess machines. In fact, it was Ken Thompson who initiated and supported the FPGA chess project. After the WCCC 2003, Brutus evolved to Hydra.
Brutus ^[1]

How it started

In early 2000, Ken Thompson told his friend Frederic Friedel about interesting hardware developments concerning FPGAs, and asked whether he was aware of a programmer who could build such a kind of "People's Deep Blue". ChessBase, surely interested in the commercial aspects of such a machine, engaged Chrilly Donninger for the development of a FPGA based chess hardware and program. The work on Brutus started in October 2000, one year later it could calculate its first position, and in January 2002, it played its first game. Soon, programmer, chess expert and opening book author Alex Kure, and in November 2002, Ulf Lorenz, responsible for the surrounding distributed search, joined the Brutus team, with ChessBase and the University of Paderborn cooperating on the project ^[2].

Etymology

The name Brutus was chosen by Matthias Wüllenweber due to his spot on Ancient Rome. The idea was a "People's Deep Blue" to dethrone "Caesar" Garry Kasparov ^[3].

Description

Brutus partially ran on PCs and partially on FPGA cards. Opposed to a pure move generation approach, and to diminish PCI communication overhead with the PC, the hardware was designed also to perform a kind of iterative search. Brutus’ FPGA definition was written in the Verilog hardware description language, and uses 67 out of 96 BlockRAMs, 534 of 24,576 Flip-Flops, and 18,403 of 24,576 LUTs of the Virtex board ^[4].

Brutus on a Xilinx Virtex V405E FPGA development board ^[5]

FPGA Search

Brutus calculates the last 3 plies of an n-ply search on the FPGA side, inclusively quiescence search and evaluations. It essentially contains a big piece of combinatorial logic, controlled by a finite state machine (FSM) with 54 states for the search. An upper bound for the number of cycles per search node is 9. The Figure below shows a simplified version of the FSM that controls the search on the FPGA card. States must not be interpreted as time points when functions are called. E.g. the move generator and the evaluation are never called in that sense. They are running all the time ^[6].

Search in Hardware: Simplified state diagram ^[7]

Evaluation

The evaluation consists of many small features which are summed up by one large adder tree. All features are determined simultaneously.

Move Generation

The Belle like move generator consists of the generate aggressor module and the generate victim module, both instantiate 64 square modules, one for each square. The squares send piece-signals if any, respectively forwarding the signals of sliding pieces. Each square can output the signal ’victim found’ to indicate the ’victim’ is target square of a pseudo-legal move. The collection of all ’victim found’ signals is the input for a comparator tree, an arbiter, which selects the most attractive, not yet examined victim. The generate aggressor module takes the arbiter’s output as input and sends the signal of a super-piece from the target to find one or more origin squares. Selection criteria are the values of attacked pieces and whether or not a move is a killer move.

Distributed Search

The most sensitive and important part of Brutus search algorithm is distributed among several standard PCs, connected via a high-speed Myrienet. One of the processors receives the current chess position and basically begins a sequential alpha beta search. Idle processors send work requests randomly around the net - when a working processor captures such a request, it distributes part of his own (sub-) problem. Using a tricky messaging system between the processors, the work is dynamically balanced with little search overhead. After a while, all processors have something useful to do. A processor generates approximately 100,000 searches on a FPGA board per second ^[8].

Tournament Play

A Brutus prototype had its debut at the IPCCC 2002 with an expected 50% score, but Brutus quickly improved and already played a strong WCCC 2002 in Maastricht, where it became third only loosing a spectacular game from later champion Junior. At the IPCCC 2003, Brutus became third again, then, in August 2003, it won the 11th Grandmaster Tournament in Lippstadt with 9 out of 11 ^[9], and seemed dedicated to win the upcoming WCCC 2003 in Graz, but after two consecutive losses from Shredder and Deep Junior in round 5 and 6, Brutus finished disappointing fourth. As a consequence, ChessBase went out of the project, which then continued under the patronage of the Pal Group of Companies ^[10] under its new name Hydra.

Photos & Games

IPCCC 2002

IPCCC 2002: Alex Kure, Chrilly Donninger, Mathias Feist, Brutus vs. Fritz 0 - 1 ^[11] ^[12]

[Event "IPCCC 2002"]
[Site "Paderborn GER"]
[Date "2002.03.03"]
[Round "07"]
[White "Brutus-XPa"]
[Black "Fritz"]
[Result "0-1"]
[ECO "E34"]
 
1.d4 Nf6 2.c4 e6 3.Nc3 Bb4 4.Qc2 d5 5.cxd5 Qxd5 6.Nf3 Qf5 7.Qxf5 exf5 8.a3 Be7 9.Bf4 c6 
10.e3 Nbd7 11.Bc4 Nb6 12.Ba2 Be6 13.Be5 h6 14.Ke2 a5 15.Rhc1 a4 16.Kf1 O-O 17.Ne2 Ne4 
18.Bxe6 fxe6 19.Nf4 Kf7 20.Bxg7 Kxg7 21.Nxe6+ Kf6 22.Nxf8 Bxf8 23.Ke2 Bd6 24.g3 h5 
25.Nh4 Nd5 26.f3 Ng5 27.Kd3 Rd8 28.e4 Ne7 29.Ke3 Bc7 30.Nxf5 Nxf5+ 31.exf5 h4 32.f4 
Re8+ 33.Kd3 Nf3 34.d5 Nxh2 35.dxc6 hxg3 36.cxb7 Bxf4 37.Rc4 Kxf5 38.Rxa4 g2 39.Ra5+ Kf6 
40.Ra6+ Kf7 41.Ra4 Bb8 42.Ra5 Kf6 43.Ra6+ Kf5 44.Ra5+ Kf4 45.Ra6 Nf3 46.Rf6+ Kg3 47.Rg6+ 
Kf2 48.Rg7 g1=R 49.Raxg1 Nxg1 50.Rf7+ Nf3 51.a4 Kg3 52.Rg7+ Kf4 53.Rf7+ Kg4 54.Rh7 Ng5 
55.Rd7 Kf5 56.a5 Ke6 57.Rd4 Nf3 58.Ra4 Kd5 59.a6 Ba7 60.Kc3 Re3+ 61.Kc2 Nd4+ 62.Kd2 Nc6
63.Kc2 Kc5 64.Kd2 Kb5 65.Ra1 Re7 66.Rc1 Rd7+ 67.Ke1 Nb4 68.Ke2 Kxa6 0-1

WCCC 2002

WCCC 2002, round 6, Brutus - Deep Junior ^[13] ^[14]:

[Event "WCCC 2002"]
[Site "Maastricht, The Netherlands"]
[Date "2002.07.09"]
[Round "6"]
[White "Brutus"]
[Black "Deep Junior"]
[Result "0-1"]
 
1.e4 c5 2.Nf3 d6 3.d4 cxd4 4.Nxd4 Nf6 5.Nc3 a6 6.Be2 e5 7.Nb3 Be7 8.O-O O-O 9.Kh1 Qc7 
10.f4 b5 11.fxe5 dxe5 12.Bg5 Nbd7 13.Bd3 Bb7 14.Qf3 b4 15.Ne2 a5 16.Ng3 g6 17.Rad1 a4 
18.Nd2 Ba6 19.Ne2 Rfc8 20.b3 Kg7 21.Qh3 h5 22.Qf3 Qc6 23.Bc4 Bxc4 24.Nxc4 Qe6 25.c3 
axb3 26.axb3 Rxc4 27.bxc4 b3 28.h3 b2 29.Ng3 Qxc4 30.Rb1 Rb8 31.Rfd1 Rb3 32.Rd3 Nc5 
33.Re3 Rb6 34.Re2 Na4 35.Rd2 Qa2 36.Rdd1 Rc6 37.Ne2 Qc4  38.Rf1 Rb6 39.Rbd1 Kf8 
40.Bh6+ Ke8 41.Bg7 Qxe4 42.Bxf6 Qxf3 43.gxf3 Rxf6 44.Rb1 Ba3 45.f4 exf4 46.Rf3 g5 
47.c4 Bc5 48.Rd3 g4 49.Rb3 Kd7 50.Rf1 f3 51.Ng3 Rb6 52.Rxb6 Nxb6 0-1

WCCC 2003

WCCC 2003, Brutus - Diep ^[15], Vincent Diepeveen, Ulf Lorenz and Chrilly Donninger ^[16]

[Event "WCCC 2003"]
[Site "Graz, Austria"]
[Date "2003.11.27"]
[Round "8"]
[White "Brutus"]
[Black "Diep"]
[Result "1-0"]
 
1.e4 c5 2.Nf3 d6 3.d4 cxd4 4.Nxd4 Nf6 5.Nc3 a6 6.Be3 e5 7.Nb3 Be6 8.f3 Nbd7 9.Qd2 b5 
10.a4 b4 11.Nd5 Bxd5 12.exd5 Nb6 13.Bxb6 Qxb6 14.a5 Qb7 15.Bc4 Be7 16.Ra4 Rb8 17.Nc1 
O-O 18.b3 Bd8 19.Na2 Nd7 20.Kd1 Qc8 21.Nxb4 Nc5 22.Ra2 Bg5 23.Nc6 Qxc6 24.dxc6 Bxd2 
25.Kxd2 Rfc8 26.Bd5 Ne6 27.Rd1 Nd8 28.c3 Kf8 29.g4 Ke7 30.h4 Rc7 31.Ra4 f6 32.h5 Nxc6 
33.Rc4 Kd7 34.b4 h6 35.f4 exf4 36.Rxf4 Ne5 37.Re1 Rb5 38.Bb3 Rbb7 39.Re3 Rb8 40.Rd4 
Rbc8 41.Bd5 Rc4 42.Rde4 R4c7 43.Kc2 Rb8 44.Rd4 Rb5 45.Kb3 Nc6 46.Be6+ Ke7 47.Bc4+ Re5 
48.Rdd3 Ra7 49.Bd5 Nd8 50.Re4 Ne6 51.Rd2 Kd7 52.c4 Nc7 53.Red4 Nxd5 54.Rxd5 Rxd5 
55.Rxd5 Ke6 56.Kc3 Ra8 57.Kd4 g6 58.hxg6 Rg8 59.c5 dxc5+ 60.bxc5 Rxg6 61.c6 Rxg4+ 
62.Kc5 Ra4 63.Rd8 Rxa5+ 64.Kb6 Ra2 65.c7 Rc2 66.c8=Q+ Rxc8 67.Rxc8 Kf5 68.Rh8 Kg5 
69.Kxa6 h5 70.Kb5 h4 71.Kc4 Kg4 72.Kd4 Kg3 73.Ke3 Kg4 74.Rh7 h3 75.Rh6 f5 76.Rg6+ 
Kh4 77.Kf4 1-0

Namesake

Brutus by Stephan Vermeire

Publications

Eric Hallsworth (2002). The Brutus Project. Selective Search 101, pp. 33, pdf hosted by Mike Watters
Wenzel Mraček (2003). Zu Besuch bei Christian „Chrilly“ Donninger. pdf (German)
Chrilly Donninger, Alex Kure, Ulf Lorenz (2004). Parallel Brutus: The First Distributed, FPGA Accelerated Chess Program. IPDPS’04

Forum Posts

Any details about Brutus? by Peter McKenzie, CCC, February 27, 2002
BRUTUS by Elvis, ChessBits-Computerschachforum, February 28, 2002 (German)
Junior Verses Brutus --> Rxc4 "The best PC chess move ever?" by Dann Corbit, CCC, July 31, 2002
Suturb - Bob by Frank Phillips, CCC, January 22, 2003
Re: What happens to the BRUTUS Project by Dr. Donninger ? by Chrilly Donninger, CCC, April 01, 2003
Status of Brutus? by O. Veli, CCC, July 26, 2003
Brutus has won the Lippstadt Tournament by Tomas Casanovas Martinez, CCC, August 16, 2003
Go Brutus!! by Pete Rihaczek, CCC, November 24, 2003

External Links

Chess

Brutus' ICGA Tournaments
Comp Brutus chess games - 365Chess.com
Brutus - Was ist das denn?, ChessBase News, March 07, 2002 (German)
What is Brutus?, ChessBase News, March 20, 2002
Parallele Schachprogrammierung, ChessBase News, September, 16, 2003 (German)
Schach + PC - Brutus by Peter Schreiner, Schachclub Leinzell, April 2002 (German)
Brutus and Hydra by Ulf Lorenz, University of Paderborn

Maastricht

Vormärz by Chrilly Donninger, Old CSVN site (German) ^[17]

Lippstadt

Brutus mit Auftaktsieg, ChessBase News, August 08, 2003 (German)
Brutus in Lippstadt mit zweitem Sieg, ChessBase News, August 09, 2003 (German)
Grandmasters brutalised in Lippstadt, ChessBase News, August 10, 2003
Spielen wie Tal, ChessBase News, August 10, 2003 (German)
Brutus auch nur ein Mensch, ChessBase News, August 11, 2003 (German)
Brutus remis, ChessBase News, August 12, 2003 (German)
Brutus reloaded, ChessBase News, August 13, 2003 (German)
Brutus: Held mit programmierter Götterdämmerung?, ChessBase News, August 14, 2003 (German)
Brutus vor Maiwald und Cyborski, ChessBase News, August 15, 2003 (German)
Brutus marschiert, ChessBase News, August 16, 2003 (German)
Brutus mit GM-Norm, ChessBase News, August 17, 2003 (German)

Graz

Brutus defeats Fritz in round four, ChessBase News, November 24, 2003
Computer Championship: Shredder stops Brutus, ChessBase News, November 25, 2003

Brutus

References

^ Marble bust of Brutus, at the Palazzo Massimo alle Terme in the National Museum of Rome, Marcus Junius Brutus the Younger from Wikipedia
^ Brutus and Hydra by Ulf Lorenz, University of Paderborn
^ Schach + PC - Brutus by Peter Schreiner, Schachclub Leinzell, April 2002 (German)
^ Chrilly Donninger, Alex Kure, Ulf Lorenz (2004). Parallel Brutus: The First Distributed, FPGA Accelerated Chess Program. IPDPS’04
^ Brutus - Was ist das denn?, ChessBase News, March 07, 2002
^ Chrilly Donninger, Alex Kure, Ulf Lorenz (2004). Parallel Brutus: The First Distributed, FPGA Accelerated Chess Program. IPDPS’04
^ Chrilly Donninger, Alex Kure, Ulf Lorenz (2004). Parallel Brutus: The First Distributed, FPGA Accelerated Chess Program. IPDPS’04
^ Parallele Schachprogrammierung, ChessBase News, September, 16, 2003 (German)
^ Performance ELO by Lei, Shiann-Tzong, CCC, August 16, 2003
^ Pal Group of Companies
^ FSV personal chess service - Paderborn 2002 Pics (from Sunday, 03.03.2002) by Torsten Schoop
^ Downloads | IPCCC | Games, CSVN site
^ Maastricht 2002 - Chess - Round 6 - Game 6 (ICGA Tournaments)
^ Junior Verses Brutus --> Rxc4 "The best PC chess move ever?" by Dann Corbit, CCC, July 31, 2002
^ Graz 2003 - Chess - Round 8 - Game 6 (ICGA Tournaments)
^ Live from Graz – Fritz and Shredder lead, ChessBase News, November, 27, 2003
^ Vormärz from Wikipedia

What links here?

Page	Date Edited
Alex Kure	Aug 27, 2016
Belle	Jan 18, 2018
Brutus	Dec 24, 2016
Brutus NL	Aug 22, 2016
Caesar	May 22, 2016
Chrilly Donninger	Dec 19, 2016
Engines	Mar 10, 2018
FPGA	Jul 9, 2016
GridChess	Jul 13, 2016
Hydra	Aug 17, 2016
IPCCC 2002	May 31, 2014
IPCCC 2003	Aug 17, 2016
List (Program)	Jan 7, 2016
Move Generation	Jan 29, 2018
MVV-LVA	Oct 26, 2017
Nimzo	Dec 30, 2017
Ulf Lorenz	Dec 22, 2016
University of Paderborn	Aug 17, 2014
WCCC 2002	Nov 24, 2017
WCCC 2003	Apr 2, 2017
Wolfgang Zugrav	Jul 13, 2016

Up one Level

Brutus NL

GerdIsenberg — Mon, 22 Aug 2016 15:30:26 GMT

Home * Engines * Brutus

		Brutus (Brutus Chess), a Chess Engine Communication Protocol compatible open source chess engine by Stephan Vermeire and Maurizio Platino, since Version 8 also UCI compliant. Brutus participated at the CPT 2008 and the CPT 2010, the over the board Chess Programmers Tournaments organized by Richard Pijl. Brutus is a bitboard engine, determines sliding piece attacks with magic bitboards, uses alpha-beta with transposition table and null-move pruning, and supports SMP search ^[1]. Brutus 8.05 is able to read ctg bookfiles ^[2].
Brutus Chess ^[3] ^[4] ^[5]

Namesake

Brutus, the FPGA program by Chrilly Donninger

Forum Posts

Brutus v8.01 available at new website by Stephan Vermeire, Winboard Forum, November 14, 2009
Brutus v8.5 released by Stephan Vermeire, Winboard Forum, January 25, 2010

External Links

Chess Engine

Misc

References

^ Brutus' Homepage
^ Brutus v8.5 released by Stephan Vermeire, Winboard Forum, January 25, 2010
^ Brutus' Homepage
^ Asterix from Wikipedia
^ Albert Uderzo from Wikipedia

What links here?

Page	Date Edited
Brutus	Dec 24, 2016
Brutus NL	Aug 22, 2016
CCC 2009	Apr 29, 2015
CPT 2008	Nov 6, 2014
CPT 2010	Jan 17, 2013
CTG	Aug 22, 2016
DayDreamer	Aug 22, 2016
Engines	Mar 10, 2018
IOCSC 2010	Jul 13, 2013
Stephan Vermeire	Mar 29, 2015

Up one Level

Che ES

GerdIsenberg — Tue, 18 Aug 2015 11:06:03 GMT

Home * Engines * Che ES

		Che, a chess program by Oscar Contreras, written in C++ and Assembly. Che played the First Spanish Computer Chess Championship, the SCCC 1993 in Barcelona, where it became runner-up behind Betsabe, and the SCCC 1994 in Valencia respectively.
Che Guevara playing chess ^[1]

Selected Games

SCCC 1993, Che versus Jupiter ^[2] :

[Event "SCCC 1993"]
[Site "Barcelona"]
[Date "1993.10.??"]
[Round "?"]
[White "Che"]
[Black "Jupiter"]
[Result "1-0"]
 
1.Nf3 d5 2.d4 Nf6 3.Bf4 Nc6 4.Nc3 Bf5 5.e3 Bg4 6.Bd3 e6 7.O-O Bd6 8.Bxd6 cxd6 
9.h3 Bxf3 10.Qxf3 O-O 11.Rfe1 Rc8 12.Kf1 e5 13.Nxd5 exd4 14.Qf5 g6 15.Qxf6 Re8 
16.exd4 Qd7 17.Rxe8+ Qxe8 18.Qxd6 Qe6 19.Nf6+ Kh8 20.Qxe6 fxe6 21.d5 Ne5 
22.dxe6 Kg7 23.Ng4 Nc4 24.b4 Nd2+ 25.Kg1 Rc6 26.Rd1 1-0

Namesake

Che, Igorrit clone by Dmitri Gusev ^[5]

External Links

References

^ Image appeared on page 43 of the Cuban book on the 17th Chess Olympiad Havana 1966, Miroslav Filip, Tigran Petrosian, Federación Cubana de Ajedrez, et al. (1968). Cuba 66: XVII olimpíada mundial de ajedrez, from 4803. Che Guevara from Chess Notes by Edward Winter
^ Josep Parés, Teresa Canela (1993). Report on the 1st Spanish Computer-Chess Championship. ICCA Journal, Vol. 16, No. 4
^ Chrilly Donninger (1996). CHE: A Graphical Language for Expressing Chess Knowledge. ICCA Journal, Vol. 19, No. 4
^ CHE docs in English / Nimzo 3 version by Mike S., CCC, November 22, 2001
^ Che ver. 1.0, a free, open-source clone of Igorrit 0.086v4 by Dmitri Gusev, CCC, May 07, 2015

What links here?

Page	Date Edited
Che ES	Aug 18, 2015
Engines	Mar 10, 2018
Killer	Dec 15, 2017
SCCC 1993	Dec 15, 2017
SCCC 1994	Dec 15, 2017

Up one level

Colossus Chess

GerdIsenberg — Sun, 10 Dec 2017 18:41:16 GMT

Home * Engines * Colossus Chess

		Colossus Chess, the series of chess programs by Martin Bryant developed from 1983 on an Apple II in 6502 Assembly, based on Bryant's former program White Knight. Colossus Chess 2.0 was the first commercial release in 1884 for the Commodore 64 and this and subsequent versions for other 6502, Z80, 68000 and 8086 based home and personal computers, such as Atari 8-bit, BBC Micro, Amstrad CPC, ZX Spectrum, Atari ST, Amiga, and finally for the IBM PC. Colossus Chess pioneered a sophisticated GUI with an optional 3D chessboard, and lot of new features for that time, and has become one of the best selling chess programs of all time ^[1]. Colossus Chess played the European MCC 1983 in London and the WMCCC 1984 in Glasgow.
Colossus Chess 4.0 3D board on C64 ^[2]

Colossus Chess UCI

While the work on the commercial Colossus Chess series finished in 1991, Martin Bryant started a completely new and freely available Windows UCI version in 2004, first written in C# then converted to C ^[3], released in 2006 ^[4] through 2008 ^[5].

Publications

Martin Bryant (1984). Chess software for home computers. Computer & Video Games, January 1984, pdf hosted by Mike Watters
Tony Harrington (1984). Of might and men. Personal Computer News, November 1984, pdf hosted by Mike Watters

Forum Posts

Interview with Martin Bryant, the Man behind Colossus by Fernando Villegas, CCC, May 18, 2002
isn't there a new version of colossus ? by Thorsten Czub, CCC, April 29, 2004
Colossus Chess - Still life in the old horse by Bryan Whitby, CCC, October 21, 2005
Colossus 2007d Available by Martin Bryant, CCC, September 22, 2007
Colossus 2008a available by Martin Bryant, CCC, September 07, 2008
Colossus 2008b available by Martin Bryant, CCC, September 23, 2008
Re: Colossus 2008b by Graham Banks, CCRL Discussion Board, January 12, 2011 (Download)
Colossus 2008b by Bryan Whitby, CCC, December 10, 2017

External Links

Colossus Chess (dead)
Colossus' (Chess) ICGA Tournaments
Colossus Chess from Wikipedia
Free Chess Downloads by Ed Schröder
Chess Computers - The UK Story by Mike Watters
Classic Computer Chess - ... The programs of yesteryear by Carey, hosted by the Internet Archive ^[6]

Colossus 2.0

Colossus 3.0

Atari 400 800 XL XE - Colossus Chess 3.0 from The World's Finest Atari Database

Colossus 4.0

Colossus X

Misc

References

^ Chess Computers - The UK Story by Mike Watters
^ Colossus Chess from Wikipedia
^ Colossus Chess from Wikipedia
^ Free Chess Downloads by Ed Schröder
^ Colossus 2008b available by Martin Bryant, CCC, September 23, 2008
^ Re: Old programs CHAOS and USC by Dann Corbit, CCC, July 11, 2015
^ Lorenz cipher from Wikipedia

What links here?

Page	Date Edited
3D Graphics Board	Sep 23, 2017
Atari 8-bit	Aug 3, 2016
Atari ST	Dec 7, 2016
BBC Micro	Dec 16, 2016
Bryan Whitby	Jan 2, 2017
Colossus Chess	Dec 10, 2017
Eigenmann Endgame Test	Jun 1, 2017
Engines	Mar 10, 2018
European MCC 1983	May 22, 2016
Fernando Villegas	Aug 15, 2016
Martin Bryant	Dec 11, 2016
Querg	Dec 11, 2013
Rainer Neuhäusler	Apr 16, 2013
Terry Everett	Dec 1, 2017
Tony Harrington	Sep 26, 2014
USOCCC 1988	Dec 1, 2017
White Knight	Dec 12, 2016
WMCCC 1984	Dec 31, 2017

Up one Level

Cyrus

GerdIsenberg — Tue, 22 Jul 2014 15:26:14 GMT

Home * Engines * Cyrus

		Cyrus, Richard Lang's first chess program, written in Assembly for a Z80 CPU. Starting programming in January 1981, his tournament debut at the 2nd European Microcomputer Chess Championship at the PCW Show 1981 in London was already a breakthrough. Cyrus was the clear winner with 5 out of 5 in a field of 12 Micros. Cyrus ran on a Nascom microcomputer using a 4 MHz Z80 CPU, and Lang immediately was offered two contracts by David Levy and Kevin O’Connell, one for Cyrus, and one to work as programmer for Intelligent Software. Lang accepted, and Cyrus IS-Chess for the Sinclair ZX Spectrum was his first commercial entry, followed by programs for various dedicated chess computers merchandised by Intelligent Software, as well a further improved version of Cyrus, Cyrus II. In an 2003 interview, Richard Lang stated that there is still much of Cyrus in current versions of Chess Genius. For example, he had never used quiescence searches and relied instead on a static swap off routine ^[1].
Cyrus IS-Chess ^[2]

ACM 1981 Blitz

An improved version of Cyrus appeared at the ACM Speed Chess Tournament 1981, running on an Osborne Z80 microcomputer and matched against mainframe programs, beating Cray Blitz and Chess 4.5, and only losing to Belle ^[3].

[Event "ACM 1981 Speed Tournament"]
[Site "Los Angeles"]
[Date " 1981.11.10"]
[Round "?"]
[White "Cyrus"]
[Black "Cray Blitz"]
[Result "1-0"]
 
1. e4 d6 2. d4 g6 3. Nc3 Nf6 4. Bb5 Nbd7 5. Nf3 c6 6. Be2 Bg7 
7. 0-0 0-0 8. Qd3 e5 9. Bg5 h6 10. Bxf6 Qxf6 11. Rfd1 Rd8 
12. a4 a5 13. Ra3 Qf4 14. g3 Qf6 15. Rb3 Ra7 16. Qc4 Ra6 
17. dxe5 dxe5 18. Rd2 b6 19. Qd3 Bb7 20. Qd6 Qxd6 21. Rxd6 Raa8 
22. Rd2 Ba6 23. Bxa6 Rxa6 24. Ne2 c5 25. Rbd3 Ra7 26. Nc3 Rb7 
27. b3 Kh8 28. Nb5 Kg8 29. Nd6 Rc7 30. Nb5 Rb7 31. Rd5 f6 
32. Nd6 Rc7 33. Nb5 Rb7 34. c4 Bf8 35. Nc3 g5 36. Ne1 Bg7 
37. Nc2 Kh8 38. Ne3 Kg8 39. Nf5 Bf8 40. Ne3 Bg7 41. R5d3 Kh8 
42. Nf5 Ra7 43. Nb5 Ra6 44. Nc7 Ra7 45. Ne6 Re8 46. Nexg7 1-0

Intelligent Software

Following programs and dedicated chess computers with programs based on Cyrus were released during Lang's period working for Intelligent Software ^[4]:

Cyrus for Sinclair ZX Spectrum, Z80 assembly language, 1981
Chess 2001, Z80 assembly language, 1982 ^[5]
Intelligent Chess Software, Z80 assembly language
L'Empereur, Z80 assembly language ^[6]
La Regence, Z80 assembly language ^[7] ^[8]
Dragon Chess, 6809 assembly language, for Dragon Data Home computers ^[9]

Cyrus II

		Working for Intelligent Software, Richard Lang continued the Cyrus development including a 6502 port to cover the growing market of Apple II and Commodore 64 home computers. At the 3rd European Microcomputer Chess Championship, September 1982, La Regence became strong runner up behind Advance 2.4, while Cyrus II itself didn't quite come up to its expectations. Lang: 'It was written in such a hurry and the tournament came in the middle of its development period rather than at the end'. There were quite a few new ideas in the program, and he didn't have much time to test them before the tournament. The new ideas were a combination of running faster and implementing new chess knowledge, by getting it to recognize isolated and doubled pawns and the like ^[10]. Various programs derivate from Cyrus competed at the 4th European Microcomputer Chess Championship, September 1983. Cyrus 2.5 finished best (4th) of the home computer programs tied with White Knight 11 by Martin Bryant, behind Advance 3.0 and Chess 2001.
Cyrus II 3D screen ^[11]

Cyrus 68K

see main article Cyrus 68K

In about 1983 Richard Lang started to write his new program Psion for 68000 family of processors, and was about to abandon the work for Intelligent Software, who continued their own work by owning the Cyrus brand by primary programmer Mark Taylor, yielding in Cyrus 68K. Its predecessor, competing under the name 65 Cyrus X at the WMCCC 1983 in Budapest is assigned to Intelligent Software with the authors David Levy, Mark Taylor and Kevin O’Connell at the ICGA tournament page ^[12].

External Links

Chess Computers - The UK Story from Chess Computer UK by Mike Watters
Cyrus IS Chess - World of Spectrum
Cyrus II - World of Spectrum
Cyrus download @ Game Downloads
Cyrus Is Chess by Sinclair from Retrogames
Cyrus II Chess for CPC - GameSpot
Cyrus for DOS (1985) from MobyGames
Chess and Computers
Cyrus I from Wikipedia, King of Anshan
Cyrus the Great from Wikipedia, grandson of Cyrus I and the founder of the Achaemenid Empire

References

^ Richard Lang - Question & Answer Interview given to a German magazine in 2003, pdf hosted by Mike Watters, Chess Computer UK
^ Cyrus IS Chess - World of Spectrum
^ Tony Harrington (1983). Winner Takes All. Personal Computer World, September 83, pdf hosted by Mike Watters, Chess Computer UK
^ Richard Lang - Question & Answer Interview given to a German magazine in 2003, pdf hosted by Mike Watters, Chess Computer UK
^ CXG Chess 2001 from Schachcomputer.info - Wiki
^ SciSys and Novag : The Early Years from Chess Computer UK by Mike Watters
^ Chafitz TSB 4 La Regence from Schachcomputer.info - Wiki
^ Gilbert Obermair (1983). Schach-Computer Report ’84, S. 62-63, Applied Concepts - La Regence TSB IV, pdf hosted by Hein Veldhuis (German)
^ Computing History - DragonChess
^ Tony Harrington (1983). Winner Takes All. Personal Computer World, September 83, pdf hosted by Mike Watters
^ Cyrus II - World of Spectrum
^ Cyrus' ICGA Tournaments

What links here?

Page	Date Edited
3D Graphics Board	Sep 23, 2017
Advance	Jan 7, 2016
Applied Concepts	Dec 25, 2017
Chess 2001	Jan 8, 2016
Cyrus	Jul 22, 2014
Cyrus 68K	Jan 7, 2016
Engines	Mar 10, 2018
European MCC 1981	May 22, 2016
European MCC 1982	May 22, 2016
European MCC 1983	May 22, 2016
European Microcomputer Chess Championship	May 22, 2016
Intelligent Chess Software	Jan 8, 2016
Intelligent Software	Dec 11, 2012
L'Empereur	Jan 8, 2016
La Regence	Jul 23, 2015
PCW Microcomputer Chess Championship	May 22, 2016
Personal Computer World	Apr 12, 2013
Psion	Mar 20, 2017
Querg	Dec 11, 2013
Richard Lang	Jan 7, 2016
Stockholm MCCT 1981	Oct 12, 2013
Tony Harrington	Sep 26, 2014
ZX Spectrum	Aug 3, 2016

Up one level

Cyrus 68K

GerdIsenberg — Thu, 07 Jan 2016 15:39:10 GMT

Home * Engines * Cyrus 68K

		Cyrus 68K, a chess program by Mark Taylor and advisor David Levy for the 68000 (68K) based family of microprocessors. Cyrus 68K, not to confused with Richard Lang's earlier program Cyrus, was written by Taylor from scratch in 1985. Richard Lang, like Mark Taylor affiliated with Levy's and O’Connell's company Intelligent Software, already focused on Psion at that time, had abandoned Intelligent Software, and was about to work for Hegener & Glaser on Mephisto.
Cyrus the Great ^[1]

Photos & Games

Mark Taylor, Kevin O’Connell and David Levy with Cyrus 68K vs. Nona, WCCC 1986 ^[2] ^[3]

[Event "5th World Computer Chess Championship"]
[Site "Cologne, Germany"]
[Date "1986.06.15"]
[Round "5"]
[White "Nona"]
[Black "Cyrus 68K"]
[Result "1-0"]
 
1. d4 e6 2. e4 d5 3. Nc3 Bb4 4. e5 Ne7 5. Bd2 Nf5 6. Nf3 Be7 7. Bd3 Nc6 
8. Be3 Nxe3 9. fxe3 Nb4 10. Be2 c5 11. O-O Nc6 12. Na4 c4 13. Nc3 Kf8 
14. e4 Ke8 15. Rf2 h6 16. exd5 exd5 17. Qd2 Bf5 18. Nd1 Nb4 19. Ne3 Be4 
20. b3 cxb3 21. axb3 h5 22. Ng5 Bxg5 23. Qxb4 Qe7 24. Bb5+ Kf8 25. Qxe7+ 
Kxe7 26. Re1 Ke6 27. c4 Raf8 28. cxd5+ Bxd5 29. Nxd5 Kxd5 30. e6 Be7 
31. Rxf7 Rxf7 32. exf7 Bb4 33. Rd1 Rf8 34. Be2 h4 35. Bc4+ Kd6 36. Rf1 Bc3
37. Rf4 Rh8 38. f8=Q+ 1-0

SEX

Cyrus 68K was Intelligent Software's testbed for the SEX Algorithm, to apply fractional extensions and reductions, most notably already a kind of LMR, considering forced tactical moves such as checks, captures, mate threats determined by Mate at a Glance, as well as killer moves and early non-tactical moves and from a evaluated and sorted move list with a lower depth decrement than later non-tactical siblings.

Excerpts from The SEX Algorithm in Computer Chess 1989 ^[4] :

Later we designed a 68000 program called Cyrus 68K, written by one of us (Mark Taylor), which evaluated and sorted all the moves from a node being expanded: we used these evaluations to determine the SXDEC for moves that were non-tactical. An obvious way to accomplish this is to assign the "best" (i.e., highest-scoring) non-tactical move a low SXDEC and to determine the SXDEC values for its non-tactical siblings on the basis of the difference in score among them.
...
A second generation of the search extension algorithm was developed during the period 1985-1988. Many of the original ideas were used but we tried to eliminate certain obvious deficiencies and to make the intelligence in the program more sophisticated. We came up with a number of new ideas and tested them in a 68000-based program called Cyrus 68K. In general the results were rather encouraging, and we now feel that there is no longer a need to be shy about our work, hence the revised acronym for the algorithm and the renaming of the key variables to SEX and SEXDEC.

The Sphinx

Cyrus 68K was commercially available as the Sphinx, a dedicated chess computer under the brand name CGX, and manufactured by Eric White's Newcrest Technology Ltd., Hong Kong ^[5] ^[6].

Publications

David Levy, David Broughton, Mark Taylor (1989). The SEX Algorithm in Computer Chess. ICCA Journal, Vol. 12, No. 1, pp. 10-21

External Links

References

^ Illustration from "Illustrerad verldshistoria utgifven av Ernst Wallis. Volume I": Relief of Cyrus, 1875. Cyrus the Great from Wikipedia, not to confused with his grandfather Cyrus I
^ Chess Computers - The UK Story from Chess Computer UK by Mike Watters
^ Cologne 1986 - Chess - Round 5 - Game 7 (ICGA Tournaments)
^ David Levy, David Broughton, Mark Taylor (1989). The SEX Algorithm in Computer Chess. ICCA Journal, Vol. 12, No. 1, pp. 10-21.
^ CXG Electronic Chess Computers from The Spacious Mind
^ CXG from Schachcomputer.info Wiki

What links here?

Page	Date Edited
ACM 1986	Dec 5, 2017
ACM 1987	Dec 5, 2017
ACM 1988	Dec 5, 2017
Chess Monster	Jun 21, 2017
CXG Sphinx	Jun 23, 2017
Cyrus	Jul 22, 2014
Cyrus 68K	Jan 7, 2016
David Levy	Jan 3, 2017
Engines	Mar 10, 2018
Greg Wilson	Oct 11, 2016
Intelligent Chess Software	Jan 8, 2016
Intelligent Software	Dec 11, 2012
Kevin O’Connell	Dec 25, 2017
LogiChess	Jun 23, 2017
Mark Taylor	Jan 7, 2016
Moby	Jan 7, 2016
Nona	Jan 7, 2016
Richard Lang	Jan 7, 2016
SEX Algorithm	Nov 25, 2014
WCCC 1986	Jul 27, 2017
WMCCC 1983	Jun 5, 2017
WMCCC 1986	Jan 7, 2016
WMCCC 1987	Jan 7, 2016

Up one level

Diogenes

GerdIsenberg — Fri, 08 Jan 2016 15:46:57 GMT

Home * Engines * Diogenes

		Diogenes, a chess program by Jörg Burwitz. Diogenes is a DOS-program written in Turbo Pascal. It uses a fast, incremental updated evaluation, and applies a principal variation search with none recursive null move pruning of R=2, razoring, and has no Hash tables ^[1]. Diogenes played several International Paderborn Computer Chess Championships, Aegon Tournaments ^[2] and three World Microcomputer Chess Championships, Munich 1993, Paderborn 1995 and Jakarta 1996 ^[3] .
Diogenes sitting in his tub ^[4]

Screenshot

Diogenes ^[5]

Forum Posts

Help With Diogenes by Mark Loftus, CCC, October 02, 1998
Re: Diogenes ! by Jörg Burwitz, CCC, July 18, 1999

External Links

Chess Engine

Diogenes

Diogenes from Wikipedia

References

^ Summer98-Tournament: Description by Torsten Schoop
^ AEGON Tournaments Computer Results Summary
^ Diogenes' ICGA Tournaments
^ Diogenes sitting in his tub. Painting by Jean-Léon Gérôme (1860) from Wikipedia
^ Septober - Computerschach by Herbert Marquardt

What links here?

Page	Date Edited
Aegon 1995	Apr 6, 2017
Aegon 1996	Jan 22, 2017
Confucius	Aug 24, 2013
Diogenes	Jan 8, 2016
Engines	Mar 10, 2018
IPCCC 1993	Nov 1, 2016
IPCCC 1994	Jul 31, 2013
IPCCC 1997	Aug 24, 2013
IPCCC 1998	Feb 25, 2018
IPCCC 1999	Dec 21, 2012
Jörg Burwitz	Jan 8, 2016
Karsten Bauermeister	Sep 6, 2015
Milobarus	Nov 23, 2016
Pschach	Mar 22, 2016
WMCCC 1993	Dec 30, 2017
WMCCC 1995	Jan 3, 2018
WMCCC 1996	Sep 15, 2016

Up one level

Garbochess

GerdIsenberg — Sat, 23 Sep 2017 11:30:09 GMT

Home * Engines * Garbochess

		Garbochess, an UCI compliant open source chess engine by Gary Linscott. Starting with a 0x88 board representation in C#, which later evolved to the JavaScript version Garbochess-JS ^[1] aka Ajax chess ^[2], and was also incorporated in Silverlight Chess ^[3] for the Microsoft Silverlight framework ^[4], Version 2 was a complete rewrite in C++ using bitboards ^[5].
Garbo in Inspiration ^[6]

Features

^[7]

Move Generation

Magic Bitboards

Search

Evaluation

Forum Posts

2007 ...

New Chess Engine - Garbochess by Gary, CCC, September 29, 2007
Microsoft Silverlight Chess by Christopher Conkie, CCC, October 01, 2007
Re: Microsoft Silverlight Chess by Gary, CCC, October 01, 2007
Garbochess v2 released by Gary, CCC, March 01, 2008
Garbochess v2.10 released by Gary, CCC, March 27, 2008
Garbochess v2.11 released by Gary, CCC, April 09, 2008
Garbochess v2.20 released by Gary, CCC, April 13, 2008

2010 ...

Ajax chess by Gary, CCC, February 20, 2010 » Garbochess-JS
Compile request - GarboChess 3 by Tony Mokonen, CCC, July 12, 2011
GarbochessJS updated by Gary, CCC, December 08, 2012 » Garbochess-JS

External Links

Chess Engine

Gary Linscott's Home Page - Chess Programs
glinscott/Garbochess-3 · GitHub
Index of /chess/engines/Jim Ablett/GARBOCHESS compiled by Jim Ablett, hosted by Kirill Kryukov
GarboChess 3.0 64-bit in CCRL 40/40

Misc

References

^ glinscott/Garbochess-JS · GitHub
^ Ajax chess by Gary, CCC, February 20, 2010
^ Re: Microsoft Silverlight Chess by Gary, CCC, October 01, 2007
^ Gary Linscott's Home Page - Chess Programs, slchess.zip, GarboChess.cs
^ Garbochess v2 released by Gary, CCC, March 01, 2008
^ Greta Garbo in a publicity still for Inspiration (1931), author: Metro-Goldwyn-Mayer, Greta Garbo from Wikipedia
^ based on Garbochess-3/GarboChess3 at master · glinscott/Garbochess-3 · GitHub

What links here?

Page	Date Edited
Engines	Mar 10, 2018
Garbochess	Sep 23, 2017
Garbochess-JS	Sep 23, 2017
Gary Linscott	Jan 16, 2018

Up one Level

Hannibal

GerdIsenberg — Wed, 04 Oct 2017 19:07:58 GMT

Home * Engines * Hannibal

		Hannibal, an UCI compliant chess engine developed by Sam Hamilton and Edsel Apostol, supported by Audy Arandela in testing and maintaining the opening book. They share the common goal to make Hannibal as strong as possible. As of now, they are working on the tactical weakness, due to Edsel's non-conventional aggressive pruning methods, and the holes in the evaluation function ^[1]. Edsel will be working on SMP search ^[2], while Sam will be in charge of writing code to tune the parameters automatically. Hannibal incorporates ideas from their authors earlier engines LearningLemming and Twisted Logic. It uses alpha-beta, enhanced with various chess specific heuristics, and relies on a very selective search, endgame knowledge, and an understanding of material imbalances ^[3]. Bitboards are the basic data structure used to represent the board and to generate moves.
Hannibal crossing the Alps ^[4]

Etymology

Hannibal, from Phoenician hann - "grace" and baal - "master" or "lord", meaning “mercy of (the god) Ba'al” ^[5], was a Carthaginian general who fought the Roman Republic in the Second Punic War.

Tournaments

So far, Hannibal played the CCT12, WCRCC 2010, WCRCC 2011, and the ACCA 2011 online tournaments.

Selected Games

CCT12, round 5, Hannibal - Shredder ^[6]

[Event "CCT12"]
[Site "FICS"]
[Date "2010.02.20"]
[Round "5"]
[White "Hannibal"]
[Black "Shredder"]
[Result "1/2-1/2"]
 
1.e4 e5 2.Nf3 Nc6 3.Bb5 a6 4.Ba4 Nf6 5.O-O d6 6.Re1 Be7 7.c3 Bd7 8.d4 O-O 
9.Nbd2 exd4 10.cxd4 Nb4 11.Bxd7 Qxd7 12.Qb3 a5 13.a3 Na6 14.Qc2 h6 15.Nc4 
a4 16.Bd2 d5 17.exd5 Nxd5 18.b3 c5 19.bxa4 cxd4 20.Nce5 Qc7 21.Qe4 Qd8 
22.Qg4 Nc5 23.Bxh6 Bf6 24.Rac1 Nc3 25.Bg5 Rxa4 26.Bxf6 Qxf6 27.Nxd4 Rd8 
28.Rxc3 Raxd4 29.Qh5 Re4 30.Rce3 Rxe3 31.Rxe3 Qf5 32.g4 Qxh5 33.gxh5 Rd5 
34.Nc4 Rg5+ 35.Kh1 Rxh5 36.Re8+ Kh7 37.Nd6 Kg6 38.Re7 Rh3 39.Rxf7 Rd3 40.Rc7 
Ne6 41.Rd7 Kh5 42.h4 Kg4 43.Nf7 Rxd7 44.Ne5+ Kxh4 45.Nxd7 Nf4 46.Nc5 b6 
47.Nb3 Nd3 48.Kg2 Kg4 49.a4 Kf4 50.a5 bxa5 51.Nxa5 Ke4 1/2-1/2

Forum Posts

2010 ...

Twisted Logic 20100131x by Edsel Apostol, CCC, February 02, 2010
Hannibal 1.0 by Edsel Apostol, CCC, July 17, 2010
WCRCC 2010 - Hannibal games by Sam Hamilton, CCC, July 17, 2010 » WCRCC 2010
To Ed: Hannibal 1.0a ... Twisted Logic! by Frank Quisinsky, CCC, July 20, 2010
Hannibal opening book by Audy Arandela, CCC, July 21, 2010
Xmas SWCR gift: Booot won vs. Hannibal with 3 knights! by Frank Quisinsky, CCC, December 21, 2010 » Booot
Gaviota - Hannibal 5th round (great Hannibal game, watch it) by Miguel A. Ballicora, CCC, July 23, 2011
Reducing/Pruning Bad Captures (SEE < 0) by Edsel Apostol, CCC, August 19, 2011 » Pruning, Reductions, Captures, SEE
Hey Sam: Hannibal and obvious move heuristic by Charles Roberson, CCC, November 29, 2011
SMP and questions by Edsel Apostol, CCC, November 23, 2012 » Parallel Search
Hannibal 1.3 SMP by Edsel Apostol, CCC, December 31, 2012

2015 ...

Hannibal 1.5 release by Sam Hamilton, CCC, January 28, 2015
Hannibal 1.5 bug by Carl Langan, CCC, July 31, 2015
Hannibal 1.7 by Edsel Apostol, CCC, August 09, 2016

External Links

Chess Engine

Hannibal - Chess Engine Portal
Computerschach, Interview with Edsel Apostol by Frank Quisinsky, February 25, 2010
Hannibal 1.2 64-bit from CCRL 40/40

Misc

References

^ Computerschach, Interview with Edsel Apostol by Frank Quisinsky, February 25, 2010
^ SMP and questions by Edsel Apostol, CCC, November 23, 2012
^ Hannibal - Chess Engine Portal
^ Hannibal's celebrated feat in crossing the Alps with war elephants passed into European legend: detail of a fresco by Jacopo Ripanda, ca. 1510, Capitoline Museums, Rome, Hannibal from Wikipedia.
^ Hannibal - Wiktionary
^ CCT-12-Hannibal games hosted by Schachwelt, Computerschach, Interview with Edsel Apostol by Frank Quisinsky, February 25, 2010
^ This is actually The Senate / Me & You

What links here?

Page	Date Edited
ACCA 2011	Jul 14, 2014
CCT12	Jan 28, 2018
CCT15	Oct 21, 2014
Edsel Apostol	Nov 2, 2016
Elephant	Sep 19, 2016
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Hannibal	Oct 4, 2017
LearningLemming	Jun 29, 2013
Nebula	Feb 7, 2015
Parallel Search	Dec 30, 2017
PT 47	Dec 1, 2014
Sam Hamilton	Jan 28, 2015
SMP	Dec 26, 2017
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
Twisted Logic	Nov 23, 2012
WCRCC 2010	Jul 14, 2014
WCRCC 2011	Oct 21, 2014
WCRCC 2015	Jul 19, 2015

Up one Level

Hermann

GerdIsenberg — Thu, 07 Dec 2017 22:18:15 GMT

Home * Engines * Hermann

		Hermann, a Chess Engine Communication Protocol compliant chess engine by Volker Annuss, able to play Chess960. Hermann is Arena partner engine, participating the Chess960CWC 2005, Chess960CWC 2006, CPT 2009, CPT 2010 and various Dutch Open Computer Chess Championships and International CSVN Tournaments, third place at ICT 2009. Hermann uses bitboards as basic data structure, determines sliding piece attacks with fixed shift magic bitboards ^[1], and applies neural networks for material evaluation and timing ^[2] ^[3] ^[4]. In 2011, Volker Annuss confirmed his soft spot for his engine names associated with the legacy of romantic German nationalism by calling Hermann's completely restructured successor with its Latinised name Arminius ^[5]. In Germany, Arminius was rechristened Hermann (Heer Mann - army man) by Martin Luther, and he became an emblem of the revival of German nationalism fueled by the wars of Napoleon in the 19th century ^[6].
Hermann Heights Monument ^[7] ^[8]

Photos & Games

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

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

Forum Posts

Hermann 2.3 : 2432 by Patrick Buchmann, CCC, June 05, 2008
Hermann 2.4 : 2416 by Patrick Buchmann, CCC, November 23, 2008
Hermann 2.5 : 2471 by Patrick Buchmann, CCC, October 12, 2009
Re: Chess program with Artificial Neural Networks (ANN)? by Volker Annuss, CCC, January 08, 2010
Re: Programmers: what's the story behind the name of your engine by Volker Annuss, CCC, June 21, 2011
Re: Is there place for neural networks in chess engines? by Volker Annuss, CCC, December 04, 2011
Hermann 1.6.28 by Wolfgang Battig, January 14, 2015

External Links

Chess Engine

Misc

References

^ Fixed shift magics with 800KB lookup table by Volker Annuss, Winboard Forum, September 05, 2010
^ Re: Chess program with Artificial Neural Networks (ANN)? by Volker Annuss, CCC, January 08, 2010
^ Re: Is there place for neural networks in chess engines? by Volker Annuss, CCC, December 04, 2011
^ Timing with a neural network by Volker Annuss, March 23, 2005, from Free chess graphical user interface (GUI) Arena for chess engines, News-Ticker, Page 6, 86, FQ
^ Pandix wins Dutch Open, CSVN site, October 22, 2011
^ Arminius from Wikipedia - Martin Luther
^ Hermann Heights Monument from Wikipedia, New Ulm, Minnesota
^ Arminius from Wikipedia
^ 6th International CSVN Tournament 2006 - Photo Gallery
^ Downloads | CSVN International Computerchess Tournament | Games | ICT Leiden 2006, CSVN site
^ Thusnelda from Wikipedia

What links here?

Page	Date Edited
Arena	Mar 16, 2018
Argonaut	Apr 15, 2013
Arminius	Aug 5, 2017
Chess960CWC 2005	Jan 1, 2016
Chess960CWC 2006	Sep 25, 2014
CPT 2009	Jan 17, 2013
CPT 2010	Jan 17, 2013
DOCCC 2006	Aug 27, 2016
DOCCC 2007	Aug 15, 2015
DOCCC 2008	Aug 15, 2015
DOCCC 2009	Aug 15, 2015
DOCCC 2010	Aug 15, 2015
Engines	Mar 10, 2018
Hermann	Dec 7, 2017
ICT 2006	Oct 14, 2015
ICT 2007	Sep 14, 2015
ICT 2008	Sep 14, 2015
ICT 2009	Sep 14, 2015
ICT 2011	Mar 9, 2012
Ivo Tops	Oct 26, 2012
Ktulu	May 16, 2015
Neural Networks	Mar 12, 2018
Stoofvlees	Dec 7, 2017
Tzunami	Aug 19, 2016
Volker Annuss	Aug 3, 2017

Up one Level

Houdini

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

Home * Engines * Houdini

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

Houdini 5

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

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

Houdini 6

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

Houdini's Origin

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

Sources of Inspiration

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

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

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

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

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

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

Material Table

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

Strelka 5

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

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

Reply by Richard Vida ^[21]

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

Release Dates

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

Publications

Harry Houdini

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

Chess Engine

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

Forum Posts

2010 ...

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

2011

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

2012

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

2013

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

2014

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

2015 ...

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

2016

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

2017

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

2018

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

External Links

Chess Engine

Harry Houdini

References

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

What links here?

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

Up one level

Machiavelli

GerdIsenberg — Tue, 02 Jun 2015 18:09:19 GMT

Home * Engines * Machiavelli

		Machiavelli, a chess program developed in 1947-1948 by Donald Michie and Shaun Wylie which was a rival "paper machine" of Alan Turing's and David Champernowne's Turochamp. Turing began programming both at University of Manchester but never completed them and they never played each other ^[1]. In their 1961 article Machines that play games ^[2], John Maynard Smith and Donald Michie elaborate the evaluation features of their one-ply analyzers SOMA and Machiavelli, to consider material, center and neighboring king square control, pieces en-prise, swap-off values and other tactical and strategical considerations. Later, John Maynard Smith built a SOMA-Machiavelli hybrid named SOMAC (SOMA with features taken from the Machiavelli) ^[3]. This machine, when allowed a lookahead of two, has a standard of play equal to that of a mediocre human player ... ^[4] ^[5]
Il Principe, 1532 ^[6]

SOMA - Machiavelli

Following game between SOMA and Machiavelli was played, with the conclusion that it seems unlikely that a one-ply analyzer would beat any but the most inexperienced human player.

[Event "?"]
[Site "?"]
[Date "1961.??.??"]
[Round "?"]
[White "SOMA"]
[Black "Machiavelli"]
[Result "1/2-1/2"]
 
1.e3 e5 2.d4 Nc6 3.Nc3 d5 4.Nf3 e4 5.Ne5 Bb4 6.Nxc6 bxc6 7.Bd2 Nf6 8.a3 Bd6 9.h4
Bg4 10.Be2 Qd7 11.O-O O-O-O 12.f3 Bf5 13.fxe4 Bxe4 14.Ba6+ Kb8 15.Nxe4 Nxe4 16.Qe2
Qe6 17.Ba5 Ng3 18.Qf3 Nxf1 19.Rxf1 f6 20.Rd1 Qe4 21.Qxe4 dxe4 22.d5 cxd5 23.Rxd5
Be5 24.Rb5+ Ka8 25.Bb7+ Kb8 26.Bxe4+ Kc8 27.Bf5+ Rd7 28.Bxd7+ Kxd7
1/2-1/2 {agreed}

Publications

John Maynard Smith, Donald Michie (1961). Machines that play games. New Scientist, 12, 367-9. google books
Donald Michie (1966). Game Playing and Game Learning Automata. Advances in Programming and Non-Numerical Computation, Leslie Fox (ed.), pp 183-200. Oxford, Pergamon. » Includes Appendix: Rules of SOMAC by John Maynard Smith ^[7]
Donald Michie (1974). On Machine Intelligence. Edinburgh: University Press, ISBN 10: 085224262X, ISBN 13: 9780852242629, abebooks.com, alibris.com, biblio.com
Andrew S. Gordon (2001). Playing Chess with Machiavelli: Improving Interactive Entertainment with Explicit Strategies. AAAI Technical Report, pdf

External Links

References

^ Chronology of Computing compiled by David Singmaster
^ John Maynard Smith, Donald Michie (1961). Machines that play games. New Scientist, 12, 367-9. google books
^ Donald Michie (1966). Game Playing and Game Learning Automata. Advances in Programming and Non-Numerical Computation, Leslie Fox (ed.), pp 183-200. Oxford, Pergamon. » Includes Appendix: Rules of SOMAC by John Maynard Smith
^ Leslie Fox (1966). Advances in programming and non-numerical computation. Pergamon
^ Donald Michie (1974). On Machine Intelligence. Edinburgh: University Press, ISBN 10: 085224262X, ISBN 13: 9780852242629, abebooks.com, alibris.com, biblio.com
^ The Prince from Wikipedia
^ see Swap-off by Helmut Richter

What links here?

Page	Date Edited
Alan Turing	Feb 8, 2017
Donald Michie	Dec 23, 2017
Engines	Mar 10, 2018
Ferranti Mark 1	Jun 2, 2015
History	Jan 2, 2018
John Maynard Smith	Nov 27, 2017
KriegSpiel	Sep 5, 2017
Machiavelli	Jun 2, 2015
Mathematician	Apr 9, 2018
Shaun Wylie	Jun 2, 2015
SOMA	Mar 25, 2015
Turochamp	Dec 14, 2017

Up one Level

Milobarus

GerdIsenberg — Wed, 23 Nov 2016 21:41:36 GMT

Home * Engines * Milobarus

		Milobarus, a dedicated chess computer prototype build by Rainer Serfling. It consists of a sensory board and standard PC-hardware with 80486 inside, and ran a chess program based on Jörg Burwitz' Diogenes. Milobarus played the Aegon 1994 ^[1] and finished with 1½ out of 6 and three draws. The computer's name apparently was devoted to strongman Milo Barus (1906 - 1977), at times innkeeper of Klosterbräu-Stübl in Stadtroda and Meuschkensmühle in Eisenberger Mühltal near Weißenborn, Thuringia, close to Rainer Serfling's home.
Milo Barus ^[2]

Selected Games

Aegon 1994, Round 4, Ada van der Giessen - Milobarus ^[3]

[Event "Aegon 1994"]
[Site "The Hague NED"]
[Date "1994.05.04"]
[Round "?"]
[White "Ada van der Giessen"]
[Black "Milobarus"]
[Result "1/2-1/2"]
 
1.e4 e5 2.Bc4 Nf6 3.d3 c6 4.f4 Bb4+ 5.c3 Bd6 6.fxe5 Bxe5 7.Nf3 Bc7 8.Bg5 h6
9.Bh4 g5 10.Bf2 d5 11.exd5 Qe7+ 12.Qe2 Qxe2+ 13.Kxe2 cxd5 14.Bb3 Nc6 15.Na3 
O-O 16.Rae1 Bg4 17.h3 Rae8+ 18.Kd2 Bxf3 19.gxf3 Bf4+ 20.Kc2 Rxe1 21.Rxe1 Rc8 
22.Kd1 Kg7 23.Nb5 a6 24.Nd4 Kg6 25.Bc2 Nxd4 26.Bxd4 Bg3 27.Re2 Nh5 28.Be5 Bf4 
29.d4+ f5 30.Bxf4 Nxf4 31.Re7 b5 32.Rd7 Rf8 33.Bb3 Nxh3 34.Bxd5 Nf4 35.Bb7 Rf6 
36.d5 Nd3 37.Rc7 Nxb2+ 38.Ke2 g4 39.Rc6 gxf3+ 40.Kxf3 a5 41.Ba6 Nc4 42.Rxf6+ 
Kxf6 43.Bxb5 Nd6 44.Bd3 Ke5 45.c4 Kd4 46.Bf1 h5 47.Kg3 a4 48.Kh4 f4 49.Kxh5 f3 
50.Kg4 f2 51.Kf3 Nxc4 52.Bxc4 Kxc4 1/2-1/2

Publications

Editor (1994). Wunderkiste aus dem Osten. Computerschach und Spiele, 1/94, pdf hosted by Hein Veldhuis (German)

External Links

Milo Barus einst stärkster Mann der Welt (German)
Milo Barus (bürgerlicher Name Emil Bahr) from Wikipedia (German)

References

What links here?

Page	Date Edited
Aegon 1994	Mar 26, 2017
Engines	Mar 10, 2018
Jörg Burwitz	Jan 8, 2016
Milobarus	Nov 23, 2016
Rainer Serfling	Dec 21, 2014

Up one level

Natwarlal

GerdIsenberg — Tue, 27 Aug 2013 05:33:42 GMT

Home * Engines * Natwarlal

		Natwarlal, a Chess Engine Communication Protocol compliant open source chess engine written by Pallav Nawani in C++. Natwarlal played the CCT9 with respectable 4/7. The name of the engine was inspired by Mithilesh Kumar Srivastava, better known as Natwarlal, a Indian con man ^[1] known for having repeatedly "sold" the Taj Mahal, the Red Fort, and the Rashtrapati Bhavan and also the Parliament House of India along with its 545 sitting members. He was a living-legend in his lifetime and a legend even after his death ^[2].
Natwarlal ^[3]

Description

Natwarlal uses a 0x88 board array along with piece-lists to represent the board. It features a negamax alpha-beta PVS with various extensions, reductions, null move and futility pruning, and double transposition tables inside an iterative deepening framework with aspiration windows. The evaluation considers pawn structure and king safety ^[4].

Selected Games

CCT9, Natwarlal - Berta ^[5]

[Event "CCT9"]
[Site "Internet Chess Club"]
[Date "2007.02.18"]
[Round "?"]
[White "Natwarlal"]
[Black "Berta"]
[Result "1-0"]
 
1.e4 e6 2.Nf3 d5 3.Nc3 Nf6 4.exd5 exd5 5.d4 c6 6.Bd3 Be7 7.O-O O-O 8.Re1 Bg4 
9.h3 Bh5 10.Bf4 Bd6 11.Be5 Bb4 12.Bf5 Nfd7 13.Bf4 Bxc3 14.bxc3 Nb6 15.Rb1 N8d7 
16.Qd3 Nf6 17.Bg5 h6 18.Bh4 g6 19.Ne5 Qd6 20.a4 Rae8 21.Qg3 Re7 22.Re3 Rd8 
23.Rb4 Kf8 24.a5 gxf5 25.axb6 a5 26.Ra4 Ne4 27.Qf4 Ng5 28.Bxg5 hxg5 29.Qxg5 f6 
30.Qxh5 fxe5 31.Rg3 Rf7 32.Rg6 Qxg6 33.Qxg6 exd4 34.cxd4 Ra8 35.f4 Rg7 36.Qxf5 
Kg8 37.Qe6 Kh7 38.f5 Rf8 39.Rxa5 Rfg8 40.g4 Rf8 41.f6 Rgf7 42.g5 Kg6 43.Ra3 c5 
44.Rf3 Kh7 45.g6 Kh8 46.gxf7 Ra8 47.Qxd5 Ra1 48.Kf2 Rf1 49.Kxf1 cxd4 50.Qh5#

Forum Posts

2004

New chess engine by Pallav Nawani, Winboard Forum, March 16, 2004
Natwarlal V0.03 by Pallav Nawani, Winboard Forum, May 29, 2004
Just released Natwarlal v0.04 by Pallav Nawani, Winboard Forum, July 01, 2004
Natwarlal v0.05 by Pallav Nawani, Winboard Forum, July 12, 2004
With big hash Natwarlal v0.06 searches pretty fast... by Dann Corbit, Winboard Forum, September 24, 2004
Natwarlal V0.07 by Pallav Nawani, Winboard Forum, September 26, 2004
Natwarlal V0.08 by Pallav Nawani, Winboard Forum, October 10, 2004
Natwarlal v0.09 by Pallav Nawani, Winboard Forum, October 31, 2004

2005

Natwarlal 0.06....a tactical monster! by Dr.Wael Deeb, Winboard Forum, February 04, 2005
Natwarlal v0.10 by Pallav Nawani, Winboard Forum, February 28, 2005
Natwarlal v0.11 by Pallav Nawani, Winboard Forum, March 06, 2005
Re: New Engine classifications by Pallav Nawani, Winboard Forum, April 08, 2005
Re: copying evaluation of other programs by Pallav Nawani, Winboard Forum, May 12, 2005
Re: copying evaluation of other programs by Pallav Nawani, Winboard Forum, May 13, 2005
Re: how much open source code did you read and understand? by Pallav Nawani, Winboard Forum, June 30, 2005
Re: Piece-list representation by Pallav Nawani, Winboard Forum, July 17, 2005

External Links

Chess Engine

Natwarlal from WBEC Ridderkerk
Mac Chess Engines Repository hosted by Julien Marcel
Pallav's Domain - Natwarlal

Misc

Natwarlal from Wikipedia
Nuts about Natwarlal by Faizan Ahmad, The Times of India, April 23, 2011
Mr.Natwarlal-The Great ConMan of India | All Resource by Harsha, August 13, 2013
Mr. Natwarlal from Wikipedia

References

^ Re: New Engine classifications by Pallav Nawani, Winboard Forum, April 08, 2005
^ Natwarlal from Wikipedia
^ Mr.Natwarlal-The Great ConMan of India | All Resource by Harsha, August 13, 2013
^ Pallav's Domain - Natwarlal
^ Replay Zone | CCT Events

What links here?

Page	Date Edited
CCT9	Aug 25, 2013
Engines	Mar 10, 2018
MessChess	Mar 6, 2014
Natwarlal	Aug 26, 2013
Pallav Nawani	Aug 25, 2013

Up one Level

Rasputin

GerdIsenberg — Thu, 07 Sep 2017 19:38:49 GMT

Home * Engines * Rasputin

		Rasputin, a mainframe chess program written by Jeff Rollason in Assembly at Westfield College ^[1]. Rasputin, beside Merlin Rollason's second chess program, was apparently a Swapping Off Material Analyzer (SOMA) approach with a static lookahead that allowed the program to play with tiny search trees. Rasputin entered international competition in 1979 in participating the Second European Computer Chess Championship in London.
Grigori Rasputin ^[2] ^[3]

Games

ECCC 1979, Rasputin - Parwell ^[4]

[Event "ECCC 1979"]
[Site "London"]
[Date "1979.09.27"]
[Round "?"]
[White "Rasputin"]
[Black "Parwell"]
[Result "0-1"]
 
1.e4 Nf6 2.e5 Nd5 3.d4 Nc6 4.c4 Nb6 5.c5 Nd5 6.Bc4 e6 7.Nf3 d6 8.Bxd5 exd5
9.cxd6 cxd6 10.Bg5 Qa5+ 11.Bd2 Qc7 12.Bf4 Bg4 13.Nc3 Bxf3 14.gxf3 dxe5 15.Nxd5 Qa5+
16.Kf1 Qxd5 17.dxe5 Qc4+ 18.Qe2 Qxf4 19.e6 Be7 20.exf7+ Qxf7 21.Rg1 O-O 22.Rg3 Nd4
23.Qe4 Nxf3 24.Qxb7 Nxh2+ 25.Kg2 Qxf2+ 26.Kh3 Nf1 27.Rd3 Qh4+ 28.Kg2 Qh2# 0-1

External Links

References

^ Jeff Rollason from Wikipedia
^ Rotten Library | Rasputin
^ Russian Revolution from Wikipedia
^ Partie: Rasputin - Parwell (SMS 201), Computerwoche, November 02, 1979 (German)

What links here?

Page	Date Edited
Computerworld	Sep 9, 2017
ECCC 1979	Sep 9, 2017
Engines	Mar 10, 2018
Jeff Rollason	Dec 23, 2016
Merlin	Jan 20, 2018
Merlin (GB)	Mar 25, 2015
Merlin (HU)	Jan 7, 2016
Rasputin	Sep 7, 2017

Up one level

Sargon

GerdIsenberg — Mon, 25 Dec 2017 17:34:17 GMT

Home * Engines * Sargon

		Sargon, a family of chess programs by Dan and Kathe Spracklen. They started chess programming in 1977 on a Z-80 based Wavemate Jupiter III ^[1] in assembly language. The first Sargon version had a 10x12 board board representation and a two ply alpha-beta search without quiescence but a SOMA like exchange evaluation ^[2] ^[3]. After first tournament successes in 1978, at The Second West Coast Computer Faire, winning with a 100% score ^[4], and the shared third place at ACM 1978 already with Sargon II, the Spracklens became professional computer chess programmers. They first started selling their well commented Sargon I Z-80 assembly listing as paper copy for $15 by their own ^[5], and then made a contract with Hayden Books to publish a book about Sargon with explanations and listing ^[6]. Hayden Software ^[7] remained primary distributor of all further Sargon software versions, even when the Spracklens worked full time for Fidelity Electronics during the 80s.
Sargon I for the Apple II ^[8]

Pages with Spracklen Quotes

MOS Technology

Sargon I was already ported to the Apple II by Kathe Spracklen's brother, Gary Shannon ^[9]. Despite its lower frequency, they found the 6502 the much better processor for their program than the Z80, and soon the MOS Technology processor became the major target platform.

Sargon II

Sargon II was written for various Z-80 and 6502 based home computers, and was base for their first dedicated unit, the Chafitz ARB Sargon 2.5 ^[10]. After civil proceedings between manufacturer Applied Concepts ^[11] and their sales company Chafitz, the Spracklens began their long term collaboration with Sidney Samole and Fidelity Electronics in the 80s. Sargon II already played the ACM 1978 still with the Jupiter III, and the WMCCC 1980, where it had to compete with its dedicated relatives, winner Chess Challenger, runner up Boris Experimental, Sargon 2.5 Modular GS and Sargon 2.5 Auto RB, and became tied third with 3/5, last game losing from Challenger.

Sargon III

Sargon III was a complete rewrite, using quiescence search, and a transposition table with BCH hashing. Sargon III was ported to the 68000, to be the first third-party executable software for the Macintosh ^[12]. The 8086 Sargon III port for PC was done by Kevin Leavelle in 1984 ^[13], so that three Sargon 3 software versions played the WMCCC 1984, where the Fidelity Electronics Elite by the same authors tied for first place, the Apple II became 10th with 4/7, the Macintosh 12th with 3½/7 and the 8088 Compaq PC 17th with 2½/7. In cooperation agreement between Fidelity Electronics and Software Toolworks in 1988, an enhanced and improved Sargon III was market as Fidelity Chessmaster 2100 ^[14].

Photos & Games

Mike

Kathe Spracklen and Mike Johnson, Mike vs. Sargon 2, ACM 1978 ^[15] ^[16]

[Event "ACM 1978"]
[Site "Washington USA"]
[Date "1978.12.04"]
[Round "3"]
[White "Mike"]
[Black "Sargon 2"]
[Result "1/2-1/2"]
 
1.e4 e5 2.d4 Nc6 3.d5 Nb4 4.c3 Na6 5.f4 Nc5 6.fxe5 Qh4+ 7.Kd2 Nxe4+ 8.Kc2 Nf2
9.Qe1 Bc5 10.Nf3 Qh5 11.Rg1 Ne7 12.Be3 Qg6+ 13.Kc1 Bxe3+ 14.Qxe3 Ng4 15.Qd2 d6
16.Bd3 Qh5 17.Bb5+ Bd7 18.Bxd7+ Kxd7 19.exd6 cxd6 20.h3 Nf6 21.Qg5 Qxg5+
22.Nxg5 Rhf8 23.c4 Rac8 24.Nd2 Nexd5 25.Kb1 Ne3 26.Nge4 Nxe4 27.Nxe4 Rxc4
28.Nc3 f5 29.a4 d5 30.g3 Rf6 31.Re1 d4 32.Nb5 a6 33.Nxd4 f4 34.gxf4 Rxd4
35.Rxe3 Rfxf4 36.a5 Rd1+ 37.Ka2 Ra4+ 38.Ra3 Rxa3+ 39.bxa3 Rd2+ 40.Kb3 Rd3+
41.Kc4 Rxh3 42.Rd1+ Kc6 43.a4 Rh5 44.Kb4 Rh4+ 45.Kb3 Rh3+ 46.Kc4 Rh5
47.Kb4 Rh4+ 48.Kb3 Rh3+ 49.Kc4 Rh5 50.Kb4 Rh4+ 1/2-1/2

Awit

Dan and Kathe Spracklen from their oral history on the Sargon 2 vs Awit game, round 4, ACM 1978 ^[17] ^[18]:

I think the most exciting part for us was the last round of the tournament, when we played Tony Marsland’s program Awit. It was a 6 million dollar Amdahl computer. And we won the game. And we were just amazed. I remember, at the time, we won it. And there was a huge audience there. There was like a hundred people sitting out there, watching it, and they just all started cheering and clapping. And then we woke up the following morning to a big article in the Washington Post that says, Microcomputer Beats 6 Million Dollar Machine, or something like that.

[Event "ACM 1978"]
[Site "Washington USA"]
[Date "1978.12.05"]
[Round "4"]
[White "Sargon 2"]
[Black "Awit"]
[Result "1-0"]
 
1.e4 c5 2.d4 cxd4 3.Qxd4 Nc6 4.Qe3 Nf6 5.Nf3 e6 6.Nc3 Bb4 7.Bb5 a6 8.Bxc6 dxc6 
9.Bd2 Ng4 10.Qf4 Nf6 11.O-O O-O 12.Rad1 b5 13.Be3 Qa5 14.Bd4 Bxc3 15.Bxc3 Qxa2 
16.Bxf6 gxf6 17.Qxf6 Qc4 18.Qg5+ Kh8 19.Qf6+ Kg8 20.Qg5+ Kh8 21.Rd8 Rxd8 22.Qf6+ 
Kg8 23.Qg5+ Kf8 24.Qxd8+ Kg7 25.Qg5+ Kf8 26.Qd8+ Kg7 27.Qd4+ Qxd4 28.Nxd4 Bb7
29.Re1 Kg6 30.Re3 Rd8 31.Rd3 c5 32.Nxe6 Rxd3 33.Nf4+ Kg5 34.Nxd3 Bxe4 35.Nxc5 
Bxc2 36.Nxa6 Bb3 37.Nc5 Bd5 38.g3 Bf3 39.Nb3 b4 40.Nd4 Be4 41.f3 Bb7 42.Kf2 h6 
43.Ke3 Bd5 44.Nc2 b3 45.Nd4 Kg6 46.Kd3 Kh7 47.f4 Kg8 48.Kc3 Kg7 49.Nxb3 Bxb3 
50.Kxb3 Kf6 51.Kc4 Ke7 52.b4 Kd7 53.Kd5 h5 54.b5 Kc7 55.Kc5 Kb7 56.b6 Kb8 57.Kc6
Kc8 58.b7+ Kb8 59.Kb6 h4 60.gxh4 f6 61.h5 f5 62.Kc6 Ka7 63.Kc7 Ka6 64.b8=Q Ka5 
65.Qb3 Ka6 66.Qa4# 1-0

Pages with Spracklen Quotes

Publications

1978 ...

Dan Spracklen, Kathe Spracklen (1978). SARGON: A Computer Chess Program. Hayden Bk.Co.
Chris Morgan (1978). The Second West Coast Computer Faire. BYTE, Vol. 3, No. 7 » MCCT 1978
Dan Spracklen, Kathe Spracklen (1978). First Steps in Computer Chess Programming. BYTE, Vol. 3, No. 10, pdf from The Computer History Museum
Dan Spracklen, Kathe Spracklen (1978). An Exchange Evaluator for Computer Chess. BYTE, Vol. 3, No. 11
Kathe Spracklen (1978). The Making of Sargon. Personal Computing, Vol. 2, No. 12, pp. 62
Kathe Spracklen (1979). The Playing of Sargon. Personal Computing, Vol. 3, No. 1, pp. 70
Harry Shershow (1979). A Little Bit is a Little Better. Personal Computing, Vol. 3, No. 4, pp. 61 » Sargon - Awit
Harry Shershow (1979). Chafitz' Big Move in Computer Chess. Personal Computing, Vol. 3, No. 9, pp. 59 » Boris, Chafitz
Charles Sullivan Jr. (1979). A Chess Program for the Apple. Personal Computing, Vol. 3, No. 9, pp. 60 » Apple II

1980 ...

Lynn L. Beavers (1980). Sargon II: A Human View. Personal Computing, Vol. 4, No. 9, pp. 79
Editor (1980). The battle of Boris 2.5 vs Sargon 2.5 Personal Computing, Vol. 4, No. 10, pp. 83 » Boris 2.5, Applied Concepts, Chafitz
William Fink (1981). Sfinks riddles Sargon II. Personal Computing, Vol. 5, No. 3, pp. 104 » Sfinks
John F. White (1981). Survey-Chess Games. Your Computer, August/September 1981
John F. White (1982). Review-Chess Computers. Your Computer, March 1982

2000 ...

Rob van Son (2003). Sargon fought until the very end!. Selective Search 106, pdf hosted by Hein Veldhuis (2016)
Gardner Hendrie (2005). Oral History of Kathe and Dan Spracklen. pdf and Video from The Computer History Museum
Rob van Son (2011). De Assyrische krijgsman die vaak won! (Dutch) pdf hosted by Hein Veldhuis

Forum Posts

1989

Sargon IV by Paul H. Nelson, rgc, August 08, 1989

1990 ...

Sargon V rating ("they claim") by John M. Nason, rgc, September 18, 1992
Is Sargon IV System 7 compatible? by Bertrand Limoges, rgc, October 27, 1992
Strength of Sargon III on Commodore 64 by Daniel Marsalone, rgc, January 08, 1993
Sargon 4 by Michael M Gorman Jr, rgc, May 27, 1993
Sargon by Randal Dean, rgcc, March 27, 1997
Sargon V by parrot-head, rgcc, September 15, 1999
Sargon V: from 486-33Mhz to Pentium 266 Mhz by Fernando Villegas, CCC, December 26, 1999
Sargon Coming down in Flames... by Fernando Villegas, CCC, December 27, 1999

2000 ...

OLD Sargon II and Sargon III chess programs by Osorio Meirelles, CCC, April 18, 2000
Is Sargon V code written by Dan and Kathy Spracklen ? by Osorio Meirelles, CCC, June 23, 2000
Help with old software - Sargon III by José Carlos, CCC, November 29, 2001
Re: Amusing errors to Sargon 4 by Fernando Villegas, CCC, August 04, 2002
Sargon III for the PC by Jeff White, CCC, January 18, 2003
Sargon V by Bryan Whitby, CCC, May 12, 2003
Old Sargon source articles by Jan Willem de Kort, CCC, June 04, 2003

2010 ...

Re: La Máquina Preservadora. Programas de Ajedrez by Luis a, Meca Foro, May 30, 2013 (Spanish) » Macintosh
SARGON by Vegan, Rybka Forum, April 08, 2015
Kevin. E. leavelle by Fernando, Hiarcs Forum, February 18, 2017

External Links

Sargon (chess) from Wikipedia
Sargon's ICGA Tournaments
The chess games of Sargon from chessgames.com
Classic Computer Chess - ... The programs of yesteryear by Carey, hosted by the Internet Archive ^[19]
How Far We've Come: 20 Years of Personal Computing by Blake Linton Wilfong, November 05, 2000 » ACM 1981, Cray Blitz, Crafty
Sargon – a chess program from the past from ChessBase News, June 27, 2003
Chess For Everyone - Micros Become Masters from The Computer History Museum
Computer Schach by Andre Adrian (German)
Sargon Z80 assembly listing by Dan and Kathe Spracklen, hosted by Andre Adrian
Sargon series - MobyGames

Sargon II

Apple II, Atari 8-bit, Commodore VIC-20, Commodore 64, TRS-80

Sargon III

Apple II, Amiga, Atari 8-bit, Atari ST, Commodore 64, Macintosh, PC

Sargon 4

Macintosh, PC

The Personal Computer Museum, Brantford, Ontario, Canada - Sargon 4
Sargon 4 for DOS (1989) - MobyGames
Sargon IV and Printer Interface III by David Plotkin, STart Vol. 3 No. 9, April 1989

Sargon 5

Macintosh, PC, Philips CD-i

Misc

References

^ Jupiter II-1975
^ Dan Spracklen and Kathe Spracklen (1978). First Steps in Computer Chess Programming Byte Publications Inc., as pdf reprint from The Computer History Museum
^ Sargon Z80 assembly listing by Dan and Kathe Spracklen, hosted by Andre Adrian
^ Chris Morgan (1978). The Second West Coast Computer Faire. BYTE, Vol. 3, No. 7, hosted by Modern Mechanix, Photo 4: Ira Baxter’s chess playing system display, which competed in the Microcomputer Chess Tournament at the Faire. The level of play was impressive, and the winning program, called SARGON, was a 16 K byte Z-80 assembler program written by a husband and wife team, Kathe and Dan Spracklen.
^ page 25 in Gardner Hendrie (2005). Oral History of Kathe and Dan Spracklen. pdf from The Computer History Museum
^ Dan Spracklen and Kathe Spracklen (1978). SARGON: A Computer Chess Program. Hayden Bk.Co. ISBN: 978-0810451551, amazon.com
^ Hayden Software Co. - MobyGames
^ Sargon (chess) from Wikipedia
^ page 30 in Gardner Hendrie (2005). Oral History of Kathe and Dan Spracklen. pdf from The Computer History Museum
^ Chafitz ARB Sargon 2.5 from Schachcomputer.info Wiki
^ Great Game Machine
^ Gardner Hendrie (2005). Oral History of Kathe and Dan Spracklen. pdf from The Computer History Museum
^ Kevin Leavelle Video Game Credits and Biography - MobyGames
^ Reply by Mark Manyen in Fidelity Chessmaster 2100 from The Spacious Mind
^ Chess Computers - The UK Story from Chess Computer UK by Mike Watters
^ PGN Download NACCC from Computerschaak/Downloads/Games hosted by CSVN
^ page 35-36 in Gardner Hendrie (2005). Oral History of Kathe and Dan Spracklen. pdf from The Computer History Museum
^ see also Harry Shershow (1979). A Little Bit is a Little Better. Personal Computing, Vol. 3, No. 4, pp. 61
^ Re: Old programs CHAOS and USC by Dann Corbit, CCC, July 11, 2015

What links here?

Page	Date Edited
10x12 Board	Feb 19, 2018
6502	Dec 25, 2017
ACM 1978	Dec 23, 2017
Albatross	May 5, 2017
AMDAHL 470	Jul 19, 2016
Amiga	Mar 24, 2016
Andre Adrian	Jan 16, 2012
Apple II	Dec 22, 2017
Applied Concepts	Dec 25, 2017
Assembly	Sep 3, 2017
Atari 8-bit	Aug 3, 2016
Atari ST	Dec 7, 2016
Awit	Dec 22, 2017
Bebe	Dec 23, 2017
Boris	Dec 25, 2017
Boris Baczynskyj	Oct 1, 2016
Byte Magazine	Nov 20, 2016
Canadian Computer Chess Invitational Championship 1984	Mar 2, 2013
Chafitz	Dec 25, 2017
Chafitz ARB Sargon 2.5	Sep 9, 2017
Chafitz Modular Game System	Dec 25, 2017
Chess Challenger	Dec 27, 2017
Chessmaster	Jan 21, 2018
Chessnut	Dec 10, 2016
Commodore ChessMate	Jan 26, 2016
Crafty	Jan 28, 2018
Cray Blitz	Dec 25, 2017
Dan Spracklen	Jan 17, 2017
David Broughton	Jan 7, 2016
Elegance	Jan 8, 2016
Elite	Oct 1, 2016
Elmar Henne	Sep 9, 2017
Engines	Mar 10, 2018
Excel	Dec 5, 2016
Excellence	Mar 23, 2014
Fernando Villegas	Aug 15, 2016
Fidelity	Jan 7, 2016
Gambiet	Jan 8, 2016
Gedeon	Jan 8, 2016
Great Game Machine	Dec 20, 2017
Harry Shershow	Dec 27, 2017
Ira Baxter	Dec 22, 2017
John Aker	Dec 26, 2017
Kathe Spracklen	Dec 25, 2017
Kevin Leavelle	Feb 19, 2017
L'Empereur	Jan 8, 2016
MCCT 1978	Dec 22, 2017
MicroChess	Jul 14, 2015
Microtrend	Dec 3, 2012
Mike	Jan 8, 2016
Mike Johnson	Jan 7, 2016
Morphy	Dec 25, 2017
Par Excellence	Mar 23, 2014
PCW Microcomputer Chess Championship	May 22, 2016
PCW-MCC 1979	Dec 23, 2017
Personal Computing	Dec 27, 2017
Prédateur	Nov 11, 2016
Private Line	Jan 8, 2016
Querg	Dec 11, 2013
Rex Kent	Jan 8, 2016
Richard Lang	Jan 7, 2016
Rob van Son	Dec 27, 2017
Ron Nelson	Feb 4, 2016
Sargon	Dec 25, 2017
SD Chess	Dec 22, 2017
Sfinks	Dec 25, 2017
Shawn Benn	Jan 2, 2015
SOMA	Mar 25, 2015
Stockholm MCCT 1979	Oct 12, 2013
Terry Fredrick	Nov 21, 2012
The Penrod Memorial Microchess Tournament	Dec 22, 2017
TRS-80	May 20, 2015
Vega	Jan 8, 2016
William Fink	Dec 25, 2017
Wim Rens	Jul 21, 2016
WMCCC 1980	Dec 25, 2017
WMCCC 1984	Dec 31, 2017
Z80	Dec 25, 2017

Up one Level

Wikispaces : chessprogramming - items matching description

Alaric

Table of Contents

Etymology

Tournament Play

Selected Games

CCT9

WCRCC 2008

See also

Forum Posts

External Links

Chess Engine

Misc

References

What links here?

Arminius

Table of Contents

See also

Forum Posts

External Links

Chess Engine

Misc

References

What links here?

Barbarossa

Table of Contents

See also

Forum Posts

External Links

Chess Engine

Misc

References

What links here?

Beowulf

Table of Contents

Features

See also

Forum Posts

External Links

Chess Engine

Misc

References

What links here?

Brutus

Table of Contents

How it started

Etymology

Description

FPGA Search

Evaluation

Move Generation

Distributed Search

Tournament Play

Photos & Games

IPCCC 2002

WCCC 2002

WCCC 2003

See also

Namesake

Publications

Forum Posts

External Links

Chess

Maastricht

Lippstadt

Graz

Brutus

References

What links here?

Brutus NL

Table of Contents

See also

Namesake

Forum Posts

External Links

Chess Engine

Misc

References

What links here?

Che ES