Wikispaces : chessprogramming - items matching description

Abulafia

GerdIsenberg — Wed, 04 Oct 2017 19:41:11 GMT

Home * Engines * Abulafia

		Abulafia, an UCI compliant experimental open source chess engine by Nicu Ionita written in Haskell, and predecessor of Barbarossa ^[1]. Abulafia uses magic bitboards ^[2] to determine sliding piece attacks, and monad transformers ^[3] ^[4] in continuation passing style to control the search.
Abulafia's Light of the Intellect (1285) ^[5]

Forum Posts

Abulafia, chess, Haskell and some (new?) ideas by Nicu Ionita, CCC, April 20, 2012
The best chess engine written in Haskell by Ruxy Sylwyka, CCC, January 18, 2013

External Links

Chess Engine

Misc

References

^ Barbarossa 0.1.0 by Nicu Ionita, CCC, November 24, 2013
^ Abulafia/Magics.hs at master · nionita/Abulafia · GitHub
^ Haskell/Monad transformers - Wikibooks
^ Haskell/Understanding monads - Wikibooks
^ An illuminated page from Abraham Abulafia's Light of the Intellect (1285), The Vatican Library, Unknown artist; the author of the book is Abulafia, Kabbalah from Wikipedia, Wikimedia Commons

What links here?

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

Up one level

Abyss

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

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

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

Abyss' ICGA Tournaments

Description

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

Move Generation

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

Search

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

Basics

Move Ordering

Selectivity

Evaluation

Material Balance with Point Values

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

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

Misc

Opening Book

Abyss' ICGA Tournaments

^[10]

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

Publications

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

External Links

Engine

Abyss' ICGA Tournaments

Misc

References

^ Haiying Wang (1994). An application-oriented user interface model and development system. Ph.D. thesis, University of Alberta, pdf, see 6.2 Chinese Chess Program pp. 101.
^ Chun Ye (1992). Experiments in Selective Search Extensions. M.Sc. thesis, Department of Computing Science, University of Alberta, pdf
^ Lysefjord, Norway- a man standing on Preikestolen at the edge of the Abyss, Image by Mercy, August 2008, CC BY-SA 3.0, Wikimedia Commons
^ Description is based on Chun Ye (1992). Experiments in Selective Search Extensions. M.Sc. thesis, Department of Computing Science, University of Alberta, pdf
^ Fred Popowich, Tony Marsland. (1983) Parabelle: Experience with a Parallel Chess Program. Technical Report 83-7. Computing Science Department, University of Alberta, pdf
^ Chun Ye, Tony Marsland (1992). Experiments in Forward Pruning with Limited Extensions. ICCA Journal, Vol. 15, No. 2, pdf
^ Chun Ye, Tony Marsland (1992). Selective Extensions in Game-Tree Search. Heuristic Programming in AI 3, pdf
^ Gordon Goetsch, Murray Campbell (1990). Experiments with the Null-Move Heuristic. Computers, Chess, and Cognition, pp. 159-168
^ Don Beal (1989). Experiments with the Null Move. Advances in Computer Chess 5, A revised version is published (1990) under the title A Generalized Quiescence Search Algorithm. Artificial Intelligence, Vol. 43, No. 1, pp. 85-98. ISSN 0004-3702.
^ Abyss' ICGA Tournaments

What links here?

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

Up one Level

Anubis

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

Home * Engines * Anubis

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

Forum Posts

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

External Links

References

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

What links here?

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

Up one level

Bruja

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

Home * Engines * Bruja

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

Description

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

Search

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

Evaluation

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

Etymology

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

Forum Posts

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

External Links

Chess Engine

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

Misc

References

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

What links here?

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

Up one Level

Chess Guru

GerdIsenberg — Sat, 04 Mar 2017 21:36:02 GMT

Home * Engines * Chess Guru

		Chess Guru, a chess program designed and written by Joël Rivat. It was runner up at the 1995 French Computer Chess Championship (behind Virtua Chess), and won the 1996 French Computer Chess Championship. Chess Guru further competed at the WMCCC 1997.
Adi Shankara with Disciples ^[1]

Description

given in 1997 from the ICGA tournament page ^[2] :

A first Chess program was written by C. Marche, G. Le Blanc, and J. Rivat in 1990. With this experience, J. Rivat rewrote everything using bitboards. After Robert Hyatt started using bitboards too, long discussions on ics and sharing new ideas permitted to improve considerably the technique.

Chess Guru is a 64 bits intensive program and performs poorly on 32 bits computers. The search algorithm is using PVS with nullmove, Extended Transposition Table, Refutation Table, Internal Iterative Deepening, several classical extensions schemes (like incheck extension, recaptures). The evaluation includes development, mobility, pawn structure and king safety .

External Links

Chess Engine

Chess Guru (French)
Chess Guru's ICGA Tournaments

Guru

Guru (disambiguation) from Wikipedia
Guru from Wikipedia
Guru Guru / Klaus Schulze - French TV 1973, YouTube Video

References

^ Srimad Guru Adi Shankaracharya, Adi Shankara with disciples, by Raja Ravi Varma, 1904
^ Chess Guru's ICGA Tournaments

What links here?

Page	Date Edited
2nd Computer Olympiad	Jul 12, 2017
Chess Guru	Mar 4, 2017
Chess Wizard	Dec 22, 2014
DEC Alpha	Aug 15, 2015
Engines	Mar 10, 2018
FCCC 1995	Jul 27, 2015
FCCC 1996	Jul 25, 2014
FCCC 1998	Oct 22, 2012
FCCC 1999	Jan 29, 2013
FCCC 2000	Jan 26, 2013
French Computer Chess Championship	Jan 29, 2013
Joël Rivat	Jul 21, 2017
Mathematician	Apr 9, 2018
WMCCC 1997	Apr 4, 2017
ZChess	Jan 8, 2016

Up one Level

Confucius

GerdIsenberg — Sat, 24 Aug 2013 18:20:50 GMT

Home * Engines * Confucius

		Confucius, a chess program by Anders and Büker ^[1], in 1997 two students from University of Hamburg, which played the IPCCC 1997 running on a Sun Ultrasparc ^[2].
Confucius ^[3]

Selected Game

IPCCC 1997, round 5, Diogenes - Confucius ^[4] ^[5]

[Event "IPCCC 1997"]
[Site "Paderborn, GER"]
[Date "1997.02.22"]
[Round "05"]
[White "Diogenes"]
[Black "Confucius"]
[Result "1/2-1/2"]
 
1.d4 b6 2.Nf3 d5 3.e3 Nf6 4.Bd3 e6 5.O-O Ba6 6.Bxa6 Nxa6 7.c4 Nb8 8.cxd5 exd5 
9.Re1 Bd6 10.Nc3 O-O 11.e4 dxe4 12.Nxe4 h6 13.Nxd6 Qxd6 14.Ne5 Nc6 15.Nxc6 Qxc6 
16.Bf4 Qd7 17.Qc2 Nd5 18.Bg3 Rac8 19.Rac1 Rce8 20.h3 a5 21.Qc4 Re6 22.Rcd1 Rfe8 
23.Re5 c6 24.Qf1 Ne7 25.b3 Ng6 26.Rxe6 Rxe6 27.Qc4 h5 28.d5 b5 29.Qc5 a4 30.bxa4 
bxa4 31.Rd4 Re1+ 32.Kh2 h4 33.Bb8 Qf5 34.Rb4 cxd5 35.Bd6 Re2 36.f4 Rxa2 37.Rd4 
Qe6 38.Rxd5 Qe2 39.Rg5 Rd2 40.f5 Qa6 41.Bc7 Nf8 42.Qc3 f6 43.Qxd2 fxg5 44.Qxg5 
Qf6 45.Qxf6 gxf6 46.Bd6 Nd7 47.Kg1 Ne5 48.Be7 Kf7 49.Bc5 Nc4 50.Kf2 a3 51.Kf3 a2 
52.Bd4 1/2-1/2

Photos

Anders and Büker at IPCCC 1997 ^[6]

Forum Posts

Paderborn-Tournament so far by Thorsten Czub, rgcc, February 22, 1997
Paderborn results & comments by Tom Kerrigan, rgcc, February 27, 1997

External Links

References

^ Given names actually unknown, if you are aware of the authors, please provide them
^ Ulf Lorenz (1997). The 6th International Paderborn Computer-Chess Championship. ICCA Journal, Vol. 20, No. 1
^ The teaching Confucius. Portrait by Wu Daozi, 685-758, Tang Dynasty, Confucius from Wikipedia
^ Paderborn-Tournament so far by Thorsten Czub, rgcc, February 22, 1997
^ Downloads, IPCCC, Games, hosted by CSVN
^ Tom Kerrigan's Home Page - Paderborn 1997 by Tom Kerrigan

What links here?

Page	Date Edited
Confucius	Aug 24, 2013
Engines	Mar 10, 2018
IPCCC 1997	Aug 24, 2013
University of Hamburg	Jan 20, 2018

Up one level

Djinn

GerdIsenberg — Mon, 08 Feb 2016 16:59:55 GMT

Home * Engines * Djinn

		Djinn, a Chess Engine Communication Protocol compliant chess engine written by Tom Likens in C++ with some inline assembly, first released in December 2003 ^[1]. Djinn utilizes bitboards to represent its chess board and pieces. As relatively slow searcher, Djinn spends most of its time in the evaluation ^[2]. Executables are available to run under Windows and Linux, Đorđe Vidanović has provided Djinn's Opening Book ^[3]. So far, Djinn played the CCT6 and CCT8.
Ali and the Jinn ^[4]

Techniques and Algorithms

Techniques and Algorithms

Djinn uses most of the following techniques and algorithms in one form or another ^[5]:

Selected Games

CCT6, round 7, Hossa - Djinn ^[6]

[Event "CCT6"]
[Site "Internet Chess Club"]
[Date "2004.02.01"]
[Round "7"]
[White "Hossa"]
[Black "Djinn"]
[Result "0-1"]
 
1.e3 e5 2.d4 exd4 3.exd4 d5 4.Nf3 c6 5.Bd3 Qe7+ 6.Be3 Qb4+ 7.Nfd2 Nf6 8.O-O Be7 
9.c3 Qd6 10.Re1 Ng4 11.Nf3 Nxe3 12.Rxe3 O-O 13.Nbd2 g6 14.c4 Be6 15.c5 Qc7 16.Ne5 
Nd7 17.Nxd7 Qxd7 18.Qc2 b6 19.b4 bxc5 20.bxc5 Bg5 21.Ree1 Bf4 22.Rab1 Rfe8 23.Nf3 
Bg4 24.Ne5 Bxe5 25.dxe5 Rab8 26.Rxb8 Rxb8 27.a3 Bf5 28.f4 Rb5 29.Rc1 Bxd3 30.Qxd3 
h5 31.Qd2 Qf5 32.a4 Rb1 33.a5 Rxc1+ 34.Qxc1 Qe4 35.g3 Qb4 36.a6 Kf8 37.Kf2 Qd4+ 
38.Kg2 Qe4+ 39.Kf2 Qd3 40.e6 Qd4+ 41.Kg2 Qb4 42.exf7 Kxf7 43.Kf2 Qa5 44.Qc2 Qxa6 
45.f5 Qa1 46.fxg6+ Kg7 47.Qe2 Qd4+ 48.Kf1 Qc4 49.Qxc4 dxc4 50.Ke2 Kxg6 51.h3 Kf5 
52.Ke3 Ke5 53.Kd2 Kd4 54.Kc1 c3 55.Kc2 Kc4 56.Kd1 Kd3 57.Ke1 c2 58.Kf2 c1=Q 59.g4
Qf4+ 60.Kg2 Ke3 61.g5 Qxg5+ 62.Kf1 Qg3 63.h4 Qf2# 0-1

Publications

Tom Likens (2003). Djinn User Guide. pdf

Forum Posts

Djinn 0.815 Available by Tom Likens, Winboard Forum, December 25, 2003
Re: Can any program find this thematic move? (Djinn 0.781) by Tom Likens, CCC, May 08, 2004
Djinn 0.967 is now available for download by Tom Likens, CCC, October 15, 2012
Djinn 0.969 Released (64-bit + 32-bit) by Tom Likens, CCC, October 20, 2012
New Djinn 0.971 (time management fix) by Tom Likens, CCC, November 10, 2012
Djinn 0.979 Available (Win x64, 32 and Linux x64) by Tom Likens, CCC, January 30, 2013
Djinn 1.006 by Tom Likens, CCC, December 24, 2013
Djinn 1.021 by Tom Likens, CCC, April 12, 2014

External Links

Chess Engine

Djinn by Tom Likens
Computer Chess Programming Topics
Djinn 0.925x in KCEC
Djinn in CCRL 40/4
Djinn in CCRL 40/40

Djinn

References

^ Djinn from WBEC Ridderkerk
^ Djinn - Overview
^ Djinn - Downloads
^ Ahsan-ol-Kobar, Ali and the Jinn (cropped) 1568, Golestan Palace, Iran, Dschinn Wikipedia.de (German)
^ Computer Chess Programming Topics by Tom Likens
^ CCT6 - PGN download hosted by Volker Richey

What links here?

Page	Date Edited
CCT15	Oct 21, 2014
CCT16	May 13, 2014
CCT6	May 29, 2014
CCT8	Apr 6, 2013
Djinn	Feb 8, 2016
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Genie	Feb 7, 2016
Ifrit	Feb 7, 2016
Tom Likens	Mar 7, 2017

Up one level

Genie

GerdIsenberg — Sun, 07 Feb 2016 13:49:05 GMT

Home * Engines * Genie

		Genie, an early chess program written by Herbert D. Raymond. Genie played the ACM 1971, with wins vs. Schach and Coko III and losses from Chess 3.5 and the runner up play-off from Tech. Genie ran on a SDS 940 ^[1] , Scientific Data Systems' first machine to support the Berkeley Timesharing System ^[2] ^[3] , created by the University of California, Berkeley as part of their Project Genie that ran between 1964 and 1965 as smaller counterpart to MIT's Project MAC. Genie was a Shannon Type B program with a width of three or four moves, written in Quick Systems Programming Language (QSPL), which was also used for the Community Memory, the first public computerized bulletin board system.
Genie in Legoland ^[4]

Photos

Genie vs Schach ^[5], Herbert D. Raymond (left?) and Rolf C. Smith? ^[6], ACM 1971 ^[7]

[Event "ACM 1971"]
[Site "Chicago USA"]
[Date "1971.08.02"]
[Round "1"]
[White "Genie"]
[Black "Schach"]
[Result "1-0"]
 
1.e4 e5 2.Nf3 Nc6 3.Bb5 a6 4.Ba4 Nf6 5.O-O b5 6.Bb3 Nxe4 7.Na3 Bxa3 8.bxa3 d5
9.Re1 Bg4 10.Re3 Bxf3 11.Rxf3 O-O 12.Rf5 g6 13.Rf3 Qd6 14.d3 Nf6 15.Bg5 Ng4
16.Rg3 Nxf2 17.Kxf2 Qxa3 18.Bc1 Qc5+ 19.Kf3 e4+ 20.dxe4 dxe4+ 21.Ke2 Nd4+ 
22.Kf1 Kh8 23.Rg5 Nf5 24.Qd7 Qd6 25.Qxf5 Qd1+ 26.Kf2 e3+ 27.Bxe3 Qxa1 
28.Qe5+ Qxe5 29.Rxe5 Rad8 30.Bc5 Rg8 31.Rd5 Rge8 32.Rxd8 Rxd8 33.Bxf7 Rd2+ 
34.Ke3 Rd7 35.Bd4+ Rxd4 36.Kxd4 c6 37.g4 g5 38.Kc5 h6 39.Kxc6 Kh7 40.c4 1-0

Description

From ACM 1971 Computer Chess Programs (Panel) ^[8]

This chess-playing program was written in Quick Systems Programming Language (QSPL), a language developed for the SDS 940. Although the code generated by this compiler is rather inefficient, it was decided to use this high level language rather than suffer through assembly level coding. This choice was made considering requirements for rapid program development, ease of maintenance, flexibility, and understandable documentation. The program runs under a time sharing system using a teletype for man-machine communication. The program accepts Postal Chess Notation as input and responds likewise. Additionally, it will print the board when requested and ask for a piece selection for pawn promotion. The user interface also allows for player color selection. The program itself has been developed, so far, in two stages as defined below. Stage one of program development consisted of writing the legal chess support routines and a one move lookahead algorithm for machine move selection. A very blunt approach was taken to create the legal move generators. Upon call to one of the piece move generators (pawn, knight, bishop, rook, queen, king) with an (x, y) board position as input, all legal moves for that type of piece in that position are listed in a table. These move generators use only the current board position (from a table), except for the pawn and king move generators which also refer to the game (move record) table to extract information for en passant captures and castling.

Two other routines, for check and mate, complete the legal move machinery. These latter routines test for check and mate using an input of the color to be tested for those conditions and returning true or false answers.

An opponent's move is checked for legality by taking the (x, y)-from position and calling on the correct piece routine. All legal moves from that position with that piece are checked against the (x, y)-to position of the opponent's move. If no match is found, the move is illegal and a new move is requested (an error message is typed also). If the move matches, then the check routine is called to determine if the opponent has attempted to move into check or has failed to move out of a check. If true, once again an illegal move is signaled. The check and mate routines are then called using the machine's color as an input to advise of check or mate. Legal chess by the opponent thus being assured, it is the machine's turn to play. The machine starts its move selection by scanning the board and generating every move for each of its pieces using the piece move generators. Moves into check are immediately eliminated using the check routine. Then, each of the possible moves is rated by adding values for check on opponent, piece captured, control of center, mobility, development, other king attacks, own king defense, promotion, attacks, and immediate replies. All except the last two are based on that move being evaluated and the current board position. Replies and attacks consist of using the move generators to list every possible reply and every possible second move in a row (two machine moves with no intervening opponent move).

These moves are rated only on the basis of pieces captured (or attacked) and control of the board center. Their values are summed and applied to the rating value of the basic move. A move which checkmates the opponent is tested for first and if found, immediately receives the highest possible rating value and no other rating calculations are made. This first stage program was experimented with to optimize the play by changing piece values, position values, and other variable parameters; recognizing that the program only looked ahead one move. The second stage of program development consisted of adding a recursive routine to look ahead, using the same rating criteria, as far as a set depth and using a set width of move selection. A minimax or alpha-beta algorithm was employed in hopes of getting sufficient cut-offs to be able to increase look-ahead efficiency. No dynamic changes to the width and depth were incorporated. This second stage of development created the program as it exists today. Unfortunately, the combination of a 1.75 microsecond cycle time and the inefficient code generated by the compiler allow only a three or four move look-ahead with a width of three or four without exceeding time constraints. The program does, however, play a quite reasonable game of chess. Immediate future effort will consist of the addition of more sophistication to the move tree machinery; probably in the areas of dynamic width and depth changes and recognition of double moves where one would do. Also, the application of different heuristics to opening, middle, and end games could easily be implemented.

External Links

References

^ SDS 940 Computer - console - CHM Revolution from The Computer History Museum
^ Timesharing as a Business - CHM Revolution from The Computer History Museum
^ Butler Lampson (1969). An Overview of the CAL Time-Sharing System. University of California, Berkeley, pdf
^ Jinn from Wikipedia
^ Genie vs Schach by Monroe Newborn from The Computer History Museum
^ Name of the image by Monroe Newborn is Unknown_Raymond_Genie_vs_Schach_ACM_2_NACCC.Chicago_1971
^ PGN Download NACCC from Computerschaak/Downloads/Games hosted by CSVN
^ Ben Mittman (1971). Computer Chess Programs (Panel). pdf from The Computer History Museum

What links here?

Page	Date Edited
ACM 1971	Jul 19, 2016
Coko	Jul 13, 2015
Djinn	Feb 8, 2016
Engines	Mar 10, 2018
Genie	Feb 7, 2016
Ifrit	Feb 7, 2016
University of California, Berkeley	Sep 5, 2016

Up one Level

Golem

GerdIsenberg — Thu, 18 May 2017 20:16:57 GMT

Home * Engines * Golem

		Golem, (ChessGolem) a Chess Engine Communication Protocol compliant chess program written by Gianluigi Masciulli in C. Starting the project in 1999, the first beta appeared in January 2000 ^[1], when Gianluigi just implemented the quiescence search in an "exploding way" ^[2]. The first public release was in May 2000 ^[3]. With Gianluigi as founding member of the G 6, the Italian Chess Programmer Group, Golem played all the early G6 tournaments, four Italian Computer Chess Championships (CIPS) from 2001 until 2007, and the CCC 2008 and CCC 2008 Chess Computer Cups.
Golem ^[4]

Publications

Norbert Wiener (1964). God & Golem, Inc.: A Comment on Certain Points Where Cybernetics Impinges on Religion - MIT Press, Cambridge, MA - available as pdf reprint
Stanisław Lem (1981). Golem XIV. Wydawnictwo Literackie
Herbert D. Enderton (1991). The Golem Go Program. Technical Report CMU-CS-92-101, Carnegie Mellon University

Forum Posts

1999

Program name list by Gianluigi Masciulli, CCC, September 03, 1999
Re: Program name list by Michel Chassey, CCC, September 03, 1999
Re: Somebody was talking about the name Golem? by Gianluigi Masciulli, CCC, September 08, 1999

2000 ...

Golem (was Re: what's the tool you used for the diagram ? THANKS!) by Gianluigi Masciulli, CCC, January 31, 2000
If you want a weak yet stable opponent, Golem is the one for by Dann Corbit, Winboard Forum, May 12, 2000
Golem & Nero - correspondence games by Jari Huikari, CCC, July 28, 2000 » Nero
Golem rel 0.1 just released :-) by Gianluigi Masciulli, CCC, May 12, 2000
Golem growing slowly by Gianluigi Masciulli, Winboard Forum, September 18, 2001
golem or gromit ? by Gianluigi Masciulli, CCC, November 30, 2001
Anybody know a way to run Golem in Fritz Gui ? by Mahesh Jeswin, CCC, October 01, 2005

External Links

Chess Engine

Golem's Page (reocities)
Golem's Page (oocities)

Golem

References

^ Golem's Page - G6
^ Golem (was Re: what's the tool you used for the diagram ? THANKS!) by Gianluigi Masciulli, CCC, January 31, 2000
^ Golem from WBEC Ridderkerk
^ Illustration of a golem by Philippe Semeria. The Hebrew word for "Truth", one of the names of God, is written on his forehead, January 21, 2009, Golem from Wikipedia

What links here?

Page	Date Edited
Aldebaran	Feb 10, 2013
BremboCE	Feb 17, 2013
CCC 2008	Jan 6, 2014
CCC 2009	Apr 29, 2015
CIPS 2001	Feb 3, 2013
CIPS 2002	Feb 9, 2013
CIPS 2003	Jan 6, 2014
CIPS 2007	Jan 6, 2014
Engines	Mar 10, 2018
Gargamella	Aug 16, 2013
Gianluigi Masciulli	May 18, 2017
Golem	May 18, 2017
Nero	May 5, 2017

Up one level

Ifrit

GerdIsenberg — Sun, 07 Feb 2016 18:09:45 GMT

Home * Engines * Ifrit

		Ifrit, (Ифрит) an UCI compliant open source chess engine by Andrey Brenkman written in C++, distributed under the GNU General Public License, with executables built to run under Windows, Linux, and Android, 64, and 32 bit. The development started in 2006, as suggested by the copyright notice inside the source files, the most recent version m1.8 published on Bitbucket on June 14, 2012. Ifrit used several board representations and implementations in four series, namely 0x88 in series "c" , Bitboards in "b", object oriented Bitboards in series "j", and finally, Magic Bitboards in series "m". The search does not perform Negamax, but indirect recursion with White as max-player and Black as min-player. Some routines, such as bitscan, are instantiated in multiple source files, bitboard constants are defined as decimals rather than more intuitive hexadecimal for board pattern.
An Ifrit named Arghan Div ^[1]

Features

^[2]

Forum Posts

Ifrid?? by Tony Thomas, CCC, December 17, 2007
Ifrit by Gabor Szots, CCC, December 24, 2007
Ifrit Updated by Swaminathan Natarajan, January 29, 2010
[STS 1-10] Ifrit 3.6 by Swaminathan Natarajan, August 14, 2010

External Links

Chess Engine

Misc

References

^ "An Ifrit named Arghan Div brings the chest of armor to Hamza", unknown artist, between 1562 and 1577, Brooklyn Museum, Wikimedia Commons, Ifrit from Wikipedia
^ Based on Ifrit_m1_9_Beta_24_June_2012, abrenkman / Ifrit_chess_engine / source / — Bitbucket
^ Bitscan forward by De Bruijn Multiplication with De Bruijn constant from CPW, 0x03F79D71B4CB0A89, used as decimal magic 285870213051386505, implementation (decimal conversion?) credited to Jim Ablett, routine by Charles Leiserson, Harald Prokop and Keith H. Randall, end of abrenkman / Ifrit_chess_engine / source / move_generation.cpp — Bitbucket, also instantiated elsewhere

What links here?

Page	Date Edited
Andrey Brenkman	Feb 7, 2016
Djinn	Feb 8, 2016
Engines	Mar 10, 2018
Gavon	Apr 30, 2018
Genie	Feb 7, 2016
Ifrit	Feb 7, 2016

Up one Level

King of Kings

GerdIsenberg — Wed, 04 Sep 2013 08:54:20 GMT

Home * Engines * King of Kings

		King of Kings, (KoK) a WinBoard compliant chess engine written by Koundinya Veluri in C++, first released in May 2001 ^[1]. King of Kings applies PVS with aspiration windows inside an iterative deepening framework with fractional ply increments ^[2]. Version 2.30 introduced PV extensions in 2003 ^[3], and in 2.50 depth reduction in null move pruning was increased from two to three plies, along with a more profound king safety routine in evaluation ^[4]. KoK uses two transposition tables supposable with different replacement schemes, size, and store and probe depth limits ^[5], and a separate pawn-king hash table ^[6]. Apparently, it uses biboards with a8 = 0, b8 = 1, h1 = 63 square mapping ^[7]. King of Kings played the CCT4 with 6/11 and the CCT6 with 6½/9 shared 4th - 6th along with Junior and Ruffian, behind Crafty, Hiarcs and Zappa.
King of Kings in the 1998 2,000 Guineas ^[8]

Selected Games

CCT4

CCT4, round 1, King of Kings - Fritz 7 ^[9]

[Event "CCT4"]
[Site "Internet Chess Club"]
[Date "2002.01.19"]
[Round "1"]
[White "King of Kings 2.022"]
[Black "Fritz 7.0.0.6"]
[Result "1/2-1/2"]
 
1.d4 Nf6 2.c4 g6 3.Nf3 Bg7 4.Nc3 d5 5.Bf4 O-O 6.Rc1 dxc4 7.e3 Be6 8.Ng5 Bd5 
9.e4 h6 10.exd5 hxg5 11.Bxg5 Nxd5 12.Bxc4 Nb6 13.Bb3 Nc6 14.Ne2 a5 15.a4 Rc8 
16.Be3 e5 17.dxe5 Qxd1+ 18.Rxd1 Nxe5 19.Bxb6 cxb6 20.O-O Rfd8 21.Nf4 b5 22.Nd5 
Kf8 23.axb5 Nd7 24.Ra1 Nc5 25.Bc4 Nd3 26.Nb6 Nxb2 27.Bxf7 Rc5 28.Bxg6 Rd6 
29.Rxa5 Rxb6 30.Ra8+ Ke7 31.Re1+ Kf6 32.Be8 Re6 33.Rxe6+ Kxe6 34.g4 Ke7 35.Bg6 
Rxb5 36.h4 Rb4 37.Re8+ Kf6 38.Bf5 Na4 39.Re6+ Kf7 40.h5 Nc5 41.Rg6 Be5 42.h6 
Nb3 43.Kf1 Nd4 44.Rg5 Bf6 45.h7 Bg7 46.Be4 b5 47.Rd5 Ne6 48.f3 Ke7 49.g5 Nd4 
50.g6 Rc4 51.Kf2 Rc8 52.f4 b4 53.Ra5 Ne6 54.Rb5 b3 55.Rxb3 Nc5 56.Bf5 Rf8 
57.Re3+ Kd6 58.Bc2 Rxf4+ 59.Kg2 Ne6 60.Rb3 Rf8 61.Rb5 Bh8 62.Rb7 Ke5 63.Bb1 
Rd8 64.Kf2 Kf4 65.Re7 Ng7 66.Ra7 Rb8 67.Bd3 Kg5 68.Ra6 Ne8 69.Ke2 Nf6 70.Rc6 
Rd8 71.Bc2 Re8+ 72.Kd2 Nh5 73.Rc7 Kh6 74.Rc4 Nf6 75.Rh4+ Kg7 76.Ra4 Rd8+ 77.Ke2 
Kh6 78.Rh4+ Kg5 79.Rh2 Nd7 80.Rh3 Re8+ 81.Kd1 Ne5 82.Rb3 Kh6 1/2-1/2

CCT6

CCT6, round 5, King of Kings - Comet ^[10]

[Event "CCT6 45 10"]
[Site "Internet Chess Club"]
[Date "2004.01.31"]
[Round "5"]
[White "King fo Kings"]
[Black "Comet B68"]
[Result "1-0"]
 
1.d4 d5 2.c4 e6 3.Nf3 Nf6 4.Nc3 c5 5.cxd5 Nxd5 6.e3 Nc6 7.Bd3 cxd4 8.exd4 Be7 
9.O-O O-O 10.Re1 Bf6 11.Be4 Nce7 12.Qd3 h6 13.Ne5 Nxc3 14.Qxc3 Qb6 15.b3 Nd5 
16.Qd3 Rd8 17.Bh7+ Kf8 18.Qf3 Ne7 19.Re4 Qa6 20.Be3 Nd5 21.Qh5 Bxe5 22.dxe5 b6 
23.Rd4 Bb7 24.Bd2 Qa3 25.Rg4 Qb2 26.Rd1 Ne3 27.Rf4 Nf5 28.Rxf5 exf5 29.Bb4+ Ke8
30.e6 Qf6 31.exf7+ Qxf7 32.Re1+ Be4 33.Bg6 Kd7 34.Bxf7 Kc6 35.Bc4 a5 36.Qf7 
axb4 37.Bb5+ 1-0

Forum Posts

King of Kings 1.93 by Koundinya Veluri (Canada) is available by Frank Quisinsky, Winboard Forum, May 03, 2001
King of Kings 1.96 Released by Koundinya Veluri, Winboard Forum, July 31, 2001
King of Kings 1.98 Released by Koundinya Veluri, CCC, August 31, 2001
King of Kings 2.02 by Koundinya Veluri, CCC, December 10, 2001
King of Kings 2.03 by Koundinya Veluri, CCC, February 26, 2003
King of Kings 2.10 by Koundinya Veluri, CCC, March 11, 2003
King of Kings 2.12 by Koundinya Veluri, CCC, March 25, 2003
King of Kings 2.30 by Koundinya Veluri, Winboard Forum, August 19, 2003
King of Kings 2.50 by Koundinya Veluri, CCC, November 01, 2003

External Links

Chess Engine

Misc

References

^ KingOfKings from WBEC Ridderkerk
^ King of Kings 1.98 Released by Koundinya Veluri, CCC, August 31, 2001
^ King of Kings 2.30 by Koundinya Veluri, Winboard Forum, August 19, 2003
^ King of Kings 2.50 by Koundinya Veluri, CCC, November 01, 2003
^ Re: Beowulf hot spots shown pictorially by Koundinya Veluri, CCC, June 21, 2002 » Beowulf, Transposition Table
^ King of Kings 2.02 by Koundinya Veluri, CCC, December 10, 2001
^ Re: FirstBit() in assembler by Koundinya Veluri, CCC, January 13, 2002 » BitScan
^ King of Kings with Michael Kinanegallops home in the 1998 2,000 Guineas, Vote: Brittain triumphed with Mystiko but who is your best 2,000 Guineas winner of the 1990s? by Mark Jeffreys, Mail Online, May 2008
^ PGN download from CCT4 hosted by Volker Richey
^ PGN download from CCT6 hosted by Volker Richey

What links here?

Page	Date Edited
CCT4	Apr 22, 2013
CCT6	May 29, 2014
Chester	Feb 15, 2014
Engines	Mar 10, 2018
King of Kings	Sep 4, 2013
Koundinya Veluri	Feb 2, 2013
Ruffian	Jun 6, 2017
University of Toronto	Dec 8, 2017

Up one Level

Nemeton

GerdIsenberg — Sat, 23 Dec 2017 11:46:32 GMT

Home * Engines * Nemeton

		Nemeton, a WinBoard conform open source chess engine by Stan Arts. It had its over the board tournament debut at the PT 47, November 2014, in Leiden, and was introduced and released soon after ^[1]. Written in Pascal, Nemeton started as simple "bean counter", utilizing a 16x12.5 mailbox board array (board:array[0..200] of byte) without piecelists and therefor an extremely small memory footprint. Nemeton 1 did not poll input while thinking, so that pondering or analyzing were not possible, but already in Nemeton 1.1, released in February 2015 ^[2].
Trees in De Hoge Veluwe ^[3]

Etymology

A nemeton was a sacred place of Celtic religion with trees. In Dutch, it also sounds like somebody who grabs material (Nemen Ton!) ^[4].

Screenshot

Nemeton3D 1.51 with its 3D Graphics Board ^[5]

Photos

PT 51, round 7, Johan de Koning and Stan Arts in The King - Nemeton 3D ^[6]

Forum Posts

2014

Nemeton 1 release by Stan Arts, CCC, November 18, 2014

2015 ...

Nemeton 1.1 by Stan Arts, CCC, February 15, 2015
Nemeton 1.2 by Stan Arts, CCC, June 16, 2015

2016

Nemeton 1.3 by Stan Arts, CCC, February 28, 2016
Nemeton 1.4 by Stan Arts, CCC, May 03, 2016
Nemeton 1.5 by Stan Arts, CCC, December 24, 2016

2017

Nemeton3D 1.51 by Stan Arts, CCC, June 04, 2017
Nemeton 1.6 by Stan Arts, CCC, September 27, 2017
Nemeton, Neurosis (+N3D) and StansChess versions available by Günther Simon, CCC, December 20, 2017

External Links

Chess Engine

Stan's files on OneDrive
Nemeton at CCRL 40/40

Misc

References

^ Nemeton 1 release by Stan Arts, CCC, November 18, 2014
^ Nemeton 1.1 by Stan Arts, CCC, February 15, 2015
^ Image GA32070.jpg from Category:De Hoge Veluwe - Wikimedia Commons, source Fotocollectie A.B. Wigman, Hoge Veluwe National Park from Wikipedia
^ Nemeton 1 release by Stan Arts, CCC, November 18, 2014
^ Nemeton3D 1.51 by Stan Arts, CCC, June 04, 2017
^ Round 7 photo by Gerd Isenberg, April 30, 2017

What links here?

Page	Date Edited
3D Graphics Board	Sep 23, 2017
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Nemeton	Dec 23, 2017
Neurosis	Dec 23, 2017
PT 47	Dec 1, 2014
PT 48	Oct 15, 2015
PT 50	May 3, 2017
PT 51	Oct 5, 2017
PT 52	Nov 14, 2017
Stan Arts	Nov 21, 2014
WCRCC 2016	Jun 27, 2017

Up one level

Nirvanachess

GerdIsenberg — Sat, 30 Sep 2017 08:55:06 GMT

Home * Engines * Nirvanachess

		Nirvanachess, (Nirvana) an UCI compliant chess engine by Thomas Kolarik, written in C++, first released in April 2013 ^[1]. Nirvanachess applies a principal variation search with a four bucket transposition table, null move pruning, late move reduction, and futility pruning and razoring with CLOP optimized margins inside an iterative deepening framework with aspiration windows, move ordering improved by the killer heuristics. Its evaluation uses material and piece-squares tables, and further places emphasis on mobility, pawn structure with focus on passed pawns and pawn chains, and king safety, considing pawn storms, how many squares around the king are attacked by how many attackers, and the quality of the pawn shelter ^[2]. Nirvana 2.0, released in December 2014, was a complete rewrite using bitboards instead of a 10x12 board with an improved evaluation and a parallel search using the lazy SMP approach ^[3]. Nirvanachess 2.1 improved due to singular extensions, logistic regression tuning aka Texel's Tuning Method of evaluation weights, as well as SPSA tuning for pruning margins ^[4] ^[5].
Mahavira's Nirvana ^[6]

Forum Posts

2013

Nirvanachess 1.0 Release by Thomas Kolarik, CCC, April 10, 2013
Nirvanachess 1.1 Release by Thomas Kolarik, CCC, June 03, 2013
Nirvanachess 1.2 Release by Thomas Kolarik, CCC, August 22, 2013
Nirvanachess 1.3 Release by Thomas Kolarik, CCC, November 12, 2013

2014

Nirvanachess 1.4 Release by Thomas Kolarik, CCC, January 09, 2014
Nirvanachess 1.5 Release by Thomas Kolarik, CCC, March 05, 2014
Hyper Bullet Rating List by Thomas Kolarik, CCC, March 08, 2014
Nirvanachess 1.6 Release by Thomas Kolarik, CCC, April 18, 2014
Nirvanachess 1.7 Release by Thomas Kolarik, CCC, July 03, 2014
Nirvanachess 1.8 Release by Thomas Kolarik, CCC, August 27, 2014
Transposition Table Oddity by Thomas Kolarik, CCC, September 28, 2014
Nirvanachess 2.0 Release by Thomas Kolarik, CCC, December 17, 2014

2015 ...

Nirvanachess 2.1 Release by Thomas Kolarik, CCC, May 05, 2015
Nirvanachess 2.2 Release by Thomas Kolarik, CCC, October 15, 2015
Nirvanachess 2.3 Release by Thomas Kolarik, CCC, July 31, 2016
Nirvanachess 2.4 Release by Thomas Kolarik, Nirvanachess , August 11, 2017 ^[7]

External Links

Chess Engine

Misc

References

^ Nirvanachess 1.0 Release by Thomas Kolarik, CCC, April 10, 2013
^ Nirvanachess
^ Nirvanachess 2.0 Release by Thomas Kolarik, CCC, December 17, 2014
^ Nirvanachess: Nirvanachess 2.1 Release, May 04, 2015
^ Nirvanachess 2.1 Release by Thomas Kolarik, CCC, May 05, 2015
^ Mahavira's Nirvana or Moksha. Note the crescent shaped Siddhashila (a place where all Siddhas reside after Nirvana). Folio 53r from Kalpa Sūtra series, loose leaf manuscript, Patan, Gujarat, ca. 1472, Wikimedia Commons
^ Nirvanachess 2.4 has been released by Graham Banks, CCC, August 15, 2017

What links here?

Page	Date Edited
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Lazy SMP	Jan 4, 2018
Nirvanachess	Sep 30, 2017
TCEC Season 10	Jan 3, 2018
TCEC Season 11	Apr 18, 2018
TCEC Season 8	Nov 30, 2015
TCEC Season 9	Nov 6, 2017
Thomas Kolarik	Aug 26, 2016

Up one level

Prophet

GerdIsenberg — Sat, 30 Sep 2017 20:54:11 GMT

Home * Engines * Prophet

		Prophet, a Chess Engine Communication Protocol compliant open source chess engine under the GNU General Public License, written by James Swafford in C++ as a better C. As successor of Galahad, Prophet is a traditional bitmap based program. Prophet was used in experiments with TD-Leaf ^[1] when James Swafford was undergraduate at East Carolina University ^[2], and testbed for parallel search algorithms as topic of its author's Masters project ^[3]. In September 2017, Prophet3 was released as open source under the MIT License, using magic bitboards ^[4].
Nostradamus ^[5]

Description

Bitboard Infrastructure

Description

Bitboard Infrastructure

Rotated Bitboards

Prophet2 uses rotated bitboards with 1/2 MiB lookup tables, indexed by square and 8-bit line occupancy, to determine sliding piece attacks, ignoring the possible fourfold reduction excluding the redundant outer squares ^[6].

Bitmap diag_a1h8_attacks[64][256];
Bitmap diag_h1a8_attacks[64][256];
Bitmap file_attacks[64][256];
Bitmap rank_attacks[64][256];
 
Bitmap GenBishopMap(Position* p,int sq) {
  Bitmap b=0;
  // find index for a1->h8 diagonal
  int ind = (p->allpieces45 >> diag_a1h8_shift[sq]) & diag_a1h8_mask[sq];
  b = diag_a1h8_attacks[sq][ind];
  // find index for h1->a8 diagonal
  ind = (p->allpieces315 >> diag_h1a8_shift[sq]) & diag_h1a8_mask[sq];
  b |= diag_h1a8_attacks[sq][ind];
  return b;    
}

BitScan & PopCount

Similar to Amundsen, the memory bacchanal is attended by population count, bitscan forward (GetLSBFast) and reverse (GetMSBFast) with three 16-bit indexed, 64K lookup tables of double word integers, another 3/4 MiB competing for the caches ^[7]:

int  num_bits[65536];
int  lsb[65536];
int  msb[65536];
 
/*****************************************************************************
 *                                                                           *
 * int GetLSBFast(Bitmap b)                                                  *
 *                                                                           *
 * Returns the least significant bit in a bitmap (1-64), or 0 if no bit set. *
 * Assumes lsb[] is initialized.  Much faster than GetLSBSlow().             *
 *                                                                           *
 *****************************************************************************/
 
int GetLSBFast(Bitmap b) {
  int r = lsb[(int)(b & 65535)];
  if (r) return r;
  b >>= 16;
  r = lsb[(int)(b & 65535)];
  if (r) return r+16;
  b >>= 16;
  r = lsb[(int)(b & 65535)];
  if (r) return r+32;
  b >>= 16;
  r = lsb[(int)b];
  if (r) return r+48;
  return 0;
}

Search

Prophet's search is alpha-beta PVS with transposition table inside an iterative deepening framework with fractional plies and aspiration windows of ± 1/3 pawn value. Selectivity is due to adaptive null move pruning, futility and extended futility pruning, and fractional extensions on checks, single replies, passed pawn advances and recaptures. Beside TT and keeping a linked list of PVs on the Stack, Move ordering considers killer and history heuristic, as well as MVV-LVA and SEE for captures.

Evaluation

The evaluation in centipawn resolution determines a score based on material balance and piece-square tables, and further considers various positional features, such as development, mobility, king safety and pawn structure, and trapped pieces.

Tournament Play

Prophet played five CCT Tournaments, from CCT7 in 2005, until CCT11 in 2009, three ACCA Americas' Computer Chess Championships, ACCA 2006, ACCA 2007 and ACCA 2008, and the WCRCC 2008 Second Annual ACCA World Computer Rapid Chess Championship.

Selected Games

CCT11, round 2, Prophet - NoonianChess ^[8]

[Event "CCT11"]
[Site "Internet Chess Club"]
[Date "2009.03.21"]
[Round "2"]
[White "Prophet"]
[Black "NoonianChess"]
[Result "1-0"]
 
1.c4 g6 2.Nc3 Bg7 3.g3 c5 4.Bg2 Nc6 5.Nf3 d6 6.O-O Nf6 7.d4 cxd4 8.Nxd4 
Bd7 9.Nc2 O-O 10.b3 a6 11.Bb2 Ng4 12.h3 Nh6 13.Rb1 Bf5 14.e4 Be6 15.Nd5 
f6 16.a4 Re8 17.Qd2 Bf7 18.Bc3 g5 19.a5 Rb8 20.Nb6 Bh5 21.Kh1 e5 22.Ne3 
Qe7 23.f4 gxf4 24.gxf4 Qd8 25.Ned5 Kh8 26.Bf3 Bxf3+ 27.Rxf3 f5 28.exf5 
Nxf5 29.fxe5 Nh4 30.Rf7 Nxe5 31.Bxe5 Rxe5 32.Nd7 Qe8 33.Nxe5 dxe5 34.Rbf1
Qe6 35.Qe3 Ng6 36.R1f6 Qc8 37.Rd6 e4 38.Rdd7 Ne5 39.Rxg7 Qxd7 40.Rxd7 Nxd7 
41.Qd4+ Kg8 42.Ne7+ Kf7 43.Qxd7 Rf8 44.Nf5+ Kf6 45.Qe7+ Kxf5 46.Qxf8+ Kg5 
47.Qf1 e3 48.c5 e2 49.Qxe2 Kf4 50.Qe7 h6 51.Qxb7 h5 52.Kg2 Ke3 53.Qd5 Ke2 
54.c6 Ke3 55.c7 Kf4 56.Kh1 Ke3 57.c8=Q Kf2 58.Qd4+ Ke2 59.Qxa6+ Ke1 
60.Qe6+ Kf1 61.Qdf6# 1-0

Publications

James Swafford (2002). Optimizing Parameter Learning using Temporal Differences. AAAI-02, Student Abstracts, pdf
James Swafford (2008). A Survey of Parallel Search Algorithms over Alpha-Beta Search Trees using Symmetric Multiprocessor Machines. Masters Project, East Carolina University, advisor Ronnie Smith, pdf

Forum Posts

It's Prophet by James Swafford, CCC, February 04, 2005 » CCT7
Re: Speedup with bitboards on 64-bit CPUs by James Swafford, CCC, April 28, 2007
pthread weirdness by James Swafford, CCC, May 29, 2007
Prophet ACCA PanAm 2008 tournament notes by James Swafford, CCC, November 10, 2008 » ACCA 2008
prophet3 released with source code by James Swafford, CCC, September 30, 2017

External Links

Chess Engine

Misc

Prophet from Wikipedia
Prophet (disambiguation) from Wikipedia
Prophecy from Wikipedia
Prophecy (disambiguation) from Wikipedia
Nostradamus: The Last Prophecy from Wikipedia
Jazz is Dead - Estimated Prophet, Fox Theatre, Boulder, Colorado, April 13, 1999, YouTube Video
lineup: Jimmy Herring, T Lavitz, Alphonso Johnson, Billy Cobham

References

^ James Swafford (2002). Optimizing Parameter Learning using Temporal Differences. AAAI-02, Student Abstracts, pdf
^ prophet | James Swafford
^ James Swafford (2008). A Survey of Parallel Search Algorithms over Alpha-Beta Search Trees using Symmetric Multiprocessor Machines. Masters Project, East Carolina University, advisor Ronnie Smith, pdf
^ prophet3 released with source code by James Swafford, CCC, September 30, 2017
^ The Portrait of Michel de Nostredame (Nostradamus), a French Renaissance Medicine & Astrologer, painted by his son César de Nostredame (1553-1630?) about 1614 A.D. 16cm x 18cm. (cf. Jean Boyer, “Deux peintres oubliés du XVIe siècle: Etienne Martellange et César de Nostredame”, Bulletin de la Société de l’Histoire de l’art français, Année 1971 (1972), pp.13-20)
^ prophet-20b1-ja.zip, globals.cpp, bitmaps.cpp
^ prophet-20b1-ja.zip, globals.cpp, bitmaps.cpp
^ CCT11 results and games

What links here?

Page	Date Edited
ACCA 2006	Jul 14, 2014
ACCA 2007	Jul 14, 2014
ACCA 2008	Jul 14, 2014
BitScan	Sep 10, 2017
CCT10	May 5, 2013
CCT11	Feb 17, 2015
CCT7	Dec 16, 2017
CCT8	Apr 6, 2013
CCT9	Aug 25, 2013
chess4j	Jan 1, 2018
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Galahad	Jan 8, 2015
James Swafford	Jan 1, 2018
Prophet	Sep 30, 2017
WCRCC 2008	Nov 21, 2016

Up one level

Tao

GerdIsenberg — Fri, 08 Jan 2016 16:17:53 GMT

Home * Engines * Tao

		Tao, a Chess Engine Communication Protocol and later UCI ^[1] compliant chess engine by Bas Hamstra, famous for its attacking playing style encouraged by an opening book cooked by Cock de Gorter ^[2]. Tao played the WMCCC 2001 in Maastricht, six Dutch Open Computer Chess Championships and four International CSVN Tournaments from 2000 until 2005, and three CCT Tournaments. Tao is a bitboard program that uses PVS without root aspiration windows ^[3]. Tao applies incremental updated attacks, incremental move generation, uses SEE to prune losing captures, and extends checks, one reply, recaptures and mate threats along with null move pruning of R=2 ^[4]. It further considers check giving moves in quiescence search ^[5]. Version 5.5 uses evaluation tuning based on temporal differences ^[6].
Taoist Taijitu ^[7]

Photos & Games

DOCCC 2004: Elke van Vlierberghe and Bas Hamstra, Tao - Deep Sjeng ^[8] ^[9]

[Event "DOCCC 2004"]
[Site "Leiden Ned"]
[Date "2004.10.17"]
[Round "06"]
[White "Tao"]
[Black "Deep Sjeng"]
[Result "1/2-1/2"]
 
1.c3 e5 2.e4 d5 3.Qa4+ Nd7 4.exd5 Ngf6 5.c4 Bc5 6.Nc3 O-O 7.d3 Nb6
8.Qd1 Qe7 9.Bg5 h6 10.Bxf6 Qxf6 11.Nf3 Bd4 12.Be2 Qg6 13.O-O Bh3 
14.Ne1 Bd7 15.Nc2 Bh3 16.Bf3 Bxc3 17.bxc3 Bf5 18.Bh5 Qh7 19.Ne1 e4 
20.dxe4 Bxe4 21.Qd4 Rfe8 22.f3 Bf5 23.Rd1 Rad8 24.Rd2 c5 25.Qxc5 Rc8 
26.Qb5 Nxc4 27.Rd4 Ne3 28.Rf2 g6 29.d6 Nd5 30.Rxd5 Rxe1+ 31.Rf1 Rxf1+ 
32.Kxf1 Be6 33.d7 Rd8 34.Qa5 b6 35.Qxa7 Qg7 36.Qxb6 Qf8 37.Rd4 gxh5 
38.a4 Qe7 39.Qc7 Rxd7 40.Rxd7 Bxd7 41.c4 Qe6 42.a5 Bc8 43.Qd8+ Kg7 
44.Qd4+ Kg6 45.Kf2 Ba6 46.c5 h4 47.Qxh4 Qe2+ 48.Kg3 Qe5+ 49.Qf4 Qxc5 
50.Qe4+ Kg7 51.Qg4+ Kf8 52.Qf4 Qxa5 53.Qxh6+ Kg8 54.h3 Qe5+ 55.f4 Qe1+ 
56.Kh2 Bd3 57.Qg5+ Bg6 58.Qd8+ Kg7 59.Qd4+ Kh7 60.Qc5 Qd2 61.Qe5 Qc2 
62.Qf6 Qf2 63.Qe5 Kg8 64.Qg5 Kg7 65.Qe5+ f6 66.Qe7+ Bf7 67.Qe4 Kh6 
68.Qf5 Qb2 69.Qd3 Bg6 70.Qd8 Kg7 71.Qd7+ Bf7 72.Qg4+ Kh6 73.Qf5 Bc4 
74.Qe4 Ba2 75.Qf5 Bb3 76.Kg3 Qd4 77.Kh4 Bf7 78.g3 Bg6 79.Qc8 Kg7 
80.Qc1 Bf5 81.Qe1 Kf7 82.Qe2 Be6 83.Qh5+ Kf8 84.Qh8+ 1/2-1/2

Publications

Raymond Smullyan (1977). The Tao Is Silent. HarperOne
Raymond Smullyan (1977). Is God a Taoist? MIT

Forum Posts

Tao by Bas Hamstra, CCC, October 08, 1999
Tao 4.3 (won against Quest, Dutch-ch 2000) is available ! by Frank Quisinsky, CCC, October 23, 2000
Some questions on Tao by Peter Berger, CCC, January 03, 2001
Tao update by Bas Hamstra, CCC, January 12, 2001
Tao at ICC by Bas Hamstra, CCC, January 17, 2002
CCT4 Tao/Quark by Bas Hamstra, CCC, January 26, 2002 » CCT4, Quark
About Tao 5.2 by Bas Hamstra, CCC, July 25, 2002

External Links

Chess

Taoism

References

^ About Tao 5.2 by Bas Hamstra, CCC, July 25, 2002
^ Shredder and Ruffian lead in Leiden by Eric van Reem and Theo van der Storm, ChessBase, April 24, 2004 » ICT 2004
^ Tao from WBEC Ridderkerk
^ Tao by Bas Hamstra, CCC, October 08, 1999
^ Re: Tao at ICC by Bas Hamstra, CCC, January 17, 2002
^ Tao update by Bas Hamstra, CCC, January 12, 2001
^ Yin and yang from Wikipedia
^ 24th Open Dutch Computer-Chess Championship 2004 Photo Gallery
^ Downloads | Open Dutch Computer Chess Championships | Games

What links here?

Page	Date Edited
Automated Tuning	Feb 27, 2018
Bas Hamstra	Feb 4, 2018
CCT4	Apr 22, 2013
CCT5	Feb 22, 2013
CCT6	May 29, 2014
Cock de Gorter	Nov 3, 2015
DOCCC 2000	Aug 15, 2015
DOCCC 2001	Aug 15, 2015
DOCCC 2002	Nov 24, 2017
DOCCC 2003	Aug 17, 2016
DOCCC 2004	Nov 19, 2016
DOCCC 2005	Aug 15, 2015
Eigenmann Endgame Test	Jun 1, 2017
Engines	Mar 10, 2018
Goliath	Apr 5, 2017
ICT 2001	Oct 14, 2015
ICT 2002	Nov 19, 2016
ICT 2003	Aug 18, 2016
ICT 2004	Aug 17, 2016
Quark	May 11, 2017
Tao	Jan 8, 2016
Temporal Difference Learning	Feb 20, 2018
The King	Jan 21, 2018
WMCCC 2001	Jul 25, 2017

Up one Level

Telepath

GerdIsenberg — Mon, 14 Jul 2014 13:53:25 GMT

Home * Engines * Telepath

		Telepath, a private, UCI compliant ^[1] chess engine by Charles Roberson written in C++ ^[2], development started in 2004. It had its tournament debut at the CCT7, February 2005. Telepath played all further CCT Tournaments, and also the ACCA Americas' Computer Chess Championships and ACCA World Computer Rapid Chess Championships. Telepath uses bitboards as basic data structure and board representation ^[3]. Its King safety considers tropism and square control by a detailed analysis of attacks and defences around the king ^[4].
Brain scanning ^[5]

Photos

Charles' portable Lab at ACCA 2008 running Telepath & Noonian. Bob Hyatt and Ted Summers relaxing ^[6]

Selected Games

WCRCC 2012, Telepath - Goldbar ^[7]

[Event "WCRCC 2012"]
[Site "Internet Chess Club"]
[Date "2012.07.14"]
[Round "7"]
[White "Telepath 6.123"]
[Black "Goldbar"]
[Result "1/2-1/2"]
 
1.d4 Nf6 2.Nf3 e6 3.c4 b6 4.g3 Ba6 5.b3 Bb4+ 6.Bd2 Be7 7.Bg2 c6 8.Bc3 d5 9.Nbd2 Nbd7 
10.O-O O-O 11.Re1 c5 12.e4 dxe4 13.Nxe4 Nxe4 14.Rxe4 Bb7 15.Re3 Bf6 16.dxc5 Bxc3 
17.Rxc3 Nxc5 18.Qe2 Qe7 19.Rd1 Rad8 20.Rcc1 Bxf3 21.Qxf3 a5 22.Qe2 g6 23.Qf3 e5 24.Rd5
Rxd5 25.cxd5 Qd6 26.Qe3 Re8 27.Rd1 Re7 28.a3 Kg7 29.Re1 f6 30.Qc3 Nb7 31.b4 axb4 32.axb4 
Rc7 33.Qb2 Nd8 34.Qb3 Nf7 35.Rd1 f5 36.Qb2 Rc4 37.Rb1 b5 38.Kh1 h5 39.Kg1 h4 40.Qb3 e4 
41.Bf1 Rd4 42.Bxb5 Ne5 43.Be2 Rxd5 44.b5 Qc5 45.Qb4 Qc2 46.Qb2 Qxb2 47.Rxb2 hxg3 48.fxg3
Nd3 49.Rb1 Ne5 50.b6 Rd8 51.b7 Rb8 52.Ba6 g5 53.Kf2 f4 54.Rb4 Nd7 55.Rxe4 Nc5 56.Re5 Nxa6 
57.Rxg5+ Kf6 58.Rb5 fxg3+ 59.Kxg3 Ke7 60.h4 Nc7 61.Rb1 Nd5 62.h5 Kd6 63.h6 Kc7 64.Kh4 Nf6
65.Kg5 Ne4+ 66.Kg6 Rg8+ 67.Kf7 Rb8 68.Rb4 Nd6+ 69.Kf6 Nxb7 70.h7 Rf8+ 71.Kg7 Rd8 72.h8=Q 
Rxh8 73.Kxh8 Nc5 74.Kg7 Kd6 75.Kf6 Kd5 76.Kf5 Nd3 77.Rg4 Ne5 78.Rg8 Nd3 79.Rd8+ Kc4 80.Ke4 
Nc5+ 81.Ke3 Ne6 82.Rd2 Nc5 83.Rd4+ Kc3 84.Rg4 Nd3 85.Re4 Nc5 86.Rh4 Nd3 87.Ke4 Kc4 88.Rh2 
Nc5+ 89.Ke5 Nd3+ 90.Kd6 Kd4 91.Rh4+ Ke3 92.Ke6 Nf4+ 93.Kf5 Nd3 94.Re4+ Kd2 95.Re8 Nf2 
96.Ke5 Kd3 97.Rg8 Ne4 98.Rd8+ Ke3 99.Rh8 Nf2 100.Kd5 Nd1 101.Rh3+ Kf4 102.Kd4 Nf2 103.Rh8 
Kf3 104.Rf8+ Ke2 105.Rf5 Nd3 106.Rg5 Nf2 107.Rg3 Nd1 108.Rd3 Nf2 109.Re3+ Kd2 110.Rb3 Ke2
111.Rc3 Nd1 112.Ra3 Nf2 113.Ra1 Kf3 114.Ra8 Nh3 115.Ra3+ Kg4 116.Rd3 Ng5 117.Ke3 Nh3 
118.Rd4+ Kf5 119.Rd3 Kg4 120.Kd4 Ng5 121.Ke3 Nh3 1/2-1/2

Forum Posts

Re: Speedup with bitboards on 64-bit CPUs by Charles Roberson, CCC, April 27, 2007
king safety by Charles Roberson, CCC, November 02, 2007 » King Safety
Re: Speed up factor when moving from 32 bit to 64 bit operations by Charles Roberson, CCC, March 14, 2008
Rule of Square test position by Charles Roberson, CCC, May 15, 2008
In C++, one does ? for circular dependencies? by Charles Roberson, CCC, February 11, 2009
I beat Telepath by Charles Roberson, CCC, January 12, 2009
Re: Question for Bob Hyatt by Charles Roberson, CCC, January 20, 2010
Re: UCI Implementation in Arena: Bug by Charles Roberson, CCC, June 05, 2010 » UCI, Arena
2011 6th Annual ACCA Pan Am CCC - Telepath games by Charles Roberson, November 12, 2011 » ACCA 2011
Lone minor piece penalty - What did Larry mean? by Charles Roberson, CCC, January 10, 2012

External Links

References

^ Re: UCI Implementation in Arena: Bug by Charles Roberson, CCC, June 05, 2010
^ In C++, one does ? for circular dependencies? by Charles Roberson, CCC, February 11, 2009
^ Re: Speedup with bitboards on 64-bit CPUs by Charles Roberson, CCC, April 27, 2007
^ king safety by Charles Roberson, CCC, November 02, 2007
^ Brain scanning technology is quickly approaching levels of detail that will have serious implications - this animation was made by Fastfission and is based on Fastfission's brain. Thought identification from Wikipedia
^ 2008 Third Annual ACCA Americas' Computer Chess Championships - Site Pics
^ The 2012 Sixth Annual ACCA World Computer Rapid Chess Championships| Results

What links here?

Page	Date Edited
ACCA 2006	Jul 14, 2014
ACCA 2007	Jul 14, 2014
ACCA 2008	Jul 14, 2014
ACCA 2009	Jul 14, 2014
ACCA 2010	Jul 14, 2014
ACCA 2011	Jul 14, 2014
ACCA 2012	Jul 14, 2014
CCT10	May 5, 2013
CCT11	Feb 17, 2015
CCT12	Jan 28, 2018
CCT13	Dec 6, 2013
CCT14	Aug 23, 2012
CCT15	Oct 21, 2014
CCT7	Dec 16, 2017
CCT8	Apr 6, 2013
CCT9	Aug 25, 2013
Charles Roberson	Jan 7, 2016
Dirty	Nov 14, 2017
Engines	Mar 10, 2018
Hector for Chess	Jan 7, 2016
NoonianChess	Jan 7, 2016
Plisk	Dec 31, 2014
Telepath	Jul 14, 2014
WCRCC 2007	Nov 21, 2016
WCRCC 2008	Nov 21, 2016
WCRCC 2009	Jul 14, 2014
WCRCC 2010	Jul 14, 2014
WCRCC 2011	Oct 21, 2014
WCRCC 2012	Jul 14, 2014
WCRCC 2013	Jul 14, 2014
WCRCC 2014	Jul 27, 2014
WCRCC 2015	Jul 19, 2015
WCRCC 2016	Jun 27, 2017
WCRCC 2017	Jun 27, 2017

Up one level

Witchess

GerdIsenberg — Wed, 22 Apr 2015 20:57:16 GMT

Home * Engines * Witchess

		Witchess, (PMess, Npmess, NPMchess) a private chess engine by Mridul Muralidharan, presumably successor or branch of his experimental MessChess program. Witchess played a strong CCT7, the CCT8 under the handle PMess (parallel Mess) ^[1], and the CCT9 as NPMchess ^[2]. At ICC, Witchess is known under the handle Npmess, applying a parallel search, so far on a dual core AMD processor ^[3].
Hans Baldung, Three Witches, ca. 1514 ^[4]

Selected Games

CCT7, round 8, Witchess - Arasan ^[5] ^[6]

[Event "CCT7"]
[Site "chessclub.com"]
[Date "2005.02.13"]
[Round "8"]
[White "Witchess"]
[Black "Arasan 9.0"]
[Result "1-0"]
 
1.e4 e5 2.Nc3 Nf6 3.Bc4 Nc6 4.Nf3 Nxe4 5.Nxe4 d5 6.Bd3 dxe4 7.Bxe4 Ne7 8.c3 f5 
9.Bc2 e4 10.Ne5 Qd5 11.f4 exf3 12.Nxf3 Qe6+ 13.Kf2 Qb6+ 14.d4 Be6 15.Ba4+ c6 
16.Re1 Bd5 17.Bb3 O-O-O 18.Bg5 Qc7 19.Bxd5 cxd5 20.Qe2 Qb6 21.c4 Rd7 22.cxd5 Kb8 
23.Qe5+ Ka8 24.d6 Rxd6 25.Bxe7 Bxe7 26.Qxe7 Rc8 27.Kg1 Rg8 28.Rac1 Rdd8 1-0

Forum Posts

Most brilliant novelty from cct7 Witchess-Arasan by Vincent Diepeveen, CCC, February 14, 2005 » CCT7
pmess at cct by Mridul Muralidharan, CCC, February 27, 2006 » CCT8

External Links

Chess Engine

Finger witchess from ICC

Witch

Witchcraft

Which-cult

Witch-hunt and trial

Chess

Fiction

Fish

Misc

Harwell computer (WITCH) from Wikipedia
Witch of Agnesi from Wikipedia
Julie Driscoll, Brian Auger and the Trinity - Season Of The Witch, 1968, YouTube Video

References

^ pmess at cct by Mridul Muralidharan, CCC, February 27, 2006
^ Private Engine List from Ron Murawski's Computer-Chess Wiki
^ Finger witchess from ICC
^ Hans Baldung, New Year’s Wish with Three Witches, ca. 1514, Pen drawing heightened with white body colour on brown prepared paper, Current location: Musée du Louvre, Skyclad (Neopaganism) from Wikipedia, European witchcraft from Wikipedia
^ a few notes from Arasan's games in CCT7 by Jon Dart, CCC, February 14, 2005
^ Most brilliant novelty from cct7 Witchess-Arasan by Vincent Diepeveen, CCC, February 14, 2005
^ Gardnerian Wicca from Wikipedia

What links here?

Page	Date Edited
Bruja	Feb 3, 2015
CCT7	Dec 16, 2017
CCT8	Apr 6, 2013
CCT9	Aug 25, 2013
Engines	Mar 10, 2018
Hexxpawn	Oct 22, 2014
MessChess	Mar 6, 2014
Mridul Muralidharan	Aug 17, 2013
Sidonia	May 19, 2016
Witchess	Apr 22, 2015

Up one Level

Zen

GerdIsenberg — Thu, 04 Aug 2016 07:52:44 GMT

Home * Engines * Zen

		Zen, a chess program by Eric van Riet Paap, playing the DOCCC 1988 on a 6502 instruction compatible Mitsubishi M50743 CMOS microcontroller with 4KB ROM and 128 Bytes RAM and programmable I/O-ports, running at 8 MHz ^[1] . Despite zero points and last place in the tournament, Van Riet Paap proclaimed commercial ambitions with his entry ^[2] , well suited for small dedicated travel chess computers . The Mephisto Mini, Fidelity Marauder and Tiny Chess were released by Hegener & Glaser in 1989 ^[3] , 1990 ^[4] and 1991 ^[5] respectively, with more variations to follow in subsequent years, also incorporating the M50747 chip with doubled memory size and astonishing 256 Bytes of RAM ^[6] .
wú - nothing ^[7]

Games

DOCCC 1988, round 6, LChess - Zen ^[8]

[Event "DOCCC 1988"]
[Site "Leiden NED"]
[Date "1988.10.??"]
[Round "6"]
[White "LChess"]
[Black "Zen"]
[Result "1-0"]
 
1.e4 e5 2.Nf3 Nc6 3.Bc4 Bc5 4.c3 Nf6 5.d4 Be7 6.dxe5 Nxe4 7.Bxf7+ Kxf7
8.Qd5+ Kf8 9.Qxe4 Bc5 10.Bg5 Qe8 11.Qf4+ Qf7 12.Qxf7+ Kxf7 13.Nbd2 Re8
14.Bf4 d6 15.Ne4 dxe5 16.Bg3 Bb6 17.O-O-O Kg8 18.h3 Be6 19.Kb1 Bf5
20.Rhe1 Rf8 21.Nfd2 Rad8 22.f3 Rd3 23.Bh4 Rf7 24.Ka1 Rfd7 25.Re2 a6
26.Ng3 Be6 27.Ngf1 Bc5 28.Rde1 b5 29.Kb1 R7d6 30.Bg3 Bf5 31.Ka1 R6d5
32.Bxe5 Nxe5 33.Rxe5 c6 34.Rxd5 Rxd5 35.b4 Bd6 36.Ne4 Re5 37.Kb2 Bc7
38.Ne3 Bxe4 39.Ng4 Rd5 40.Rxe4 Rd2+ 41.Kb3 Rxg2 42.Re8+ Kf7 43.Ra8 Bd6
44.Rxa6 h5 45.Rxc6 Bf4 46.Rb6 hxg4 47.Rxb5 Ke6 48.fxg4 Rh2 49.Rh5 g6
50.Rh8 Be5 51.Rh6 Bf4 52.Rxg6+ Kf7 53.Rc6 Rxh3 54.Rc4 Be3 55.b5 Ke7
56.a4 Kd6 57.a5 Rh7 58.Re4 Bc5 59.Kc4 Rh2 60.a6 Rd2 61.Re8 Rf2 62.Rd8+ Kc7
63.Rh8 Be7 64.a7 1-0

External Links

References

^ M50743 from Schachcomputer.info Wiki (German)
^ Dap Hartmann (1988). Report on the 8th Dutch National Computer-Chess Championship. ICCA Journal Vol. 11, No. 4, pp. 196-198
^ Mephisto Mini from Schachcomputer.info Wiki (German)
^ Fidelity Marauder from Schachcomputer.info Wiki (German)
^ Fidelity Tiny Chess (1991) by Eric van Riet Paap, from The Spacious Mind
^ M50747 from Schachcomputer.info Wiki
^ Chinese character for "nothing", Chinese: wú (Japanese: mu). It figures in the famous Zhaozhou's dog kōan, Zen from Wikipedia
^ Downloads | Open Dutch Computer Chess Championships | Games

What links here?

Page	Date Edited
DOCCC 1988	Aug 15, 2015
Engines	Mar 10, 2018
Eric van Riet Paap	Feb 14, 2017
Genesis NL	Dec 12, 2016
October	May 6, 2012
Zen	Aug 4, 2016

Up one level

Wikispaces : chessprogramming - items matching description

Abulafia

Table of Contents

See also

Forum Posts

External Links

Chess Engine

Misc

References

What links here?

Abyss

Table of Contents

Description

Basics

Misc

Abyss' ICGA Tournaments

See also

Publications

External Links

Engine

Misc

References

What links here?

Anubis

Table of Contents

See also

Forum Posts

External Links

References

What links here?

Bruja

Table of Contents

Description

Search

Evaluation

Etymology

See also

Forum Posts

External Links

Chess Engine

Misc

References

What links here?

Chess Guru

Table of Contents

Description

See also

External Links

Chess Engine

Guru

References

What links here?

Confucius

Table of Contents

Selected Game

Photos

See also

Forum Posts

External Links

References

What links here?

Djinn

Table of Contents

Techniques and Algorithms

Selected Games

See also

Publications

Forum Posts

External Links

Chess Engine

Djinn

References

What links here?

Genie

Table of Contents

Photos

Description

See also

External Links

References