Wikispaces : chessprogramming - items matching description

Albatross

GerdIsenberg — Fri, 05 May 2017 22:36:45 GMT

Home * Engines * Albatross

		Albatross, a chess program by Michael Parker written in Z80 assembly. Albatross participated at the WMCCC 1980 ^[1], the European MCC 1981 and European MCC 1983, running on a Nascom 1 computer.
Short-tailed Albatross ^[2]

Don't shoot the Albatross

Don't shoot the Albatross

^[3] ^[4] ^[5]
Quote by Tony Harrington on the Albatross during the 4th European MCC 1983 ^[6]

Mike Parker's program, Albatross, which finished the Tournament with one and a half points - much to its author's delight - turned out to be vulnerable to spectators. Someone took a flashlight photo rather too close to it and the Nascom 1, on which the Albatross was running, promptly had a seizure. This prompted cries of 'Don't shoot the Albatross' for the next seven rounds whenever anyone with a camera appeared on the scene.

Selected Games

WMCCC 1980 round 1: Sargon 2.0 - Albatross ^[7] ^[8]

[Event "WMCCC 1980"]
[Site "London, United Kingdom"]
[Date "1980.09.04"]
[Round "1"]
[White "Sargon 2.0"]
[Black "Albatross"]
[Result "0-1"]
 
1.d4 e6 2.Nf3 d5 3.Nc3 Be7 4.e4 dxe4 5.Nxe4 Qd5 6.Nc3 Nc6 7.Nxd5 exd5 8.Bf4 Bd6 
9.Bxd6 Bf5 10.Bxc7 a5 11.Bd3 Be4 12.O-O Nf6 13.Be5 h6 14.Bxf6 O-O 15.Be5 Nb4 
16.Bxe4 dxe4 17.Nd2 b5 18.Nxe4 f6 0-1 {time}

External Links

Chess Program

Albatross' ICGA Tournaments

Misc

Albatross fom Wikipedia
Albatross (disambiguation) fom Wikipedia
Albatross (metaphor) fom Wikipedia
Brickbat Books: Featured: The Albatross Continental Library
Passport - Albatross Song, album Cross-Collateral (1975) ^[9], YouTube Video
lineup: Klaus Doldinger, Curt Cress, Wolfgang Schmid, Kristian Schultze

References

^ Albatross' ICGA Tournaments
^ Short-tailed Albatross taken by - James Lloyd, Place - Eastern Island, Midway Atoll, March 2007, Short tailed Albatross.jpg photo - James photos at pbase.com, Albatross from Wikipedia
^ Jonathan Eyers (2011). Don't Shoot the Albatross!: Nautical Myths and Superstitions. ISBN 978-1-4081-3131-2
^ Why?:Shoot the albatross - Uncyclopedia, the content-free encyclopedia
^ The Rime of the Ancient Mariner from Wikipedia
^ Tony Harrington (1983). Chess Tournament - 4th European Microcomputer Chess Championship. Personal Computer World, December 1983
^ London 1980 - Chess - Round 1 - Game 7 (ICGA Tournaments)
^ Kevin O’Connell (1980). World Microcomputer Chess Championship. Personal Computer World, November 1980
^ Cross-collateralization from Wikipedia

What links here?

Page	Date Edited
Albatross	May 5, 2017
Engines	Mar 10, 2018
European MCC 1981	May 22, 2016
European MCC 1983	May 22, 2016
WMCCC 1980	Dec 25, 2017

Up one Level

BlackBishop

GerdIsenberg — Fri, 07 Nov 2014 21:19:37 GMT

Home * Engines * BlackBishop

		BlackBishop, a free Chess Engine Communication Protocol and UCI compatible chess engine by Andreas Herrmann written in Delphi, first released in April 2004 ^[1]. BlackBishop evolved from his former engine Holmes , and applies NegaScout with null move and futility pruning, and lazy evaluation, maintains Attack tables for king safety and other evaluations, and performs move generation with the help of piece tables. BlackBishop was most active in 2004, playing the IPCCC 2004 and CCT6.
Black Bishop ^[2]

Forum Posts

perpetual check recognition by Andreas Herrmann, CCC, January 30, 2004 » Repetitions
BlackBishop 0.35 by Andreas Herrmann, Winboard Forum, November 04, 2006
BlackBishop 0.470 by Andreas Herrmann, Winboard Forum, November 13, 2006
BlackBishop 1.0 by Andreas Herrmann, Winboard Forum, June 07, 2009

External Links

Chess Engine

Misc

Black Bishop (disambiguation) from Wikipedia

References

^ BlackBishop from WBEC Ridderkerk
^ Illustration of Euplectes gierowii ansorgei by J. G. Keulemans (1899), Black Bishop from Wikipedia

What links here?

Page	Date Edited
Andreas Herrmann	Nov 7, 2014
BlackBishop	Nov 7, 2014
CCT6	May 29, 2014
Eigenmann Endgame Test	Jun 1, 2017
Engines	Mar 10, 2018
Holmes	Apr 24, 2014
Influence Quantity of Pieces	Jul 21, 2017
IPCCC 2004	Dec 1, 2014

Up one Level

Chat

GerdIsenberg — Thu, 07 Jan 2016 16:02:47 GMT

Home * Engines * Chat

		Chat, Wolfgang Delmare's first chess program, playing the WCCC 1986, WMCCC 1987 and WMCCC 1988 ^[1]. Chat was written in Pascal, typically running as DOS engine with a command line interface, at the WCCC 1986 on a CDC Cyper 175, at the WMCCC 1988 as dedicated unit on a 68020 processor with a SciSys Leonardo board ^[2] ^[3] as user interface ^[4] ^[5] . According to Thorsten Czub, Chat had only a brute-force search depth of one ply, but was otherwise quite selective ^[6] .
Whinchat ^[7]

Selected Games

WCCC 1986, round 4, Chat - Enterprise, ..., Wolfgang Delmare (white shirt) ^[8] ^[9]

[Event "WCCC 1986"]
[Site "Cologne, FRG"]
[Date "1986.06.14"]
[Round "4"]
[White "Chat"]
[Black "Enterprise"]
[Result "1/2-1/2"]
 
1.d4 Nf6 2.c4 e6 3.Nc3 Bb4 4.e3 O-O 5.Bd3 c5 6.Nf3 Nc6 7.Bd2 cxd4 8.exd4 d5 
9.c5 Bxc3 10.Bxc3 Ne4 11.Qc2 f5 12.O-O Qc7 13.Kh1 Rf6 14.b4 Rh6 15.b5 Ne7 
16.Bb4 Ng6 17.c6 Nf4 18.cxb7 Qxb7 19.g3 Nxd3 20.Qxd3 a6 21.a4 axb5 22.Qxb5 
Qxb5 23.axb5 Rxa1 24.Rxa1 Nxf2+ 25.Kg2 Nd3 26.Bd2 Rf6 27.Rb1 e5 28.Nxe5 Nxe5 
29.dxe5 Rf7 30.Rc1 Rf8 31.Rc7 d4 32.Re7 d3 33.b6 Ba6 34.Ra7 Bb5 35.Kf3 Bc6+ 
36.Kf4 Rb8 37.Ba5 Rd8 38.Bd2 g6 39.Ke3 Rc8 40.Bc3 Be4 41.Rc7 Rb8 42.e6 Kf8 
43.Bg7+ Ke8 44.Bd4 h6 45.Rg7 d2 46.Rg8+ Ke7 47.Rg7+ Kxe6 48.Kxd2 Kd5 49.Bf2 
g5 50.Rh7 f4 51.Rxh6 Rd8 52.Ke1 Bf3 53.Rh7 Re8+ 54.Kf1 Be2+ 55.Kg1 Ke6 56.Rg7 
Kf6 57.Bd4+ Kf5 58.Kf2 Bd1 59.Rf7+ Ke6 60.Rc7 Kd6 61.Bc5+ Kd5 62.Be7 fxg3+ 
63.Kxg3 Ra8 64.b7 Ba4 65.Rc5+ Ke6 66.Rc7 Kd5 67.Rc5+ Ke6 68.Rc7 Kd5 1/2-1/2

External Links

References

^ Chat's ICGA Tournaments
^ Leonardo from Chess Computer UK by Mike Watters
^ SciSys Leonardo from Schachcomputer.info Wiki
^ Hans-Peter Ketterling (1989). Computerschachneuheiten auf der Nürnberger Spielwarenmesse (Teil 3 und 4). Europa-Rochade 03-1989, 04-1989,
pdf hosted by Hein Veldhuis
^ Re: One ply chess engine by Thorsten Czub, CCC, August 23, 2011
^ Re: One ply chess engine by Thorsten Czub, CCC, August 23, 2011
^ Saxicola rubetra by Marek Szczepanek, CC BY-SA 3.0, Wikimedia Commons, Chat (bird) from Wikipedia
^ WCCC 1986 Video 0:31
^ Cologne 1986 - Chess - Round 4 - Game 2 (ICGA Tournaments)

What links here?

Page	Date Edited
CDC Cyber	Dec 22, 2017
Chat	Jan 7, 2016
Engines	Mar 10, 2018
Enterprise	Jun 23, 2017
Vaxchess	Jan 7, 2016
WCCC 1986	Jul 27, 2017
WMCCC 1987	Jan 7, 2016
WMCCC 1988	Oct 27, 2016
Wolfgang Delmare	Jan 25, 2016

Up one Level

CuckooChess

GerdIsenberg — Tue, 17 Jan 2017 15:04:47 GMT

Home * Engines * CuckooChess

		CuckooChess, an advanced free open source chess program under the GNU General Public License written in Java by Peter Österlund. CuckooChess provides an own GUI, and optionally supports the UCI protocol for the use with external GUIs such as Arena. An Android port is available, where its GUI is also base of Peter Österlund's Stockfish port dubbed DroidFish ^[1] .
Common Cuckoo in flight ^[2]

Internals

CuckooChess applies many of the standard methods for computer chess programs, such as iterative deepening, negascout, aspiration windows, quiescence search with SEE pruning and MVV/LVA move ordering, hash table, history heuristic, recursive null moves, futility pruning, late move reductions, opening book and magic bitboards. CuckooChess name was chosen because it's transposition table is based on Cuckoo hashing ^[3] .

Forum Posts

New UCI engine - CuckooChess by Tony Mokonen, CCC, January 11, 2010
CuckooChess 1.12 by Peter Österlund, CCC, October 24, 2011
Chess-playing lego robot by Peter Österlund, CCC, January 30, 2014 » Nona, the Chess-Playing Lego Robot

External Links

Chess Engine

Misc

Cuckoo hashing from Wikipedia
Cuckoo search from Wikipedia
Cuckoo clock from Wikipedia ^[5]

Mechanical cuckoo, 1650
Cuckoo (disambiguation) from Wikipedia
Cuckoo from Wikipedia
Category:Cuckoos in art from Wikipedia
Category:Cuckoos in heraldry from Wikipedia
Common Cuckoo from Wikipedia
Common Cuckoo - Breeding
The Cuckoo's Egg (book) from Wikipedia ^[6]

Red-backed Shrike
Garden Warbler
Yellowhammer
Common Redstart

References

^ DroidFish - Strong chess program for the Android platform
^ Common Cuckoo from Wikipedia
^ CuckooChess 1.12 - A Java Chess Program
^ Re: PHOENIX=CuckooChess with learning function in Falcon style by Peter Österlund, CCC, March 20, 2016
^ Cuckoo Mechanism. Detail of a drawing of a mechanical organ, 1650. In: Athanasius Kircher: Musurgia Universalis. 2 Vols. Rome 1650, Plate XXI. Photo and Permission by: German Clock Museum Furtwangen (Germany)
^ Images from Kuckuck - 7.2 Eiablage Wikipedia.de (German)

What links here?

Page	Date Edited
ChessBrainVB	Jun 24, 2017
CuckooChess	Jan 17, 2017
DroidFish	Jan 17, 2017
Engines	Mar 10, 2018
Gopalakrishnan Srinivasaraghavan	Mar 31, 2016
Languages	Nov 26, 2017
Peter Österlund	Aug 24, 2017
Phoenix (Rahul)	Mar 31, 2016
Rahul A. R.	Jan 22, 2017
Robots	Feb 20, 2018
Shrike	Dec 30, 2012
Texel	Oct 9, 2017

Up one Level

Duck

GerdIsenberg — Mon, 12 Dec 2016 22:14:47 GMT

Home * Engines * Duck

		Duck, a chess program written in C by Dennis Breuker, competing at three Dutch Open Computer Chess Championships, the DOCCC 1989, the DOCCC 1992, and with the same version the DOCCC 2000, further playing the 4th Computer Olympiad 1992 in London.
Duck ^[1]

Description

from Mark Uniacke's report on the 4th Computer Olympiad 1992 ^[2]:

Search techniques used are minimal-window, alpha-beta with extensions for check evasion, recaptures, singular moves and promotions. Move ordering is by history heuristic, refutation and transposition-table moves and captures. Positional values may range up to +/- 1 Pawn. Development time is 2 years on a very part time basis.

Prover

Prover was a Proof-Number Search implementation for chess, using chess-specific routines of Duck. Provers only goal was searching for mate ^[3].

Publications

Dennis Breuker, Victor Allis, Jaap van den Herik (1994). How to Mate: Applying Proof-Number Search. Advances in Computer Chess 7, reprint as Mate in 38: Applying Proof-Number Search from Ed Schroder's Programmer's Stuff site » Proof-Number Search

Forum Posts

1 Hour CCR Test/Zarkov and Duck/Updated Summary by Peter Berger, CCC, May 14, 2001 » CCR One Hour Test

External Links

Chess Engine

Duck's ICGA Tournaments
Duck by Dennis Breuker (Dutch)

Duck Misc

References

^ Duck by Dennis Breuker (Dutch)
^ Mark Uniacke (1992). The Chess Tournament of the AST 4th Computer Olympiad. ICCA Journal, Vol. 15, No. 3
^ Dennis Breuker, Victor Allis, Jaap van den Herik (1994). How to Mate: Applying Proof-Number Search. Advances in Computer Chess 7, reprint as Mate in 38: Applying Proof-Number Search from Ed Schroder's Programmer's Stuff site » Proof-Number Search

What links here?

Page	Date Edited
4th Computer Olympiad	Jul 15, 2017
AliBaba	Aug 17, 2014
Arachne	May 22, 2016
CCR One Hour Test	Jun 14, 2016
Decoying	Jan 12, 2015
Dennis Breuker	Dec 19, 2016
DOCCC 1989	Aug 15, 2015
DOCCC 1992	Dec 12, 2016
DOCCC 2000	Aug 15, 2015
Duck	Dec 12, 2016
Engines	Mar 10, 2018
Leiden University	Jul 5, 2016
Maastricht University	May 15, 2017
Mathematician	Apr 9, 2018
Proof-number search	Jan 22, 2018

Up one Level

Falcon

GerdIsenberg — Fri, 02 Sep 2016 12:33:38 GMT

Home * Engines * Falcon

		Falcon, a strong private chess engine ^[1] by Omid David and successor of Omid's earlier program Genesis. Falcon participated at three World Computer Chess Championships, the WCCC 2003 in Graz, the WCCC 2004 in Ramat Gan, and the WCCC 2008 in Beijing ^[2], as well the CCT6 on-line tournament. Book authors were Eros Riccio in 2004, and Erdogan Günes in 2008. Falcon applies NegaScout/PVS with null move pruning, internal iterative deepening, dynamic move ordering by history and killer heuristic, multi-cut pruning, selective extensions, transposition table, and futility pruning near leaf nodes ^[3], and blockade detection in endgames ^[4].
Peregrine Falcon caught Pigeon at Manchester Cathedral ^[5]

Genetic Algorithm

Omid David has combined his secret efforts with scientific publications, since Falcon was test-bed and object in research of verified null-move pruning ^[6], extended null-move reductions ^[7], and Genetic Algorithms in evaluation ^[8] ^[9] and search tuning ^[10], the latter on optimizing 18 search control parameters packed into a 70-bit chromosome. The fitness function is the total node count up to the solutions found, from the 879 most tactical positions of the Encyclopedia of Chess Middlegames ^[11], as already used by Yngvi Björnsson and Tony Marsland in Learning Control of Search Extensions ^[12], the lower the fitter. A one-point crossover uses the chromosomes of two parents, selected based on fitness criterion ^[13], and creates two offspring. The mutation operator randomly flips some bits with low probability.

Falcon Breeding

Falcon's GA procedure as pseudo code ^[14]:

1. initialization: randomly generate n 70-bit chromosomes
2.   evaluate fitness of each chromosome of a population 
3.   if (N generations is reached OR fitness value > threshold ) terminate
     repeat until n offspring are generated
  a.   select pair of parents from current population based on fitness criterion
  b.   with probability p, apply crossover to generate two offspring
  c.   mutate the two offspring by randomly flipping some bits
4.   replace the old population with the newly generated population
5.   goto 2

Learning Result

With a population size of 10, a crossover rate of 0.75, mutation rate of 0.05, and 50 generations, following search parameters were learned after 35 hours, as noted, not necessarily the best parameter set for every chess program ^[15]:

Parameter	Value range	Bits	Learned	Unit
Null-move use	0-1	1	1	Boolean
Null Move R	0-7	3	4	plies
Null Move adaptivity	0-1	1	1	Boolean
Null Move adaptivity depth ^[16]	0-7	3	6	plies
Futility depth	0-3	2	3	plies
Futility threshold depth-1	0-1023	10	106	centipawns
Futility threshold depth-2	0-1023	10	219	centipawns
Futility threshold depth-3	0-1023	10	512	centipawns
Mult-cut use	0-1	1	1	Boolean
Mult-cut R	0-7	3	4	plies
Mult-cut depth ^[17]	0-7	3	6	plies
Mult-cut M	0-31	5	14	number of moves
Mult-cut C	0-7	3	3	number of moves
Check extension	0-4	3	2	quarter plies
One-reply extension	0-4	3	4	quarter plies
Recapture extension	0-4	3	2	quarter plies
Passed pawn extension, 7th	0-4	3	3	quarter plies
Mate thread extension	0-4	3	1	quarter plies
		70	bit

Selected Games

WCCC 2004 round 11, Falcon - Shredder ^[18]

[Event "WCCC 2004"]
[Site "Ramat Gan, Israel"]
[Date "2004.07.12"]
[Round "11"]
[White "Falcon"]
[Black "Shredder"]
[Result "1/2-1/2"]
 
1. e4 c5 2. Nf3 d6 3. d4 cxd4 4. Nxd4 Nf6 5. Nc3 a6 6. Be3 e6 7. f3 b5
8. g4 h6 9. Qd2 Nbd7 10. O-O-O Bb7 11. h4 d5 12. Bh3 b4 13. Na4 dxe4
14. g5 hxg5 15. hxg5 exf3 16. g6 Rxh3 17. Rxh3 Qa5 18. b3 Ne5 19. gxf7+
Kxf7 20. Bg5 Ne4 21. Qf4+ Kg8 22. Nxe6 Ng6 23. Rh8+ Nxh8 24. Rd7 Nf6
25. Bxf6 Ng6 26. Qd4 Qf5 27. Nxf8 Qxf6 28. Qxf6 gxf6 29. Nh7 Ne5
30. Nxf6+ Kf8 31. Nh7+ Kg8 32. Nf6+ Kf8 33. Nh7+ Kg8 34. Nf6+ 1/2-1/2

Publications

Omid David, Nathan S. Netanyahu (2002). Verified null-move pruning. ICGA Journal, Vol. 25, No. 3
Omid David, Ariel Felner, Nathan S. Netanyahu (2004). Blockage Detection in Pawn Endgames. ICGA Journal, Vol. 27, No. 3
Omid David, Nathan S. Netanyahu (2008). Extended Null-Move Reductions. CG 2008, pdf
Omid David, Moshe Koppel, Nathan S. Netanyahu (2008). Genetic Algorithms for Mentor-Assisted Evaluation Function Optimization. GECCO '08
Omid David (2009). Genetic Algorithms Based Learning for Evolving Intelligent Organisms. Ph.D. Thesis
Omid David, Jaap van den Herik, Moshe Koppel, Nathan S. Netanyahu (2009). Simulating Human Grandmasters: Evolution and Coevolution of Evaluation Functions.GECCO '09
Omid David, Moshe Koppel, Nathan S. Netanyahu (2010). Expert-Driven Genetic Algorithms for Simulating Evaluation Functions.
Omid David, Nathan S. Netanyahu, Yoav Rosenberg, Moshe Shimoni (2010). Genetic Algorithms for Automatic Classification of Moving Objects. GECCO '10
Omid David, Moshe Koppel, Nathan S. Netanyahu (2010). Genetic Algorithms for Automatic Search Tuning. ICGA Journal, Vol. 33, No. 2
Omid David, Jaap van den Herik, Moshe Koppel, Nathan S. Netanyahu (2014). Genetic Algorithms for Evolving Computer Chess Programs. IEEE Transactions on Evolutionary Computation, pdf ^[19] ^[20]

Forum Posts

Objective proposal Falcon - Crafty by Vincent Diepeveen, CCC, April 29, 2004
Diep and Falcon #2 and 3 by Chessfun, CCC, April 30, 2004
Re: Are you planning to make an SMP version of Falcon? by Omid David, CCC, July 13, 2004
Falcon by Omid David Tabibi by Norbert Raimund Leisner, CCC, January 03, 2012

External Links

Falcon Chess Variant

Falcon Chess from The Chess Variant Pages
Falcon Chess by Harm Geert Muller ^[21]

Falcons

Falconry

The Maltese Falcon

The Maltese Falcon (disambiguation) from Wikipedia
The Maltese Falcon (novel) from Wikipedia
The Maltese Falcon (1941 film) from Wikipedia
The Maltese Falcon (yacht) from Wikipedia

Misc

References

^ Private Engine List from Ron Murawski's Computer-Chess Wiki
^ Falcon's ICGA Tournaments
^ Omid David, Moshe Koppel, Nathan S. Netanyahu (2010). Genetic Algorithms for Automatic Search Tuning. ICGA Journal, Vol. 33, No. 2
^ Omid David, Ariel Felner, Nathan S. Netanyahu (2004). Blockage Detection in Pawn Endgames. ICGA Journal, Vol. 27, No. 3
^ Peregrine falcons: in pictures - Manchester Cathedral proved a happy hunting ground for the female who caught this pigeon. [photo taken May 23, 2009 (c) Adrian Dancy]
^ Omid David, Nathan S. Netanyahu (2002). Verified null-move pruning. ICGA Journal, Vol. 25, No. 3
^ Omid David, Nathan S. Netanyahu (2008). Extended Null-Move Reductions. CG 2008, pdf
^ Omid David, Moshe Koppel, Nathan S. Netanyahu (2008). Genetic Algorithms for Mentor-Assisted Evaluation Function Optimization. ACM Genetic and Evolutionary Computation Conference (GECCO '08)
^ Omid David, Jaap van den Herik, Moshe Koppel, Nathan S. Netanyahu (2009). Simulating Human Grandmasters: Evolution and Coevolution of Evaluation Functions. ACM Genetic and Evolutionary Computation Conference (GECCO '09)
^ Omid David, Moshe Koppel, Nathan S. Netanyahu (2010). Genetic Algorithms for Automatic Search Tuning. ICGA Journal, Vol. 33, No. 2
^ Nikolai Krogius, A. Livsic, Bruno Parma, Mark Taimanov (1980). Encyclopedia of Chess Middlegames. Chess Informant
^ Yngvi Björnsson, Tony Marsland (2002). Learning Control of Search Extensions. Proceedings of the 6th Joint Conference on Information Sciences (JCIS 2002), pp. 446-449. pdf
^ Genetic algorithms
^ Omid David, Moshe Koppel, Nathan S. Netanyahu (2010). Genetic Algorithms for Automatic Search Tuning. ICGA Journal, Vol. 33, No. 2, 4.2 Generic Algorithms
^ Omid David, Moshe Koppel, Nathan S. Netanyahu (2010). Genetic Algorithms for Automatic Search Tuning. ICGA Journal, Vol. 33, No. 2, 5. Experimental Results
^ if (adaptivity && depth <= adaptivity_depth) use R-1
^ Apply Mult-cut only if depth >= Mult-cut_depth
^ Ramat-Gan 2004 - Chess - Round 11 - Game 5 (ICGA Tournaments)
^ Jaap van den Herik wint Humies Award 2014 - LIACS - Leiden Institute of Advanced Computer Science
^ GECCO 2014
^ Falcon Chess by Harm Geert Muller, CCC, July 17, 2008

What links here?

Page	Date Edited
Automated Tuning	Feb 27, 2018
Bar-Ilan University	Feb 15, 2017
CCT6	May 29, 2014
Crafty	Jan 28, 2018
Engines	Mar 10, 2018
Erdogan Günes	Jul 7, 2017
Eros Riccio	Oct 5, 2016
Falcon	Sep 2, 2016
FibChess	Jan 7, 2016
Genesis IL	Feb 15, 2014
Genetic Programming	Dec 26, 2017
Green Light Chess	Jan 21, 2018
Learning	Feb 20, 2018
Omid David	Jan 2, 2017
Pigeon	Nov 2, 2016
WCCC 2003	Apr 2, 2017
WCCC 2004	Jan 28, 2018
WCCC 2008	Jan 3, 2017
Who's Who	Sep 6, 2017

Up one Level

Fire

GerdIsenberg — Fri, 13 Oct 2017 06:37:34 GMT

Home * Engines * Ippolit * Fire

		Fire, (Firebird, Fire xTreme) an UCI compliant chess engine by Norman Schmidt ^[1], until version 3.0 derived from IvanHoe and the Ippolit series of programs with some help of Milos Stanisavljevic. Initially called Firebird, and later renamed to Fire due to a trademark naming conflict ^[2], it was released as open source, Fire licensed under the GNU GPL. The sources were later closed with Windows executables available for download for recent Intel processors ^[3]. Fire features magic bitboards, it can be configured with more than 70 UCI options, and applies a SMP parallel search.
Fire ^[4]

Fire 4

Fire 4, released in December 2014, was a compete re-write and does not use any source code from or related to Ippolit. It supports Syzygy Bases ^[5] ^[6], and includes a revamped memory management which uses OpenMP #pragmas to utilize thread local storage ^[7] and minimize the amount of 'shared' resources among threads for its SMP implementation. Testing was done via massive parallel, automated 24/7 ultra-fast chess engine matches using Cutechess-cli and LittleBlitzer. Code changes were tested to a very high level of confidence using LOS and SPRT (min. 40,000 games) against a pool of top engines. Development and testing included approx. 200,000 - 240,000 ultra-fast games per day ^[8].

Fire 5, Fire 6.1

Fire 5, released in November 2016, improved with new evaluation terms, and SPSA tuned evaluation and search parameters, and supports Chess960. Fire 6.1, released in September 2017, added approximately 30-40 Elo in playing strength ^[9].

Forum Posts

2010 ...

Firebird 1.0.... by Dr.Wael Deeb, CCC, January 12, 2010
+ Firebird wins Amar Gambit + related chess notes + by Rainer Neuhäusler, CCC, January 30, 2010
+ Firebird wins Ware Gambit + by Rainer Neuhäusler, CCC, February 02, 2010
I should mention that I also made a few small fixes to fire by Dann Corbit, CCC, March 09, 2011
Houdini, Fire, IvanHoe, (and Rybka?) are 'clones'...? by Norman Schmidt, CCC, April 30, 2011
Fire 3.0 released by Stefan Pohl, CCC, December 13, 2013

2015 ...

Fire 4 for linux by Lucas Braesch, CCC, July 03, 2015
Fire 5 by Rainer Neuhäusler, CCC, May 31, 2016
Fire 5 is out! by Dmitri Gusev, CCC, November 14, 2016
Fire 6 is available! by Anton Ross, CCC, September 22, 2017
Re: Fire 6 is available! by Norman Schmidt, CCC, September 23, 2017

External Links

Chess Engine

Fire Chess Engine
Fire - www.chesslogik.com
Fire – the chess engine releases a new version, Chessdom, October 02, 2017 » TCEC Season 10
Fire in CCRL 40/40

Misc

References

^ Re: Fire 3.0 released by Norman Schmidt, CCC, December 13, 2013
^ Chess Engine List from Ron Murawski's Computer-Chess Wiki
^ Fire 3.0 released by Stefan Pohl, CCC, December 13, 2013
^ Photo of a fire taken with a 1/4000th of a second exposure by Awesomoman, 2009, Fire from Wikipedia
^ Fire chess engine | ABOUT
^ Fire chess engine | HISTORY
^ Use Thread-local Storage to Reduce Synchronization | Intel® Developer Zone, November 2, 2011
^ Information provided by Norman Schmidt, July 2015
^ Fire – the chess engine releases a new version, Chessdom, October 02, 2017

What links here?

Page	Date Edited
Armageddon	Jan 24, 2014
ChessGUI	Jan 17, 2018
Dmitri Gusev	Dec 14, 2015
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Fire	Oct 12, 2017
Firenzina	Sep 21, 2017
Ippolit	May 17, 2016
Ivanhoe	Aug 3, 2015
Matthew R. Brades	Jun 9, 2017
Milos Stanisavljevic	May 23, 2016
Norman Schmidt	Oct 12, 2017
TCEC Season 10	Jan 3, 2018
TCEC Season 11	Apr 18, 2018
TCEC Season 6	Dec 2, 2014
TCEC Season 8	Nov 30, 2015
TCEC Season 9	Nov 6, 2017

Up one Level

Gaviota

GerdIsenberg — Sun, 21 Jan 2018 12:36:14 GMT

Home * Engines * Gaviota

		Gaviota, a Chess Engine Communication Protocol and UCI compatible chess engine written by FM Miguel A. Ballicora in the C programming language. When It was released in 2001, it was the first Argentinian engine available. Gaviota supports its own endgame tablebases, book, and can use several processors (SMP). It has the ability to learn by remembering book lines and positions that were not good. Gaviota avoids them in following games. There are versions for Linux, Android, Windows, and Mac OS (0.86) ^[1]. The Gaviota team is completed by tester Adam Hair ^[2].
Gaviota austral ^[3] ^[4]

Features

based on Gaviota's change log until v1.0 ^[5] and Forum Posts

Board Representation

Search

Evaluation

Misc

Etymology

Miguel A. Ballicora on the name of his program ^[8]:

Gaviota means "seagull", from the story of Jonathan Livingston Seagull. The spirit of the engine reflects the free spirit of the fictional bird, of flying for fun and excitement, not for food. In Spanish, the book was translated to Juan Salvador Gaviota. In addition, my wife's nickname is Gaby, so it has double meaning.

Tournament Play

Gaviota played various ACCA Americas' Computer Chess Championships, CCT Tournaments and ACCA World Computer Rapid Chess Championships, further the IGWT 2013 and multiple TCEC seasons.

Selected Games

WCRCC 2013, EXchess - Gaviota ^[9]

[Event "WCRCC 2013"]
[Site "Internet Chess Club"]
[Date "2013.07.20"]
[Round "-"]
[White "EXchess"]
[Black "Gaviota"]
[Result "0-1"]
 
1.d4 d5 2.Nf3 Nf6 3.g3 c6 4.c4 Bf5 5.Nbd2 e6 6.Bg2 Be7 7.O-O O-O 8.b3 h5 
9.Ng5 Nbd7 10.e4 dxe4 11.Ndxe4 Nxe4 12.Nxe4 Nf6 13.Nxf6+ Bxf6 14.Be3 h4 
15.g4 Bh7 16.Qd2 Qd7 17.g5 Be7 18.Qe2 Qd8 19.f4 Bf5 20.d5 exd5 21.cxd5 h3 
22.Bf3 c5 23.Qb5 Bd6 24.Rae1 Qc7 25.Qc4 Qa5 26.a4 a6 27.Rec1 Rac8 28.Qc3 
Qc7 29.Qd2 Rfe8 30.Be2 Qe7 31.Kf2 Bc7 32.Bc4 Ba5 33.Qe2 Qd7 34.Qf3 Bb4 
35.d6 b5 36.Bd5 c4 37.Kg3 cxb3 38.Rxc8 Rxc8 39.axb5 Rc2 40.Rg1 axb5 
41.Bxb3 Be1+ 42.Rxe1 Rg2+ 43.Qxg2 hxg2 44.Bf2 Qxd6 45.Kxg2 Qxf4 46.Re8+ 
Kh7 47.g6+ Kxg6 48.Re3 b4 49.Kg1 Be6 50.Bc2+ Kh6 51.Kg2 Qg4+ 52.Bg3 Bd5+ 
53.Kf2 f5 54.Ke1 b3 55.Bxb3 Qb4+ 56.Kf2 Bxb3 57.Be5 f4 58.Rh3+ Kg6 59.Rxb3 
Qxb3 60.Bxf4 Kf5 61.Bc1 Ke4 62.Bg5 Qf3+ 63.Kg1 Qe2 64.Be3 Kxe3 65.h3 Kf3 
66.h4 Qg2# 0-1

Forum Posts

2000 ...

Hash table efficiency by Miguel A. Ballicora, CCC, December 05, 2000 » Transposition Table, Search Statistics
New Winboard Engine by Miguel A. Ballicora, CCC, January 20, 2001
Gaviota should work everywhere now by Miguel A. Ballicora, CCC, January 24, 2001
Gaviota - FM Miguel A. Ballicora - live at ICC in 1 hour by Peter Berger, CCC, March 24, 2002
Great article for people who wants to write a chess engine by Miguel A. Ballicora, CCC, April 03, 2002 ^[10]
Gaviota 0.33 released (for Linux fans too) by Miguel A. Ballicora, CCC, March 03, 2003
Engine Gaviota + WB2UCI in Fritz7 don,t Work pondering by Luis Andraschnik, Winboard Forum, August 15, 2003 » Wb2UCI

2005 ...

Insanity... or Tal style? by Miguel A. Ballicora, CCC, April 01, 2009
Re: Insanity... or Tal style? by Miguel A. Ballicora, CCC, April 02, 2009 » Automated Tuning ^[11]
A New Gaviota Release by Miguel A. Ballicora, Winboard Forum, October 21, 2009
Yet another bitboard attack generator by Miguel A. Ballicora, CCC, October 28, 2009
Gaviota EGTBs, interface proposal for programmers by Miguel A. Ballicora, CCC, December 13, 2009

2010 ...

Test tournament starts: Gaviota, Daydreamer, Greko, Atak by Harun Taner, CCC, January 10, 2010 » Gaviota, Daydreamer, GreKo, Atak
Gaviota tablebases, Probing Code Release (Finally) by Miguel A. Ballicora, Winboard Forum, February 10, 2010 » Gaviota Tablebases
Gaviota and SMP by Olivier Deville, Winboard Forum, May 23, 2010
WCRCC 2010 - Gaviota games by Miguel A. Ballicora, CCC, July 17, 2010 » WCRCC 2010
Gaviota tablebases, probing code v4 (UPDATE) by Miguel A. Ballicora, CCC, March 11, 2011
Re: Programmers: what's the story behind the name of your engine by Miguel A. Ballicora, CCC, June 20, 2011
New Gaviota 0.86 (Linux, Android, Windows, and now Mac!) by Miguel A. Ballicora, CCC, January 23, 2013
Insane move by Miguel A. Ballicora, CCC, July 20, 2013 » WCRCC 2013
Gaviota v1.0 (Release) by Miguel A. Ballicora, CCC, March 08, 2014
Gaviota 1.0 for Mac OS X (Release) by Miguel A. Ballicora, CCC, April 05, 2014

External Links

Chess Engine

Gaviota Home
Endgame Tablebases - gaviota chess engine
Compression Schemes for Gaviota Tablebases
Gaviota Chess Program (old site)
Interview with Miguel Ballicora by Michael Diosi, Free chess graphical user interface (GUI) Arena for chess engines, December 2010
Interview with Miguel Ballicora | Chessdom, February 23, 2013 ^[12] ^[13]
Gaviota from WBEC Ridderkerk
Gaviota in CCRL 40/40
The chess games of Gaviota from chessgames.com

Misc

Gaviota from Wikipedia
Gaviota (desambiguación) - Wikipedia.es (Spanish)
Laridae - Wikipedia.es (Spanish) Gull
Gaviota (galardón) - Wikipedia.es (Spanish) award of the Viña del Mar International Song Festival
Gaviota, California from Wikipedia
Gaviota State Park from Wikipedia
Gaviota Peak from Wikipedia
Gaviota Tunnel from Wikipedia
Isla de las Gaviotas, Montevideo - Wikipedia
Isla de las Gaviotas (Argentina) - Wikipedia.es (Spanish)
Clare Fischer - Gaviota, YouTube Video

References

^ New Gaviota 0.86 (Linux, Android, Windows, and now Mac!) by Miguel A. Ballicora, CCC, January 23, 2013
^ Gaviota v1.0 (engine) - gaviota chess engine
^ Laridae from Wikipedia.es
^ Gull from Wikipedia
^ Change Log - gaviota chess engine
^ Acknowledgments - gaviota chess engine
^ Yet another bitboard attack generator by Miguel A. Ballicora, CCC, October 28, 2009
^ Re: Programmers: what's the story behind the name of your engine by Miguel A. Ballicora, CCC, June 20, 2011
^ Insane move by Miguel A. Ballicora, CCC, July 20, 2013
^ Tony Marsland (1992). Computer Chess and Search. Encyclopedia of Artificial Intelligence (2nd ed.) (ed. S.C. Shapiro) pp. 224-241. John Wiley & Sons, Inc., New York, NY. ISBN 0-471-50305-3. pdf
^ The texel evaluation function optimization algorithm by Peter Österlund, CCC, January 31, 2014 » Texel's Tuning Method
^ TCEC computer chess LIVE!
^ TCEC - Thoresen Chess Engines Competition | Facebook

What links here?

Page	Date Edited
More Links
1st CSVN OIT	May 18, 2014
ACCA 2006	Jul 14, 2014
ACCA 2009	Jul 14, 2014
ACCA 2010	Jul 14, 2014
ACCA 2011	Jul 14, 2014
ACCA 2012	Jul 14, 2014
Adam Hair	Jan 14, 2017
Atak	Aug 9, 2016
Automated Tuning	Feb 27, 2018
Carlos Pesce	Sep 7, 2012
CCT11	Feb 17, 2015
CCT12	Jan 28, 2018
CCT13	Dec 6, 2013
CCT14	Aug 23, 2012
CCT15	Oct 21, 2014
CCT16	May 13, 2014
Dave Gomboc	May 6, 2015
DayDreamer	Aug 22, 2016
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Gaviota	Jan 21, 2018
Gaviota Tablebases	Apr 22, 2018
Greko	Feb 27, 2018
GullChess	Jun 27, 2017
Harun Taner	May 17, 2015
IGWT 2013	Jun 23, 2014
IGWT 2014	Feb 2, 2016
iota	Feb 10, 2016
Michigan State University	Sep 11, 2017
Miguel A. Ballicora	Jun 19, 2017
RattateChess	Dec 2, 2014
Rodent	Jan 11, 2018
Search Statistics	Jan 16, 2018
TCEC Season 10	Jan 3, 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
Texel's Tuning Method	Dec 2, 2017

Up one Level

Greif

GerdIsenberg — Tue, 17 May 2016 16:58:44 GMT

Home * Engines * Greif

Greif,
a chess program by engine author Michael Ehrig, supported by tester and opening book author Daniel Mehrmann. Greif played the WMCCC 1993 in Munich ^[1] and the IPCCC 1994 and was identified by Rainer Serfling ^[2] at the end of the Clodra chess tournament in November 1994 as a clone of Chrilly Donninger's program Nimzo 2 ^[3]. During a heated Rybka clone discussion in CCC Daniel Mehrmann assured to know nothing about the Greif sources ^[4].

Forum Posts

3-Hirn History: Winning a lost position against another computer by Ingo Althöfer, rgcc, June 20, 1997

External Links

Chess Engine

Greif's ICGA Tournaments

Misc

References

^ Greif's ICGA Tournaments
^ Clone Engine List from Ron Murawski's Computer-Chess Wiki
^ 3-Hirn History: Winning a lost position against another computer by Ingo Althöfer, rgcc, June 20, 1997
^ Re: Rybka - How much Fruit is inside ? by Daniel Mehrmann, CCC, December 11, 2005

What links here

Page	Date Edited
Aegon 1994	Mar 26, 2017
Daniel Mehrmann	Dec 13, 2015
Engines	Mar 10, 2018
Greif	May 17, 2016
IPCCC 1994	Jul 31, 2013
Michael Ehrig	May 17, 2016
WMCCC 1993	Dec 30, 2017

Up one level

GullChess

GerdIsenberg — Tue, 27 Jun 2017 16:14:45 GMT

Home * Engines * GullChess

		GullChess, (Gull) an UCI compliant open source engine in the public domain by Vadim Demichev ^[1], inspired by ideas and code from other open source engines, notably from Ivanhoe of the Ippolit family of programs, and from Strelka, whose authors are suspected of reverse engineering Rybka, to examine and use her ideas. Ron Murawski's Computer-Chess Wiki mentions GullChess as Ivanhoe derivative ^[2]. The further socialization of concrete implementations with disputed origin in the public domain, as already started with Ippolit, remains a highly controversial topic.
Scheveningen Gulls ^[3]

Source Code Repositories

Description

GullChess applies magic bitboards to determine sliding piece attacks, a material table indexing scheme with disjoint light and dark bishops, PVS with aspiration windows, and a parallel search based on processes. Version 1.2 is written in compact and neat C++ code and consists of only one single source file. It features generic function templates in recursive search routines as well in various functions called by search, i.e. for move generation, with side to move and hash-move exclusion for singular extensions as boolean template parameters, delegating conditions on these to compile-time.

Releases & Forks

Gull 2.1

Gull 2.1, released in June 2013, has evaluation weights optimized with the use of automated tuning (source code included). Gull's 2.1 evaluation is no longer almost identical to that of Ivanhoe. Further, it features some minor search, time management and SMP efficiency enhancements ^[4].

Gull 2.8 beta

Gull 2.8 beta, released in January 2014 and competing TCEC Season 6, comes with minor search tweaks but a full evaluation rewrite, being back an original engine ^[5]. A BMI2 build provides a small speedup on Haswell architecture due to the replacement of magic bitboards by PEXT bitboards.

Gull 3

Gull 3, released April 17, 2014, with further optimization of evaluation weights and a rewritten SMP search, features nonlinear king shelter evaluation and more endgame knowledge. Basil Falcinelli implemented a Linux port ^[6] and Syzygy Bases support, introducing Fathom ^[7], while Michael Byrne worked on a Mac OS port ^[8] dubbed Hawkeye ^[9], Tom Hyer introduced his Gull 3 derivative Roc ^[10], and Norman Schmidt SeaGull also based on Gull 3 ^[11].

LazyGull

LazyGull is a free UCI chess engine under the MIT License derived from Gull 3 by Basil Falcinelli ^[12]. LazyGull features Syzygy Bases support via Fathom, Lazy SMP, and PDEP bitboards for modern x86-64 CPUs, and is portable to Windows, Linux and MacOSX ^[13].

Forum Posts

2010 ...

Проект "Чайка" by ThinkingALot, immortalchess, June 07, 2010, translated by Google Translate
GullChess by Olivier Deville, Winboard Forum, June 09, 2010
gull chess by Karger, OpenChess Forum, June 12, 2010
Re: gull chess by ThinkingALot, OpenChess Forum, June 13, 2010 » Gaviota
Re: gull chess by ThinkingALot, OpenChess Forum, June 17, 2013 (Gull 2.1)
Re: gull chess by ThinkingALot, OpenChess Forum, January 26, 2014 (Gull 2.8 beta & Gull 2.9 alpha)
GullChess 2.1 by Norbert Raimund Leisner, CCC, June 18, 2013
DTS-like SMP by ThinkingALot, OpenChess Forum, July 25, 2013 » Parallel Search
Re: Gull by ThinkingALot, immortalchess, February 10, 2014

2015 ...

Gull 3 (Linux port) released by Basil Falcinelli, CCC, October 28, 2015
Gull 3 x64 Mac Results by Michael B, CCC, October 30, 2015
Gull 3 Linux+Syzygy and Fathom released by Basil Falcinelli, CCC, November 20, 2015 » Fathom
Gull 3.0.1 available, takes advantage of hyperthreading by Dmitri Gusev, CCC, January 21, 2016
Gull 3.0 Syzygy in GitHub by Jose Mº Velasco, CCC, May 19, 2016
Gull 3 x64 by Michael B, CCC, July 01, 2016
Hawkeye 1.01 by Michael B, CCC, July 05, 2016
Hawkeye 1.01 Released by Michael B, CCC, July 07, 2016
Hawkeye is now on Github by Michael B, CCC, July 10, 2016
Hawkeye 1.02 Released by Michael B, CCC, July 11, 2016
HAwkeye 1.03 Released by Michael B, CCC, July 16, 2016
Future of Gull by Tom Hyer, CCC, August 23, 2016 ^[14]
New engine "Roc" by Tom Hyer, CCC, January 18, 2017
Open-source improvements released by Norman Schmidt, CCC, June 26, 2017

External Links

Source Code Repositories

Rating

Misc

References

^ Chess engine from Wikiepdia
^ Chess Engine List from Ron Murawski's Computer-Chess Wiki
^ Gulls at the beach of Scheveningen Kurhaus, Photo by Gerd Isenberg, December 26, 2015
^ Re: gull chess by ThinkingALot, OpenChess Forum, June 17, 2013 (Gull 2.1)
^ Gull 2.8 beta.zip/Gull 2.8 beta/readme.txt
^ Gull 3 (Linux port) released by Basil Falcinelli, CCC, October 28, 2015
^ Gull 3 Linux+Syzygy and Fathom released by Basil Falcinelli, CCC, November 20, 2015
^ Gull 3 x64 Mac Results by Michael B, CCC, October 30, 2015
^ Hawkeye 1.01 by Michael B, CCC, July 05, 2016
^ GitHub - TomHyer/Roc: C++ chess engine derived from Gull 3
^ GitHub - FireFather/seagull: chess engine based on Gull 3 by Norman Schmidt
^ GitHub - basil00/Gull: Gull chess (Linux/Mac port) - The LazyGull Chess Engine
^ Gull/README.md at master · basil00/Gull · GitHub
^ hyer / SonsOfTheBird / source / Slizzard — Bitbucket
^ Future of Gull by Tom Hyer, CCC, August 23, 2016
^ Gull Lake (Michigan) from Wikipedia

What links here?

Page	Date Edited
Basil Falcinelli	Jun 23, 2017
Donna	Aug 17, 2017
Dynamic Tree Splitting	Apr 10, 2017
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Gaviota	Jan 21, 2018
GullChess	Jun 27, 2017
Michael Byrne	Jun 23, 2017
Norman Schmidt	Oct 12, 2017
Parallel Search	Dec 30, 2017
Stockfish	Apr 7, 2018
Syzygy Bases	Apr 19, 2018
TCEC Season 10	Jan 3, 2018
TCEC Season 11	Apr 18, 2018
TCEC Season 5	Jun 2, 2014
TCEC Season 6	Dec 2, 2014
TCEC Season 7	Jan 23, 2015
TCEC Season 8	Nov 30, 2015
TCEC Season 9	Nov 6, 2017
Vadim Demichev	Jul 26, 2013

Up one Level

Kiwi

GerdIsenberg — Fri, 02 Sep 2016 12:39:29 GMT

Home * Engines * Kiwi

		Kiwi, a Chess Engine Communication Protocol compliant open source chess engine under the GNU General Public License ^[1], written in C++ by Alessandro Scotti. Executables are available for Windows, Linux and Mac OS. Kiwi uses bitboards as basic board representation, and generates sliding piece attacks with rotated bitboards. It performs MTD(f) with null move pruning, killer and history heuristic, and transposition table. The evaluation considers development, Fruit like mobility, and pawn structure utilizing a pawn hash table, with focus on passed pawns and pawn races. Kiwi played two over the board tournaments in 2005, it became runner-up at the CIPS 2005 behind Delfi, and became third at the Chess Computer Cup 2005.
Great Spotted Kiwi ^[2]

Selected Games

CCC 2005, round 6, Kiwi - Chiron ^[3]

[Event "Chess Computer Cup"]
[Site "Bologna"]
[Date "2005.09.25"]
[Round "6"]
[White "Kiwi 0.6b RC10"]
[Black "Chiron v0.4.1"]
[Result "1-0"]
 
1.d4 Nf6 2.c4 e6 3.Nc3 Bb4 4.e3 O-O 5.Bd3 d5 6.a3 Bxc3+ 7.bxc3 dxc4 8.Bxc4 c5 
9.Nf3 Qc7 10.Ba2 Nbd7 11.Bb2 b5 12.Qe2 Rb8 13.O-O Bb7 14.Rac1 Rfd8 15.Rfd1 c4 
16.Bb1 Be4 17.Nd2 Bxb1 18.Rxb1 Nf8 19.a4 bxa4 20.Nxc4 Ng6 21.Nd2 Qa5 22.Qd3 Ng4
23.h3 Nf6 24.c4 Qa6 25.Ba3 h6 26.Rxb8 Rxb8 27.Rb1 Rxb1+ 28.Qxb1 Nd7 29.Qb4 f5 
30.g4 fxg4 31.hxg4 Nf6 32.g5 hxg5 33.Nf3 Qc8 34.Nxg5 e5 35.f3 Nh4 36.Kf2 exd4 
37.exd4 Kh8 38.d5 a5 39.Qd6 Nf5 40.Qf4 Nh5 41.Qg4 Nf6 42.Nf7+ Kg8 43.Nh6+ Kh8 
44.Qxf5 Qxc4 45.Nf7+ Kg8 46.Ng5 Qc3 47.Kg2 Qd2+ 48.Kh3 Qe1 49.Qc8+ Qe8 50.Qxe8+ 
Nxe8 51.d6 Nf6 52.Ne4 Nd7 53.Nc5 Ne5 54.d7 Nc6 55.Nb7 Kf7 56.d8=N+ Nxd8 57.Nxd8+
Kf6 58.Kg4 g5 59.Nf7 1-0

Forum Posts

Kiwi 0.1b by Alessandro Scotti, CCC, September 18, 2004
Kiwi for Win98 and input-reading stuff by Alessandro Scotti, CCC, September 29, 2004 » Windows, C++, Thread
Kiwi 0.2a with opening book is available by Alessandro Scotti, CCC, October 06, 2004
Kiwi 0.3a by Alessandro Scotti, CCC, November 12, 2004
Kiwi 0.3b by Alessandro Scotti, CCC, November 17, 2004
Kiwi 0.4a by Alessandro Scotti, CCC, January 10, 2005
Re: late move reductions by Alessandro Scotti, CCC, March 01, 2006 » Late Move Reductions

External Links

Chess engine

Misc

References

^ Computer Chess by Alessandro Scotti
^ Apteryx haastii (immature and adult male) by John Gerrard Keulemans, Ornithological Miscellany. Volume 1 1876, Great Spotted Kiwi from Wikipedia
^ Computer Chess Cup 2005 - tutte le partite in formato PGN by Alessandro Scotti

What links here?

Page	Date Edited
Alessandro Scotti	Feb 27, 2014
CCC 2005	Feb 27, 2014
Chess Engine Communication Protocol	Mar 4, 2018
CIPS 2005	Feb 4, 2013
CLI	Jan 20, 2018
Cpp	Oct 24, 2017
Engines	Mar 10, 2018
Hamsters	Apr 11, 2014
Kiwi	Sep 2, 2016
Late Move Reductions	Sep 25, 2017
Thread	Apr 22, 2018
WinBoard	Mar 4, 2018
Windows	Nov 2, 2017

Up one Level

Merlin

GerdIsenberg — Sat, 20 Jan 2018 11:20:29 GMT

Home * Engines * Merlin

		Merlin, a computer chess program developed in the late 70s and early 80s by four students from Vienna University of Technology, Hermann Kaindl, Helmut Horacek, Marcus Wagner and Roland Schreier, supported by project supervisor Werner DePauli-Schimanovich-Göttig. Merlin competed at various ACM North American Computer Chess Championships and two World Computer Chess Championships in the 80s, the WCCC 1983 in New York and WCCC 1989 in Edmonton, at the WCCC running on IBM 370 compliant Siemens 7.890 F (1983) and IBM 3090 (1989) ^[1]. It won the International Computer Chess Tournament 1984 in Baarn, The Netherlands ^[2].
Disney's version of Merlin ^[3]^[4]

Internals

As mentioned in Werner DePauli-Schimanovich's 2006 book Europolis 6 ^[5] and the reprinted paper Das Schachprogramm Merlin ... by Helmut Horacek and Marcus Wagner ^[6], Merlin was initially based on the didactic program Chess 0.5 by Larry Atkin and Peter W. Frey, as published 1978 in Byte Magazine, also written in Pascal ^[7] except some time critical, often called routines, which were re-written in CDC assembly by Wagner. Merlin was basically a brute-force depth-first searcher with knowledge-based selectivity ^[8] , using extensions as well as null move to determine threats ^[9] .

Namesakes

Merlin, the early chess program by Jeff Rollason from 1976 ^[10]
Merlin, a Chess Engine Communication Protocol compatible chess engine by Balázs Jákó ^[11]

Publications

Helmut Horacek, Marcus Wagner (1981). Das Schachprogramm Merlin, Verbesserung von Laufzeit-Effizient, Eröffnungsbibliothek und Bewertungsfunktion. 4.Tagung Berichte aus Informatik-Instituten (German) ^[12]
Helmut Horacek, Marcus Wagner (1982). Das Programm Merlin - Unterschiede zu konventionellen Schachprogrammen. OeGAI Journal, 1982 (German)
Hermann Kaindl (1983). Searching to Variable Depth in Computer Chess. Proceedings of IJCAI 83, pdf
Hermann Kaindl, Helmut Horacek, Marcus Wagner (1986). Selective Search versus Brute Force. ICCA Journal, Vol. 9, No. 3
Hermann Kaindl (1988). Useful Statistics from Tournament Programs. ICCA Journal, Vol. 11, No. 4 » Search Statistics

External Links

References

^ Merlin's ICGA Tournaments
^ Jaap van Oosterwijk Bruyn (1984). International Computer-Chess Tournament in the Netherlands. ICCA Journal, Vol. 7, No. 2
^ Merlin the wizard, from Wikipedia
^ The Merlin character from The Sword in the Stone, the 1963 Disney film, was eponym of the programs name
^ Werner DePauli-Schimanovich (2006). Europolis 6. Informatik für Spiele und Verkehr. Extension der Mengenlehre, Herausgeber: Franz Pichler, Universitätsverlag Rudolf Trauner, ISBN 978-3-85487-946-6, (SG7) Merlin (ein ComputerChess-Programm) s. 171 (German), Google Books
^ Helmut Horacek, Marcus Wagner (1981). Das Schachprogramm Merlin, Verbesserung von Laufzeit-Effizient, Eröffnungsbibliothek und Bewertungsfunktion. 4. Tagung "Berichte aus Informatik-Instituten" (German)
^ The 6th World Computer Chess Championship, Edmonton, Alberta, Canada, pdf from The Computer History Museum
^ Hermann Kaindl, Helmut Horacek, Marcus Wagner (1986). Selective Search versus Brute Force. ICCA Journal, Vol. 9, No. 3
^ Hermann Kaindl (1983). Searching to Variable Depth in Computer Chess. Proceedings of IJCAI 83, pp. 760-762. Karlsruhe. pdf
^ Treebeard - A new way to do Chess - AI Factory newsletter article Summer 2005, mentions Merlin and Rasputin
^ Merlin Chess Engine
^ reprinted in Werner DePauli-Schimanovich (2006). Europolis 6. Informatik für Spiele und Verkehr. Extension der Mengenlehre, Herausgeber: Franz Pichler, Universitätsverlag Rudolf Trauner, ISBN 978-3-85487-946-6, (SG7) Merlin (ein ComputerChess-Programm) s. 171 (German)

What links here?

Page	Date Edited
ACM 1984	Jul 19, 2016
ACM 1986	Dec 5, 2017
Bebe	Dec 23, 2017
CDC 6600	Oct 8, 2014
CDC Cyber	Dec 22, 2017
Chess 0.5	Nov 20, 2016
Chess 0.5X	Nov 5, 2015
Engines	Mar 10, 2018
Helmut Horacek	Oct 31, 2016
Hermann Kaindl	Oct 31, 2016
IBM 370	Jan 20, 2018
International Computer Chess Tournament 1984	Dec 21, 2017
Marcus Wagner	Jan 7, 2016
Mathematician	Apr 9, 2018
Merlin	Jan 20, 2018
Merlin (GB)	Mar 25, 2015
Merlin (HU)	Jan 7, 2016
Roland Schreier	Aug 6, 2011
Search Statistics	Jan 16, 2018
Shy	Jul 19, 2016
Siemens-System 7.800	Jan 23, 2018
Vienna University of Technology	Dec 7, 2017
WCCC 1983	Jan 20, 2018
WCCC 1989	Dec 5, 2017
Werner DePauli-Schimanovich-Göttig	Nov 12, 2017
Xenarbor	Sep 6, 2014

Up one level

Merlin (GB)

GerdIsenberg — Wed, 25 Mar 2015 08:46:35 GMT

Home * Engines * Merlin (GB)

		Merlin, a chess program by Jeff Rollason whose developed started in 1976, initially written in Fortran for mainframe computers. Merlin already focused on a Swapping Off Material Analyzer (SOMA) approach of the whole board, which was later refined in Rollason's Shogi program Shotest ^[1] and his later chess program Treebeard ^[2]. The micro-processor program Merlin X ^[3], basically a Z80 Assembly port to run on a Nascom 2, played the 4th European Microcomputer Chess Championship 1983 in London with 4 out of 9.
Merlin ^[4]

Namesakes

Merlin from Vienna University of Technology
Merlin, a Chess Engine Communication Protocol compatible chess engine by Balázs Jákó ^[5]

External Links

References

^ Jeff Rollason (2000). SUPER-SOMA - Solving Tactical Exchanges in Shogi without Tree Searching. CG 2000, Word preprint
^ Treebeard - A new way to do Chess - AI Factory newsletter article Summer 2005
^ Jeff Rollason from Wikipedia
^ Merlin, from the Nuremberg Chronicle (1493), by Hartmann Schedel (1440-1514)
^ Merlin Chess Engine
^ Merlin (TV series) from Wikipedia

What links here?

Page	Date Edited
Engines	Mar 10, 2018
European MCC 1983	May 22, 2016
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

Merlin (HU)

GerdIsenberg — Thu, 07 Jan 2016 19:01:11 GMT

Home * Engines * Merlin (HU)

		Merlin, a Chess Engine Communication Protocol aka WinBoard compatible chess engine by Balázs Jákó. It is a "homebrew", brute-force search based program at about 2350 Elo points against computer opponents ^[1]. Merlin played various Hungarian Chessprogram Open tournaments, and won the MASPV 2004 ^[2], MASPV 2007 and MASPV 2008, and was runner-up behind Pandix at MASPV 2009. Merlin courageously played the WCCC 2013 and WCSC 2013 in Yokohama, and had a hard time in that strong field.
Merlin subspecies ^[3]

Namesake

Merlin, the early chess program by Jeff Rollason from 1976 ^[4]
Merlin from Vienna University of Technology

Forum Posts

New Hungarian Chess Program Champion! by Gábor Szõts, Winboard Forum, May 31, 2004 » MASPV 2004
Merlin 2.0 beta bug by George Lyapko, Winboard Forum, March 05, 2005

External Links

Chess Engine

Misc

References

^ Merlin Chess Engine
^ New Hungarian Chess Program Champion! by Gábor Szõts, Winboard Forum, May 31, 2004
^ Image comes from the book Naumann, Naturgeschichte der Vögel Mitteleuropas (Natural history of the birds of central Europe) of 1905 or his earlier works.
^ Treebeard - A new way to do Chess - AI Factory newsletter article Summer 2005, mentions Merlin and Rasputin

What links here?

Page	Date Edited
Asterisk	Mar 24, 2016
Balázs Jako	Jan 7, 2016
Bestia	Jan 5, 2013
Engines	Mar 10, 2018
George Lyapko	Jan 14, 2013
Hungarian Chessprogram Open	Jan 6, 2013
MASPV 2003	Jan 9, 2013
MASPV 2004	Jan 9, 2013
MASPV 2007	May 5, 2013
MASPV 2008	May 5, 2013
MASPV 2009	May 6, 2013
Merlin	Jan 20, 2018
Merlin (GB)	Mar 25, 2015
Merlin (HU)	Jan 7, 2016
Péter Horváth	Mar 24, 2016
Timea	May 5, 2013
WCCC 2013	Dec 7, 2016
WCSC 2013	Aug 17, 2016

Up one level

Ostrich

GerdIsenberg — Thu, 28 Dec 2017 08:55:55 GMT

Home * Engines * Ostrich

		Ostrich (The Ostrich), a chess program originally developed by George Arnold and Monroe Newborn at Columbia University in 1971, and subsequently by Newborn at McGill University since 1975 ^[1]. Ostrich was the first chess program to compete on a parallel system (ACM 1982). It used eight Data General computers with each screen displaying the parallel computations taking place ^[2] .
Ostrich ^[3]

Etymology

The program was named Ostrich because of its cowardly "head in the sand when in a crisis" style of play ^[4] ^[5].

Tournament Play

Ostrich had its debut at ACM 1972 with its best result of a second place finisher. It played the first five World Computer Chess Championships, the WCCC 1974 in Stockholm, the WCCC 1977 in Toronto, the WCCC 1980 in Linz, the WCCC 1983 in New York City, and the WCCC 1986 in Cologne, and 15 ACM North American Computer Chess Championships until ACM 1987, including the ACM 1983 which was simultaneously the Fourth WCCC.

Photos & Games

1972

Ostrich under development at Columbia University Computer Lab, George Arnold ^[6] ^[7]

Quote from Oral History of Monty Newborn ^[8] :

Monty: Maybe David helped Ben on the second one. The second one was held in Chicago, where the Northwestern team lived. Ben had it in his own backyard, so to speak. The second tournament then was a big success, and the third tournament I was back involved in organizing as well. For a number of years, Mittman and I organized these tournaments together. I started competing myself in the Boston tournament, the third tournament.

Q: With Ostrich?

Monty: With Ostrich. Ostrich was not a bad program. It never quite reached the top, but it was not bad. Ben and I organized tournaments year after year. David Levy got involved with some. We organized the ACM tournaments yearly, and in addition we organized world championships every third year. This went on pretty consistently right up until the time that Kasparov played the computer. They’re still having these tournaments, but my interest as a scientist sort of was fulfilled when Kasparov lost to the computer. As a scientist, I would say that that was the end of the experiment.

WCCC 1974

Quote from Canadian Chess ^[9] ^[10]:

A win in the following last round game would have given Ostrich a tie for first place in the 1st World Computer Championship. Unfortunately, the program missed the winning move, 35. Rxh6+, as finding it required a search depth of 19-ply, which was beyond its capabilities. It also missed another winning move, 39. Bf5, which required an 11-ply search.

[Event "WCCC 1974"]
[Site "Stockholm, Sweden"]
[Date "1974.08.08"]
[Round "4"]
[White "Ostrich"]
[Black "Kaissa"]
[Result "0-1"]
 
1. Nf3 e6 2. d4 Nf6 3. Bg5 d5 4. e3 Be7 5. Nc3 Bb4 6. Bxf6 Bxc3+ 7. bxc3 Qxf6
8. Bd3 c5 9. O-O O-O 10. Qd2 Nc6 11. dxc5 Qe7 12. c4 dxc4 13. Bxc4 Qxc5 14.
Qd3 Rd8 15. Qe4 b5 16. Bd3 f5 17. Qh4 e5 18. e4 f4 19. Rfe1 Bb7 20. Ng5 h6 21.
Ne6 Qb6 22. Nxd8 Rxd8 23. a4 b4 24. Bc4+ Kh8 25. Rad1 Nd4 26. Rc1 Bc6 27. c3
bxc3 28. Rxc3 Bxa4 29. Qe7 Nc6 30. Qf7 Qc5 31. Rd3 Nd4 32. Bd5 Bb5 33. Rh3
Ne2+ 34. Kh1 Qxf2 35. Rd1 Qb6 36. Rb1 Rc8 37. Be6 Rd8 38. Qg6 Qb7 39. Qf5 Qc7
40. Rh4 Nd4 41. Qh3 Nxe6 42. Qxe6 Bd3 43. Rg1 Bc4 44. Qf5 Be2 45. Ra1 a5 46.
Qg6 a4 47. Re1 Bc4 48. Ra1 a3 49. Rb1 Qd6 50. Qxd6 Rxd6 51. Rh3 a2 52. Rc1 Rd4
53. Rhc3 Rxe4 54. Ra1 Rd4 55. Rxc4 Rxc4 56. g3 f3 57. h3 Rc2 58. Rd1 Rd2 59.
Rc1 e4 60. g4 e3 61. Kg1 e2 62. Kf2 Rd1 63. Rc8+ Kh7 64. Kxf3 e1=Q 65. Rc2
Rd3+ 66. Kf4 g5+ 67. Kf5 Rf3# 0-1

ACM 1979

ACM 1979, Round 4, Monroe Newborn standing, Tony Marsland, Ostrich 80 - Awit 1/2-1/2 ^[11]

[Event "ACM 1979"]
[Site "Detroit USA"]
[Date "1979.10.30"]
[Round "4"]
[White "Ostrich 80"]
[Black "Awit"]
[Result "1/2-1/2"]
 
1.e4 c5 2.Nf3 d6 3.Bb5+ Nc6 4.O-O Bd7 5.Nc3 Nf6 6.d4 a6 7.Bxc6 Bxc6 8.Be3 Qb6
9.b3 Nxe4 10.Nxe4 Bxe4 11.c3 Qc6 12.Qe2 O-O-O 13.Ng5 Bg6 14.Nf3 Bh5 15.Bg5 Kd7
16.Rad1 Bxf3 17.gxf3 cxd4 18.cxd4 Qd5 19.f4 h6 20.Bh4 g5 21.fxg5 hxg5 22.Bg3 Rc8
23.Rd3 Bg7 24.Rfd1 e6 25.Qe3 b5 26.f4 f6 27.fxg5 Rc2 28.R1d2 Rc1+ 29.Be1 Qxg5+
30.Qxg5 fxg5 31.Re3 Ke7 32.Kg2 g4 33.Ree2 Bf6 34.Bg3 Bg5 35.Rd3 d5 36.a4 bxa4
37.bxa4 Ra1 38.Be5 Rg8 39.Kg3 Bh6 40.Kh4 Rxa4 41.Rg2 a5 42.Rxg4 Rf8 43.Kh5 Bc1
44.Rg7+ Rf7 45.Bd6+ Kxd6 46.Rxf7 Rc4 47.Kg6 Rc2 48.h4 a4 49.Rff3 a3 50.Rb3 a2
51.Rb6+ Kc7 52.Ra6 Kb7 53.Ra4 Kb6 54.Rf6 Kb5 55.Ra8 Be3 56.Rxe6 Bxd4 57.Rb8+ Ka5
58.Ra8+ Kb5 59.Rb8+ Kc4 60.Rc6+ Kd3 61.Rb3+ Bc3 62.Ra6 Rg2+ 63.Kh5 Kc4 64.Rba3 
a1=Q 65.R6a4+ Kd3 66.Rxa1 Bxa1 67.Rxa1 Rg8 68.Rd1+ Ke4 69.Re1+ Kf5 70.Rf1+ Ke4 
71.Re1+ Kf4 72.Rd1 Ke5 73.Re1+ Kd6 74.Rd1 Ke5 75.Re1+ Kd6 76.Rd1 Ke5 1/2-1/2

ACM 1982

ACM 1982, Parallel Computer Chess Machine Ostrich ^[12] :

Ostrich, developed by Monty Newborn, was the first chess program to compete on a parallel system. It used eight Data General computers with each screen displaying the parallel computations taking place. Through the 1970s and 1980s, Ostrich competed in five world championships, coming close to winning in 1974.

Description 1975

Ostrich ran on a Data General SuperNOVA computer, and was written in Supernova assembly language ^[13] ^[14].

Data Structures

Ostrich had a plane 8x8 board with positive and negative numbers for white and black pieces respectively, and zero for empty squares, further a piece list, and multiple other incremental updated data, such as attack and defend maps, a change list, a list of pinned pieces, and pieces en prise. The move list for move generation is shared and controlled by indices kept on the ply-stack recursively.

Search

Ostrich searched a tree of variable-length move sequences using Shannon's Type B strategy supplemented by the alpha-beta algorithm. Strict legal move generation, move ordering, re-ordering and plausibility analysis took huge effort, especially at or near the root.

Search Control

The early Ostrich did not yet perform iterative deepening, instead the search was controlled by various parameters, such as fan-out or maximum number of moves played at each level with {F1, ..., F10}, two depth parameters Dmin and Dmax, average move time and total time. Dmin determines the minimal depth to the horizon. If depth is still less Dmax, positions either resulting from tactical moves, or with the presence of en prise pieces were extended. Initial guesses of the parameters based on time control were adapted during the course of the game considering time usage and various statistics .

Gamma-Algorithm

The Gamma-algorithm caused certain futile nodes to be considered leaves:

Determine material score at current node P[i]
Compare the score with the material score of the P[best] that follows by making the best move M[best] found so far at node P[i-3]
If the score of P[i] implies that the move sequence of M[1], M[2], M[3] is worse than the move M[best] then stop searching at node P[i]

P[i-3] : M[best] -> P[best] ...
       : M[1]    -> P[i-2] : M[2] -> P[i-1] : M[3] -> P[i]

Evaluation

Processing at the leaf nodes includes the usual evaluation terms dominated by material, but also path-dependent terms by the move sequence from the root to this node, such as bonus for castling or penalties for tempo wasting moves, i.e. moving a piece to a square in two moves to which it could move in one, too early queen moves in the opening, etc.. The static evaluation function consists of thirteen subroutines each corresponding to a basic chess heuristic ^[15]:

Material. The subroutine which computes the difference between White's and Black's material the greatest single value to the overall scoring function. The pieces have their conventional values.
Material ratio term, which computes whether an even exchange of material has occurred between the top node of the tree and the bottom position being evaluated; a bonus goes to the side ahead in material.
Castling.
Board control, which is intended to increase one's own mobility and restrict one's opponent's. There is a small bonus for each square controlled, centre squares and squares near the enemy king have the greatest score. 'Control' is defined as the ability of the piece in question to capture a hypothetical enemy piece on that square.
Tempi. Moving the same piece twice in the opening, moving a king or rook before castling, moving a piece back to its immediately previous position and moving to a square in two moves when it could be done in one, all attract penalties.
Early queen moves. These attract a penalty before the eighth move of the game; by which time most minor pieces are developed and the king has castled.
Blocking central pawns. 'Clogging' a position is penalised.
Development of pieces. Rapid development is encouraged by giving a penalty to unmoved minor pieces or central pawns.
Central pawns. These carry a bonus
Pawn structure. Advancement of pawns is encouraged and doubled pawns penalised.
King safety. To guard against king-side pressure on the part of the opponent the program encourages its own pieces in its own king-sector.
Passed pawns. The goal is to encourage the advancement and queening of pawns along with trading off the opponent's passed pawns before they become too advanced. A passed pawn receives credit according to its advancement.

Description 1981

Ostrich's parallel search was elaborated by Monroe Newborn ^[16] , and a brief description of Ostrich 81 is available from the ACM 1980 tournament booklet ^[17] :

Ostrich 81, originally developed by George Arnold and Monroe Newborn at Columbia University in 1971, has participated in seven ACM tournaments and two world championships. Its best result was a second place finish in the 1972 ACM tournament. Ostrich 81 won 3 out of 4 points in qualifying play for this tournament among the three Canadian programs this August.

Ostrich 81 is written in assembly language and requires 32k word of memory to execute. A book of about 1,000 lines helps with the first few moves, when the program leaves the book, various strategies guide its play for the next dozen moves or so. The program carries out an iteratively deepening and variable depth search examining about 20,000 nodes per three minute move. During the last few years, two of Montreal's better chess players, Ilan Vardi and Frank Wang, have helped with the openings.

Publications

Monroe Newborn (1975). Computer Chess. Academic Press, New York, N.Y. ISBN 0-125-17250-8.
Chapter X. Ostrich: A Description of a Chess-Playing Program
Jean E. Hayes, David Levy (1976). The world computer chess championship, Stockholm 1974. University Press (Edinburgh) ISBN 0852242859
Monroe Newborn (1979). Ostrich IV meets the Black Knight. Personal Computing, Vol. 3, No. 10, pp. 74 » ACM 1978, Black Knight
Monroe Newborn (1982). OSTRICH/P - a parallel search chess program, SOCS-82.3. McGill University, School of Computer Science, Montreal
Monroe Newborn (1985). A Parallel Search Chess Program. Proceedings of the ACM Annual Conference, pp. 272-277. Denver, Co.
Monroe Newborn (1988). Unsynchronized Iterative Deepening Parallel Alpha-Beta Search. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI, Vol. 10, No. 5, pp. 687-694. ISSN 0162-8828.

Forum Posts

Re: Ostrich... by Robert Hyatt, rgcc, July 29, 1998
OSTRICH-KAISSA, Stockholm 1974 by José Antônio Fabiano Mendes, CCC, March 01, 2000 » WCCC 1974

External Links

Chess Program

Misc

References

^ Monty Newborn from Wikipedia
^ Eight screen terminal of computer chess machine Ostrich at the 13th ACM North American Computer Chess Championship in Dallas, Texas, Gift of Monroe Newborn, The Computer History Museum
^ Photo by A. Kniesel, September 03, 2004, Ostrich from Wikipedia
^ Ostrich head in sand › Dr Karl's Great Moments In Science (ABC Science)
^ Why ostriches DON'T bury their heads in the sand... and the surprising truths behind other great animal myths by David Thomas, May 15, 2008, Mail Online
^ Ostrich chess program under development at Columbia University Computer Lab, Photographer Monroe Newborn, 1972, The Computer History Museum
^ archive.computerhistory.org - /resources/still-image/Chess_temporary/still-image/
^ Canadian Chess - Monroe (Monty) Newborn
^ OSTRICH-KAISSA, Stockholm 1974 by José Antônio Fabiano Mendes, CCC, March 01, 2000
^ Photo Gift of Monroe Newborn, The Computer History Museum
^ Eight screen terminal of computer chess machine Ostrich at the 13th ACM North American Computer Chess Championship in Dallas, Texas, Gift of Monroe Newborn, The Computer History Museum
^ Description 1975 based on Chapter X. Ostrich: A Description of a Chess-Playing Program. in Monroe Newborn (1975). Computer Chess. Academic Press, New York, N.Y.
^ A description of Ostrich is given in Jean E. Hayes, David Levy (1976). The world computer chess championship, Stockholm 1974. University Press (Edinburgh) ISBN 0852242859
^ from Evaluation Overlap by Mark Watkins
^ Monroe Newborn (1982). OSTRICH/P - a parallel search chess program, SOCS-82.3. McGill University, School of Computer Science, Montreal
^ The Eleventh ACM's North American Computer Chess Championship, pdf from The Computer History Museum

What links here?

Page	Date Edited
ACM 1972	Dec 22, 2017
ACM 1973	Jan 19, 2018
ACM 1974	Jan 19, 2018
ACM 1975	Jan 19, 2018
ACM 1977	Dec 22, 2017
ACM 1978	Dec 23, 2017
ACM 1979	Apr 3, 2017
ACM 1980	Dec 25, 2017
ACM 1981	Jan 19, 2018
ACM 1982	Jul 19, 2016
ACM 1984	Jul 19, 2016
ACM 1985	Jun 21, 2017
ACM 1986	Dec 5, 2017
ACM 1987	Dec 5, 2017
Advance	Jan 7, 2016
Alpha-Beta	Jan 28, 2018
Awit	Dec 22, 2017
Beal	Dec 28, 2017
Black Knight	Dec 25, 2017
Canadian Computer Chess Invitational Championship 1984	Mar 2, 2013
Columbia University	Oct 13, 2016
Dart	Jan 19, 2018
Dutch	Jan 7, 2016
Engines	Mar 10, 2018
Evaluation Overlap	Jul 19, 2016
Futility Pruning	Aug 30, 2017
George Arnold	May 23, 2016
Ilan Vardi	Jun 10, 2015
Iron Fish	Sep 8, 2016
Jerusalem CC Tournament 1978	Jan 3, 2018
Lachex	Jan 7, 2016
Mathematician	Apr 9, 2018
McGill University	Feb 12, 2018
Monroe Newborn	Dec 23, 2017
MSU CP	Jul 19, 2016
Nova	Jan 20, 2016
Ostrich	Dec 28, 2017
Personal Computing	Dec 27, 2017
Pion	May 22, 2016
Rival	Jul 30, 2017
Sortie	Jan 5, 2016
SPOC	Jun 21, 2017
WCCC 1974	Jan 19, 2018
WCCC 1977	Dec 22, 2017
WCCC 1980	Dec 25, 2017
WCCC 1983	Jan 20, 2018
WCCC 1986	Jul 27, 2017

Up one level

Parrot

GerdIsenberg — Wed, 31 Dec 2014 22:46:06 GMT

Home * Engines * Parrot

		Parrot, a Chess Engine Communication Protocol compatible open source engine by Johanes Suhardjo written in C. Parrot started in about 1994 from GNU Chess 4.0, was completely rewritten in 2002 ^[1] and evolved to a bitboard engine applying rotated bitboards for sliding piece attacks, first with an rudimentary evaluation with primitive king safety and piece-square tables, consistently adding new features and improving. In 2006, Johanes implemented to recognize expected node types based on Valavan Manohararajah's Masters thesis ^[2]. By predicting those node types, he managed to improve pruning and shaved the search tree significantly. So far Parrot played the ACCA 2010, ACCA 2011, ACCA 2012, WCRCC 2011, WCRCC 2012 and the CCT14.
A Blue-and-yellow Macaw flying ^[3]

Selected Games

ACCA 2011, round 6, Plisk - Parrot ^[4]

[Event "ACCA 2011"]
[Site "HGM's chess server"]
[Date "2011.11.13"]
[Round "6"]
[White "Plisk"]
[Black "Parrot"]
[Result "0-1"]
 
1.d4 Nf6 2.c4 e6 3.Nf3 b6 4.g3 Bb7 5.Bg2 Be7 6.Nc3 Ne4 7.Bd2 d5 8.O-O Nc6 9.Qc2 Nxd2 
10.Qxd2 O-O 11.cxd5 exd5 12.Qf4 Qd7 13.Nh4 g5 14.Qf5 Rad8 15.Qxd7 Rxd7 16.Nf5 Rfd8 
17.Bh3 Bf8 18.f4 gxf4 19.Rxf4 Na5 20.b3 c5 21.Raf1 cxd4 22.Nxd4 Re7 23.Bg2 Re3 24.Na4 
Re7 25.e3 Nc6 26.Nf5 Re5 27.Nc3 f6 28.Rd1 Nb4 29.Ne4 Re6 30.Nf2 Nxa2 31.Ng4 Nc3 32.Nd4
Re7 33.Rc1 Rc7 34.Nxf6+ Kh8 35.Rh4 h6 36.Ng4 Rd6 37.Rf1 Bg7 38.Nf5 Rg6 39.Ngxh6 Ba6 
40.Rf2 Bf6 41.Rh3 Bg7 42.Ng4+ Kg8 43.Rh4 Ne2+ 44.Kh1 Nc3 45.Nfh6+ Kh8 46.Nf7+ Kg8 
47.Ngh6+ Kh7 48.Nf5+ Kg8 49.N7h6+ Kh7 50.Nxg7 Kxg7 51.Nf5+ Kf6 52.Rhf4 Ke5 53.Nh4 Re6 
54.Nf3+ Kd6 55.Nd4 Nd1 56.R2f3 Rc1 57.Bf1 Re4 58.Rf6+ Kd7 59.Rf7+ Re7 60.Bxa6 Nxe3+ 
61.Rf1 Rxf1+ 62.Rxf1 Nxf1 63.Bxf1 Re1 64.Kg1 Rd1 65.Ne2 Rb1 66.Nc3 Rxb3 67.Nxd5 a5 
68.g4 Kc6 69.Nf6 a4 70.Bg2+ Kd6 71.Bd5 Ke5 72.g5 Rb2 73.Bf7 a3 74.Nd7+ Kd6 75.Nf6 a2 
76.Bxa2 Rxa2 77.h4 Ke6 78.h5 Ra5 79.Ne4 Kf5 80.Nd6+ Kxg5 81.Kf2 Ra3 82.Ke2 Rh3 83.Nb5 
Kxh5 84.Kd2 Kg5 85.Nc3 Kf5 86.Nb5 Ke5 87.Nc3 Kd4 88.Ne2+ Kc4 89.Nf4 Rh2+ 90.Kc1 b5 
91.Ne6 Kc3 92.Kd1 b4 93.Nc5 b3 94.Ne4+ Kd4 95.Ng3 b2 96.Nf5+ Kd3 97.Ke1 b1=Q#
0-1

External Links

References

^ Parrot | Milestones by Johanes Suhardjo
^ Valavan Manohararajah (2001). Parallel Alpha-Beta Search on Shared Memory Multiprocessors. Masters Thesis, pdf
^ Blue-and-yellow Macaw in flight, Photo by Luc Viatour, July 15, 2009, Parrot from Wikipedia
^ Re: 2011 ACCA Pan American CCC - Plisk games by Vlad Stamate, CCC, November 13, 2011

What links here?

Page	Date Edited
ACCA 2006	Jul 14, 2014
ACCA 2007	Jul 14, 2014
ACCA 2010	Jul 14, 2014
ACCA 2011	Jul 14, 2014
ACCA 2012	Jul 14, 2014
CCT14	Aug 23, 2012
Engines	Mar 10, 2018
Jabba	Sep 10, 2016
Johanes Suhardjo	Nov 30, 2013
Parrot	Dec 31, 2014
WCRCC 2007	Nov 21, 2016
WCRCC 2011	Oct 21, 2014
WCRCC 2012	Jul 14, 2014
WCRCC 2013	Jul 14, 2014

Up one Level

Phoenix

GerdIsenberg — Mon, 08 May 2017 12:36:59 GMT

Home * Engines * Phoenix

		Phoenix, (Sun Phoenix) a chess program by Jonathan Schaeffer, which in 1982 rose from the ashes of Prodigy ^[1]. In the later 80s Marius Olafsson helped with the implementation of a parallel search. Phoenix and Sun Phoenix participated at four World Computer Chess Championships, the WCCC 1983, WCCC 1986, WCCC 1989, and WCCC 1995. It tied for first place in the 1986 World Championships. Phoenix further played seven consecutive ACM North American Computer Chess Championships, beside the mentioned WCCC 1983 simultaneously the ACM 1983, the ACM 1984, ACM 1985, ACM 1986, ACM 1987, ACM 1988, and ACM 1989. In his 1987 ICCA Journal paper Speculative Computing, Schaeffer mentions The Null-Move Algorithm or Don Beal's null-move, and used it none recursively up to once per search path in his tactical scout solver Minix (Mini-Phoenix), which up and then gave the parallel running Phoenix, which was a less deep searcher than Minix, some tactical hints ^[2].
Phoenix depicted by F.J. Bertuch ^[3]

Phoenix Chess Systems

Phoenix elsewhere

References

What links here?

Authors

Namesake

Phoenix (Rahul)

Quotes

Waterloo

Jonathan Schaeffer in One Jump Ahead, pp. 8 ^[4]:

My Ph.D. was not going well, so in the summer of 1982 I started looking for a distraction. Yes, I started writing yet another chess program, this one called Phoenix (it rose from the ashes of Prodigy). The Planner and Prodigy experiences were invaluable, as they convinced me that contrary to all my expectations, lots of chess knowledge didn't work. Which programs were winning the tournaments? The ones with little knowledge, but with the ability to consider an enormous number of chess positions. With a twinge to regret, I wrote Phoenix to mimic these "dumb" programs. The results were immediate. Phoenix didn't know nearly as much about chess as Prodigy did, but it would continually beat it game after game. Obviously, my old approach, imparting human knowledge to an inanimate machine, wasn't the best way to train a computer to play strong chess.

Zobrist Hashing

Jonathan Schaeffer on Zobrist Hashing ^[5] :

... I can speak from experience here. In the early versions of my chess program Phoenix, I generated my Zobrist hash numbers using my student id number as a seed, naively thinking the random numbers generated by this seed would be good enough. A few years later I put code in to detect when my 32-bit hash key matched the wrong position. To my surprise, there were lots of errors. I changed my seed to another number and the error rate dropped dramatically. With this better seed, it became very, very rare to see a hash error. All randomly generated numbers are not the same!

WCCC 1986

Jonathan Schaeffer in One Jump Ahead, pp. 9 ^[6]:

I worked hard on Phoenix in preparation of the triennial World Computer Chess Championship in 1986. To improve the program's performance it was modified to run in parallel, using up to thirty computers. They would divide up the work, and each computer would solve part of the problem. In effect, the program was like a small business organization, with a manager to allocate work and employees to do the assigned tasks. The hard work payed off, Phoenix tied for first place in the world championship. I partied late into the night after the final game, intoxicated with success and Coca-Cola. It took a long time for me to come down from my high.

Descriptions

1989

given in the WCCC 1989 booklet ^[7] :

Phoenix uses state-of-the-art search techniques including singular extensions, minimal window searching, transposition tables, and the history heuristic. The program has lots of chess knowledge, including an extensive long range planner.

Phonix is capable of running in parallel on a network of machines. In tournament mode, Phoenix is actually two programs: ParaPhoenix and ParaMinix. ParaPhoenix uses 10 Sun-4s to build trees looking for the best positional move. ParaMinix uses 10 Sun 4s to build trees looking for the best tactical moves. Because of its specialized task, ParaMinix is capable of searching 1-2 ply deeper than ParaPhoenix. ParaMinix has the ability to veto ParaPhoenix's move choice, if a tactically superior move of found. The parallelism is archived using the Dynamic Principal Variation Splitting Algorithm.

1995

Description given in 1995 from the ICGA site ^[8] :

The Phoenix program was an active participant in the 1980's computer chess tournaments and tied for first place in the 1986 World Championships. The program competing this year is essentially the same as that which competed in the 1989 World Computer Chess Championships. Phoenix's participation in the 1995 championships will serve as a benchmark for measuring improvements in the field. Phoenix will be running on an HP 9000/720 with 64MB RAM, which will be comparable to that used by most participants, and therefore the primary difference will be in the software. Expectations are that the software advances in the last 6 years will allow the other programs to move past Phoenix '89 in the final standings. Perhaps the best possible outcome would have Phoenix finishing in last place, providing some experimental evidence of the progress in the field!

Selected Games

WCCC 1986, round 3, BCP - Sun Phoenix ^[9]

[Event "WCCC 1986"]
[Site "Cologne, Germany"]
[Date "1986.06.13"]
[Round "3"]
[White "BCP"]
[Black "Sun Phoenix"]
[Result "0-1"]
 
1.e4 e6 2.d4 d5 3.e5 c5 4.c3 Qb6 5.Nf3 Bd7 6.Bd3 cxd4 7.Nxd4 Nc6 8.Nxc6 Bxc6 
9.O-O O-O-O 10.Nd2 f6 11.Qg4 Re8 12.Re1 Nh6 13.Qh3 Bc5 14.Qg3 Ng4 15.Qxg4 Bxf2+
16.Kf1 Bxe1 17.Kxe1 fxe5 18.Qxg7 Qe3+ 19.Be2 Rhg8 20.Qf7 Bb5 21.Qf2 Qxe2+ 
22.Qxe2 Bxe2 23.Kxe2 Rxg2+ 24.Ke3 Rxh2 25.a4 Rf8 26.a5 h5 27.Ra4 Rh1 28.Ra1 h4 
29.Rb1 Re1+ 30.Kd3 h3 31.Nf1 Rfxf1 0-1

Publications

Jonathan Schaeffer, Tony Marsland (1985). The Utility of Expert Knowledge. Proceedings IJCAI 85, pp. 585-587. Los Angeles. pdf
Jonathan Schaeffer (1986). Improved Parallel Alpha-Beta Searching. Proceedings ACM/IEEE Fall Joint Computer Conference, pp. 519-527.
Jonathan Schaeffer (1987). Speculative Computing. ICCA Journal, Vol. 10, No. 3
Jonathan Schaeffer (1989). Distributed Game-Tree Searching. Journal of Parallel and Distributed Computing, Vol. 6, No. 2, pp. 90-114. ISSN 0743-7315.

Forum Posts

QMW computer chess by Don Beal, rec.games.chess, August 19, 1993 » UPCCC 1993

External Links

Chess Program

Phoenix' ICGA Tournaments
Computer Chess and Canada by David Cohen, 2005

Phoenix Chess Systems

Phoenix elsewhere

Phoenix (mythology) from Wikipedia
Phoenix (demonology) from Wikipedia
phoenix: a world of chess, Zurich Chess Club (German)
Phoenix (band) from Wikipedia
Hans Koller Free Sound - Nicolas 1-2, Phoenix, 1973, YouTube Video
line-up: Adelhard Roidinger, Albert Mair, Alex Bally, Hans Koller, Jürgen Wuchner

References

^ Jonathan Schaeffer (1997, 2009). One Jump Ahead. 1. This Was Going to Be Easy, pp. 8
^ Jonathan Schaeffer (1987). Speculative Computing. ICCA Journal, Vol. 10, No. 3
^ Phoenix (mythology) from Wikipedia
^ Jonathan Schaeffer (1997, 2009). One Jump Ahead. 1. This Was Going to Be Easy, pp. 8
^ Hash tables - Clash!!! What happens next? by Valavan Manohararajah, rec.games.chess, post 6 by Jonathan Schaeffer, March 17, 1994
^ Jonathan Schaeffer (1997, 2009). One Jump Ahead. 1. This Was Going to Be Easy, pp. 9
^ Kings Move - Welcome to the 1989 AGT World Computer Chess Championship. Edmonton, Alberta, Canada, Courtesy of Peter Jennings, from The Computer History Museum, pdf
^ Phoenix's ICGA Tournaments
^ Cologne 1986 - Chess - Round 3 - Game 6 (ICGA Tournaments)

What links here?

Page	Date Edited
ACM 1984	Jul 19, 2016
ACM 1985	Jun 21, 2017
ACM 1986	Dec 5, 2017
ACM 1987	Dec 5, 2017
ACM 1988	Dec 5, 2017
ACM 1989	Jun 7, 2016
Aegon 1988	Jan 22, 2017
Awit	Dec 22, 2017
Bobby	Jan 7, 2016
Canadian Computer Chess Invitational Championship 1984	Mar 2, 2013
ChipTest	Jun 19, 2016
Engines	Mar 10, 2018
Fire	Oct 12, 2017
Honeywell 6000	Jan 19, 2018
Jonathan Schaeffer	Jan 29, 2018
Marius Olafsson	Jan 9, 2016
Mathematician	Apr 9, 2018
Mephisto Almeria	Sep 1, 2017
Michael George	Jan 3, 2016
Netherlands-vs-Computers-1989	Mar 10, 2017
Nona	Jan 7, 2016
Null Move Pruning	Dec 2, 2017
Phoenix	May 8, 2017
Phoenix (Rahul)	Mar 31, 2016
Planner	Sep 24, 2012
Prodigy	Jan 19, 2018
Shy	Jul 19, 2016
SPOC	Jun 21, 2017
Sun	Jun 7, 2016
University of Alberta	Feb 20, 2018
University of Waterloo	Jan 29, 2018
UPCCC 1992	Mar 9, 2012
UPCCC 1993	Mar 6, 2015
UPCCC 1994	Mar 9, 2012
WCCC 1983	Jan 20, 2018
WCCC 1986	Jul 27, 2017
WCCC 1989	Dec 5, 2017
WCCC 1995	Jul 12, 2017
Young Brothers Wait Concept	Apr 22, 2018
Zobrist Hashing	Jan 22, 2018

Up one level

Phoenix (Rahul)

GerdIsenberg — Thu, 31 Mar 2016 11:03:20 GMT

Home * Engines * Phoenix (Rahul)

Phoenix,
an UCI compliant Java chess engine and masters thesis program by Rahul A. R., which is basically a modified CuckooChess by Peter Österlund. Ten piece-square tables, for all six piece types of the opening phase, plus four piece types (no rook and queen) of the endgame, that is a vector of 640 values is interpreted as chromosome to be trained by a genetic algorithm approach. After 1000 games ^[1], the modified engine Phoenix apparently outperformed its parent CuckooChess with a rating of 2546 (an increase of 19 points) ^[2]. After investigations by the original CuckooChess author, he found Phoenix played all games with White! Further, by using the published piece-square tables, Peter Österlund found the modified version around 400 elo weaker than the original ^[3].

Namesake

Publications

^[4]

Rahul A. R. (2014). Phoenix : A Self Learning Chess Engine. for the Award of M. Tech in Information Technology, International Institute of Information Technology, Bangalore, Bangalore, advisor G. Srinivasaraghavan, pdf ^[5]
Rahul A. R., G. Srinivasaraghavan (2016). Phoenix: A Self-Optimizing Chess Engine. arXiv:1603.09051

Forum Posts

PHOENIX=CuckooChess with learning function in Falcon style ! by Ruxy Sylwyka, CCC, February 26, 2015
Re: PHOENIX=CuckooChess with learning function in Falcon style by Peter Österlund, CCC, March 20, 2016

External Links

Chess Engine

Misc

References

^ A word for casual testers by Don Dailey, CCC, December 25, 2012
^ Phoenix: A Self-Learning Chess Engine - 4.3: Results
^ Re: PHOENIX=CuckooChess with learning function in Falcon style by Peter Österlund, CCC, March 20, 2016
^ phoenix/docs at master · rahular/phoenix · GitHub
^ Re: PHOENIX=CuckooChess with learning function in Falcon style by Peter Österlund, CCC, March 20, 2016

What links here?

Page	Date Edited
CuckooChess	Jan 17, 2017
Engines	Mar 10, 2018
Gopalakrishnan Srinivasaraghavan	Mar 31, 2016
Phoenix	May 8, 2017
Phoenix (Rahul)	Mar 31, 2016
Rahul A. R.	Jan 22, 2017

Up one level

Pigeon

GerdIsenberg — Wed, 02 Nov 2016 20:17:53 GMT

Home * Engines * Pigeon

		Pigeon, an original 64-bit UCI chess engine, written in C++ by Stuart Riffle. Pigeon is open source, released under the MIT license. To allow for SIMD and GPU acceleration, much of the critical code is branch-free. It performs a monochrome move generation approach, color flipping the board after make move ^[1] . Pigeon is very much a work in progress, and any feedback is welcome!
Feral rock pigeon ^[2]

Forum Posts

Pigeon (new open source engine) by Stuart Riffle, CCC, April 07, 2016
New open source engine - Pigeon by Stuart Riffle, CCC, April 07, 2016
Pigeon now using opportunistic SIMD by Stuart Riffle, CCC, April 11, 2016
Pigeon 1.37 released by Stuart Riffle, CCC, April 19, 2016
Pigeon 1.5.0 released by Stuart Riffle, CCC, September 01, 2016
Pigeon is now running on the GPU by Stuart Riffle, CCC, November 02, 2016 » GPU

External Links

Chess Engine

Misc

References

^ pigeon/position.h at master · StuartRiffle/pigeon · GitHub
^ Feral Rock Dove, image by Alan D. Wilson, from Natures's Pic's Online, CC BY-SA 2.5, Wikimedia Commons, Columbidae from Wikipedia

What links here?

Page	Date Edited
DirGolem	Jun 5, 2016
Engines	Mar 10, 2018
Falcon	Sep 2, 2016
GPU	Dec 16, 2017
Pigeon	Nov 2, 2016

Up one level

Raptor

GerdIsenberg — Mon, 20 Jul 2015 07:20:33 GMT

Home * Engines * Raptor

		Raptor, an experimental chess program by Frédéric Louguet which played the Massy 2003 French Programmers Tournament, where it became runner-up behind Chess Tiger in a field of 18 programs. Frédéric Louguet explicitely stated that Raptor is definitely not Chess Wizard, but a different and experimental program ^[1].
Deinonychus skeleton ^[2]

Photos & Games

Stéphane Nguyen and Frédéric Louguet, Massy 2003, round 1, Jester - Raptor ^[3] ^[4]

[Event "Massy 2003"]
[Site "Massy, FRA"]
[Date "2003.06.15"]
[Round "1"]
[White "Jester 2.2"]
[Black "Raptor"]
[Result "0-1"]
 
1.d4 Nf6 2.c4 g6 3.Nc3 Bg7 4.e4 d6 5.Be2 O-O 6.Nf3 Na6 7.O-O e5 8.dxe5 dxe5 
9.Bg5 Qe8 10.Nd5 Nxe4 11.Be7 c6 12.Bxf8 Qxf8 13.Ne3 Nac5 14.Nd2 Nf6 15.Nb3 
Ne6 16.Qd2 Ne4 17.Qe1 Nf4 18.Rd1 Be6 19.f3 Nc5 20.Rf2 Nxb3 21.axb3 Rd8 22.Qa5 
Rxd1+ 23.Nxd1 Qd6 24.Nc3 Qd4 25.Bf1 Bf8 26.b4 Bxc4 27.Bxc4 Qxc4 28.Rd2 Nd3 
29.Qxa7 Bxb4 30.Qb8+ Kg7 31.Rxd3 Qxd3 32.Qxe5+ Kg8 33.Qe8+ Bf8 34.h3 Qd2 
35.Qe2 Bc5+ 36.Kh2 Qxe2 37.Nxe2 f5 38.g4 Kf7 39.Kg2 Ke6 40.Nf4+ Kf6 41.Kf1 
Be3 42.Ng2 Bc1 43.b3 Ke5 44.Ke2 fxg4 45.fxg4 Kd4 46.Kd1 Bg5 47.Kc2 Ke4 48.Ne1 
Kf4 49.Kd2 Kg3+ 50.Ke2 h5 51.gxh5 gxh5 52.Nd3 h4 53.Nf2 Be7 54.Kf1 c5 55.Ke1 
b5 56.Kf1 c4 57.bxc4 bxc4 58.Ne4+ Kxh3 59.Kg1 Kg4 60.Nc3 Bd6 61.Kg2 h3+ 62.Kh1
Be5 63.Nb1 Bb2 64.Kh2 Kf4 65.Nd2 c3 66.Nb3 c2 67.Kxh3 Ke4 68.Kg3 Kd3 69.Kf3 
Ba3 70.Kg4 Kc3 71.Na5 c1=Q 0-1

Namesake

Raptor by Steve Webber

Forum Posts

Massy, a correction : Raptor is NOT Chess Wizard by Frédéric Louguet, CCC, June 16, 2003

External Links

References

^ Massy, a correction : Raptor is NOT Chess Wizard by Frédéric Louguet, CCC, June 16, 2003
^ Deinonychus antirrhopus skeleton, Philadelphia Academy of Natural Sciences, by Bearerofthecup, July 04, 2008
^ from Photo 7 by Christian Barreteau, from Massy 2003/06/15 - Tournoi de programmes d'Echecs
^ Massy 2003/06/15 - Tournoi de programmes d'Echecs - Parties en pgn

What links here?

Page	Date Edited
Chess Wizard	Dec 22, 2014
Engines	Mar 10, 2018
Frédéric Louguet	Aug 4, 2013
Massy 2003	Jan 27, 2013
Raptor	Jul 20, 2015
Raptor LU	Oct 5, 2016
WCCC 2016	Sep 18, 2017

Up one Level

Wikispaces : chessprogramming - items matching description

Albatross

Table of Contents

Don't shoot the Albatross

Selected Games

See also

External Links

Chess Program

Misc

References

What links here?

BlackBishop

Table of Contents

See also

Forum Posts

External Links

Chess Engine

Misc

References

What links here?

Chat

Table of Contents

Selected Games

See also

External Links

References

What links here?

CuckooChess

Table of Contents

Internals

See also

Forum Posts

External Links

Chess Engine

Misc

References

What links here?

Duck

Table of Contents

Description

Prover

See also

Publications

Forum Posts

External Links

Chess Engine

Duck Misc

References

What links here?

Falcon

Table of Contents

Genetic Algorithm

Falcon Breeding

Learning Result

Selected Games

See also

Publications

Forum Posts

External Links

Falcon Chess Variant

Falcons

Falconry

The Maltese Falcon

Misc

References

What links here?

Fire

Table of Contents

Fire 4

Fire 5, Fire 6.1

See also

Forum Posts

2010 ...

2015 ...

External Links

Chess Engine

Misc

References

What links here?

Gaviota