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

AdaChess

aiavicoli — Tue, 08 Nov 2016 21:10:20 GMT

Home * Engines * AdaChess

		AdaChess, an Italian chess engine released under the GPL license, written in Ada by Alessandro Iavicoli ^[1] . The development started in early 2012 and the first version has been released on January 21, 2013. Full compliant to the rules of chess, it also recognize draws by insufficient material. AdaChess is a console application without own GUI, but supports the Chess Engine Communication Protocol aka WinBoard/XBoard protocol. Latest version is tagged 2.0 and has been released in August 2014. AdaChess played the IGT 2014, IGT 2015, and IGT 2016 over the board.
Ada Lovelace ^[2]

Forum Posts

AdaChess v2.0 released by Alessandro Iavicoli, CCC, August 16, 2014
AdaChess v2016.11.08-pre released, by Alessandro Iavicoli, CCC, November 08, 2016

External Links

References

^ The announced AdaChess by PreChess author José Lauro Strapasson is confirmed defunct.
^ Ada Lovelace by Margaret Sarah Carpenter, 1836, oil on canvas, Government Art Collection, Ada (Programmiersprache) - Wikipedia.de (German)

What links here?

Page	Date Edited
AdaChess	Nov 8, 2016
Alessandro Iavicoli	Nov 13, 2014
Engines	Mar 10, 2018
IGT 2014	Jul 15, 2017
IGT 2015	Oct 26, 2015
IGT 2016	Nov 23, 2016
IGT 2017	Oct 2, 2017
Tamerlane	May 18, 2017

Up one Level

Alfil

GerdIsenberg — Thu, 03 Sep 2015 21:10:22 GMT

Home * Engines * Alfil

		AlfilChess, (Alfil Chess, Alfil) a chess program by Enrique Sánchez Acosta, written in C++, first incorporated as chess engine of TotalChess 2000, and subsequently since 2001 commercially released as Alfil Chess I and Alfil Chess 2.2 by Hollywood Publishing ^[1]. Alfil has become a free engine under Windows, compliant with UCI, and under Linux, compliant with the Chess Engine Communication Protocol. More recent versions have a parallel search with multiple threads and are able to probe Nalimov Tablebases ^[2], and were ported to Android ^[3].
Alfil for Android ^[4]

C# Engine Project

The C# Engine Project, at first dubbed Alfil 15 and released as open source in 2015, started from Stockfish v5 and various C# ports such as Portfish, and over the time incorporated ideas and knowledge gained from over 10 years of Alfil development, and from other open source engines ^[5]. Alfil 15 was registered for TCEC Season 8, when it was disqualified after its first game versus Pedone, since it could not disable its internal book, not complying with the TCEC rules ^[6]. After that incident, and due to discussions on Alfil's 15 origins in computer chess forums ^[7], the author made these more explicit on September 02, 2015, renamed the program, and invited everyone to collaborate ^[8].

Selected Games

TCEC - Stage 1 - Season 5, Alfil 13.1 - Arasan 16 ^[9]

[Event "TCEC - Stage 1 - Season 5"]
[Site "http://www.tcec-chess.net"]
[Date "2013.09.05"]
[Round "4.16"]
[White "Alfil 13.1"]
[Black "Arasan 16"]
[Result "1/2-1/2"]
 
1.e4 g6 2.d4 Bg7 3.Nc3 d6 4.f4 Nf6 5.Nf3 O-O 6.Bd3 Na6 7.e5 dxe5 8.fxe5
Nd7 9.Na4 c5 10.c3 Rb8 11.Bf4 b5 12.e6 bxa4 13.exd7 Qxd7 14.Bxb8 Nxb8
15.O-O cxd4 16.Nxd4 Bxd4+ 17.cxd4 Qxd4+ 18.Kh1 Be6 19.Rc1 Qxb2 20.Bc4
Bxc4 21.Rxc4 Qxa2 22.Rxa4 Qe6 23.Re1 Qf6 24.Rxa7 Nc6 25.Rc7 Rd8 26.Qf3
Ne5 27.Qxf6 exf6 28.Rc2 Kg7 29.g3 Rd5 30.Kg2 f5 31.Ree2 g5 32.Red2 Rb5
33.Ra2 h6 34.Ra7 f4 35.gxf4 gxf4 36.Ra4 f3+ 37.Kf2 Rb3 38.Rad4 h5 39.h3
Kg6 40.Rd5 Kf5 41.Rd1 f6 42.R5d2 Rb4 43.Rd4 Rb7 44.Rg1 Rb2+ 45.Kg3 Kg5
46.h4+ Kg6 47.Rf4 Rb3 48.Re4 Ng4 49.Rxg4+ hxg4 50.Kxg4 f2 51.Rf1 f5+
52.Kf4 Rb4+ 53.Kf3 Rxh4 54.Rxf2 1/2-1/2

Forum Posts

2007 ...

Alfil 7.5 : 2293 by Patrick Buchmann, CCC, May 20, 2007
Alfil 8 beta 0.4 : 2472 by Patrick Buchmann, CCC, November 01, 2007
Alfil 8.1 : 2464 by Patrick Buchmann, CCC, January 21, 2008
Alfil 8.1.1 SIMD by Tony Thomas, CCC, February 25, 2008

2010 ...

Alfil 11 MT by esacosta, CCC, November 29, 2011
Alfil on FICS by esacosta, CCC, December 15, 2011

2015 ...

Alfil 15.4 C# (beta 17) by Enrique Sánchez, CCC, April 21, 2015
Alfil 15.7 by Enrique Sánchez, CCC, July 12, 2015
Has Alfil 15.8 been withdrawn? by Gabor Szots, CCC, August 29, 2015

External Links

Chess Engine

Misc

Alfil - Wikipedia.es (Spanish)
Alfil (chess) from Wikipedia

References

What links here?

Page	Date Edited
Alfil	Sep 3, 2015
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Enrique Sánchez Acosta	Apr 22, 2015
TCEC Season 5	Jun 2, 2014
TCEC Season 6	Dec 2, 2014
TCEC Season 7	Jan 23, 2015

Up one level

AliBaba

GerdIsenberg — Sun, 17 Aug 2014 09:44:53 GMT

Home * Engines * AliBaba

		AliBaba, an experimental chess engine by Dennis Breuker written for testing various hashing algorithms and replacement schemes as subject of his Ph.D. thesis Memory versus Search in Games ^[1]. With the permission of the author, a modified open source version was made available by Dann Corbit ^[2], later adopted to WinBoard by Jim Ablett ^[3]. AliBaba uses a 16x12 board and applies PVS alpha-beta with late move reductions within the obligatory iterative deepening framework with aspiration windows.
Ali Baba ^[4]

Forum Posts

Alibaba test bed (by Dennis Breuker) by Dann Corbit, CCC, March 28, 2000
Nunn test positions in Alibaba format by Pete Galati, CCC, March 30, 2000
Alibaba (Dennis Breuker - 1995) with winboard support by Jim Ablett, CCC, December 31, 2008

External Links

Chess Engine

Alibaba compiled by Jim Ablett, hosted by Kirill Kryukov

Misc

Ali Baba from Wikipedia
Ali Baba (disambiguation) from Wikipedia
Alibaba Group from Wikipedia
Kraan - Kraan Arabia, 1972, YouTube Video

References

^ Dennis Breuker (1998). Memory versus Search in Games. Ph.D. thesis, Maastricht University, pdf via Dennis Breuker's page
^ Alibaba test bed (by Dennis Breuker) by Dann Corbit, CCC, March 28, 2000
^ Alibaba (Dennis Breuker - 1995) with winboard support by Jim Ablett, CCC, December 31, 2008
^ Ali Baba by Maxfield Parrish, 1909, One Thousand and One Nights, Ali Baba from Wikipedia

What links here?

Page	Date Edited
AliBaba	Aug 17, 2014
Dennis Breuker	Dec 19, 2016
Disney's Aladdin Chess Adventures	May 15, 2014
Engines	Mar 10, 2018
Maastricht University	May 15, 2017

Up one Level

Alice

GerdIsenberg — Wed, 20 May 2015 20:46:41 GMT

Home * Engines * Alice

		Alice, an experimental open source chess engine under the GNU General Public License written by Sven Reichard in C++, compliant with the Chess Engine Communication Protocol. Alice is an object oriented program developed under GCC and Linux. The board is a vector of 64 pointers to pieces, while piece is an abstract class, with intermediate subclasses for common piece properties such as sliding versus none sliding pieces, and finally instantiable subclasses for the concrete pieces, like Pawn, Rook, etc., and "null pieces" for the empty squares ^[1]. Jim Ablett provides recent compiles for 32/64-bit Windows and Linux ^[2].
Alice in Wonderland ^[3]

Bitboards

Alice is an object oriented Bitboard engine, applying Rotated Bitboards to determine sliding piece attacks. Size of of the encapsulated Bitboard class is 8 by unsigned long long number ^[4].

namespace Alice
{
  class BitboardIterator;
  class Bitboard
  {
  public:
    typedef BitboardIterator Iterator;
    Bitboard( unsigned long long n = 0ull);
    ~Bitboard();
    //operator unsigned long long() const;
    Bitboard& operator|=( const Bitboard& b );
    Bitboard& operator&=( const Bitboard& b );
    Bitboard operator~( ) const;
    ...
  private:
    unsigned long long number;
    static std::vector<unsigned long long> setMask;
    static std::vector<unsigned long long> clearMask;
    ...
    static Bitboard fileAttacks[256][64];
    static Bitboard rankAttacks[256][64] ;
    static Bitboard upDiagonalAttacks[256][64];
    static Bitboard downDiagonalAttacks[256][64] ;
    ...
  };
};

Forum Posts

Gestatten: Alice by Sven Reichard, CCC, June 23, 2002
First draw against GnuChess by Sven Reichard, CCC, November 26, 2003
Alice new Winboard engine by Pablo, Winboard Forum, March 18, 2005
Alice: A reintroduction by Sven Reichard, CCC, July 15, 2011
Sorry guys, I have to ask for another engine: Alice by Arturo Ochoa, CCC, December 03, 2012

External Links

Chess Engine

Index of /chess/engines/Jim Ablett/ALICE by Jim Ablett, hosted by Kirill Kryukov

Misc

References

^ Re: Gestatten: Alice by Sven Reichard, CCC, June 25, 2002
^ Re: Sorry guys, I have to ask for another engine: Alice by Jim Ablett, CCC, December 08, 2012
^ Jessie Willcox Smith's illustration of Alice surrounded by the characters of Wonderland. (1923), Alice's Adventures in Wonderland from Wikipedia
^ Index of /chess/engines/Jim Ablett/ALICE by Jim Ablett, hosted by Kirill Kryukov, Src/include/Bitboard.h
^ Lewis Carroll's diagram of the story as a chess game, Through the Looking-Glass - Chess
^ Glen Robert Downey (1998). The Truth About Pawn Promotion: The Development of the Chess Motif in Victorian Fiction. Ph.D. thesis, University of Victoria pdf » Promotions
^ Lewis Carroll's chess problem | ChessVibes, July 14, 2008

What links here?

Page	Date Edited
Alice	May 20, 2015
Arturo Ochoa	May 4, 2017
Engines	Mar 10, 2018
iCE	Jan 4, 2016
La Dame Blanche	Oct 15, 2015
Mathematician	Apr 9, 2018
Promotions	Jun 6, 2017
RedQueen	Nov 13, 2017
Sven Reichard	Dec 28, 2016
Traversing Subsets of a Set	Oct 14, 2016

Up one Level

Amoeba

GerdIsenberg — Mon, 19 Mar 2018 08:00:37 GMT

Home * Engines * Amoeba

		Amoeba, an UCI compliant open source chess engine by Richard Delorme, written in D language, first released in May 2016 ^[1], licensed under the GPL v3.0. Amoeba uses the Nelder–Mead method ^[2] or downhill simplex method ^[3] to tune its evaluation parameters, also called amoeba method and eponym of the program ^[4].
Amoeba search of Simionescu function ^[5]

Features

^[6]

Board Representation

Search

Iterative Deepening
Aspiration Windows (improved in 2.6)
Principal Variation Search
Transposition Table (improved in 2.6)
Quiescence Search
Internal Iterative Deepening
Static Exchange Evaluation (SEE pruning improved in 2.6)
Check Extensions
Null Move Pruning
Reverse Futility Pruning
Razoring
Mate Distance Pruning
Late Move Reductions (improved in 2.6)

Evaluation

Tapered Eval
Lazy Evaluation
Mobility
Pawn Structure
Tempo
Automated Tuning using Nelder–Mead method aka Amoeba method

Tournament Manager

With the release of Amoeba 2.1, the code of a tournament manager was published also written in D language, used to validate or reject Amoeba changes ^[7]. So far only with fixed time per move, it

can use various openings from pgn file
can play several games in parallel
can set H0 & H1 hypothesis for SPRT ^[8]
can saves played game to a pgn file

Forum Posts

2016

amoeba a new UCI engine by Richard Delorme, CCC, May 20, 2016
Amoeba 1.3 released by Richard Delorme, CCC, August 03, 2016
Amoeba 2.0 by Richard Delorme, CCC, November 27, 2016

2017

amoeba 2.1 by Richard Delorme, CCC, January 24, 2017
sprt tourney manager by Richard Delorme, CCC, January 24, 2017 » Amoeba Tournament Manager, SPRT
amoeba 2.2 released by Günther Simon, CCC, March 03, 2017
Amoeba 2.4 by Richard Delorme, CCC, April 19, 2017
Amoeba 2.5 by Richard Delorme, CCC, June 07, 2017
Amoeba 2.6 by Richard Delorme, CCC, September 22, 2017
Amoeba 2.7 by Richard Delorme, CCC, December 11, 2017

2018

Amoeba 2.8 by Richard Delorme, CCC, March 18, 2018

External Links

Chess Engine

Misc

References

^ amoeba a new UCI engine by Richard Delorme, CCC, May 20, 2016
^ John Nelder, Roger Mead (1965). A Simplex Method for Function Minimization. The Computer Journal, Vol. 7, No. 4, doi:10.1093/comjnl/7.4.308
^ Margaret H. Wright (2012). Nelder, Mead, and the Other Simplex Method. Documenta Mathematica, Extra Volume Optimization Stories, pdf
^ amoeba/README.md at master · abulmo/amoeba · GitHub
^ Animated Nelder-Mead minimum search of Simionescu function, by Pasimi, November 22, 2016, CC BY-SA 4.0, Wikimedia Commons
^ Features as mentioned in amoeba/README.md at master · abulmo/amoeba · GitHub
^ sprt tourney manager by Richard Delorme, CCC, January 24, 2017
^ The SPRT without draw model, elo model or whatever... by Michel Van den Bergh, CCC, September 01, 2015

What links here?

Page	Date Edited
Amoeba	Mar 19, 2018
Automated Tuning	Feb 27, 2018
Cutechess-cli	Jan 6, 2018
Dumb	Mar 10, 2018
Engine releases	Apr 23, 2018
Engine Testing	Feb 1, 2018
Engines	Mar 10, 2018
LittleBlitzer	Jan 24, 2017
Match Statistics	Mar 31, 2018
Richard Delorme	Sep 30, 2017
Tournaments	Dec 21, 2017

Up one Level

Amundsen

GerdIsenberg — Tue, 03 Sep 2013 19:09:31 GMT

Home * Engines * Amundsen

		Amundsen, (Jonte) a Chess Engine Communication Protocol compliant open source chess engine under the GNU General Public License, written in C by John Bergbom. Started as college course project at the Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm ^[1], a name change from Jonte to Amundsen took place between version 0.25 and 0.3, since the initial name was already used at FICS ^[2]. Amundsen was first released in May 2004, as announced by Dann Corbit in Winboard Forum ^[3]. Victory awaits him, who has everything in order. Luck we call it. Defeat is definitely due for him, who has neglected to take the necessary precautions. Bad luck we call it. Roald Amundsen ^[4]
Amundsen at wheel of the Maud ^[5]

Description

Bitboard Infrastructure

Description

Bitboard Infrastructure

Rotated Bitboards

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

BitScan & PopCount

The memory bacchanal is attended by population count, bitscan forward and reverse with three 16-bit indexed, 64K lookup tables of double word integers, which is another 3/4 MiB ^[6].

int bits_in_16bits[65536];
int first_bit_in_16bits[65536];
int last_bit_in_16bits[65536];
 
/* This function returns the number of the first set bit in an int64.
   The search is done from LSB to MSB. */
int get_first_bitpos(int64 n) {
  if (first_bit_in_16bits[n & 0xffff] >= 0)
    return first_bit_in_16bits[n & 0xffff];
  if (first_bit_in_16bits[(n >> 16) & 0xffff] >= 0)
    return first_bit_in_16bits[(n >> 16) & 0xffff] + 16;
  if (first_bit_in_16bits[(n >> 32) & 0xffff] >= 0)
    return first_bit_in_16bits[(n >> 32) & 0xffff] + 32;
  if (first_bit_in_16bits[(n >> 48) & 0xffff] >= 0)
    return first_bit_in_16bits[(n >> 48) & 0xffff] + 48;
  return -1;
}

Search

The search is PVS alpha-beta with transposition and refutation table inside an iterative deepening framework with aspiration windows, further using AEL-pruning à la Heinz, as well as LMR and IID in case of a missing hash move at PV-nodes. Checks, pawn moves to the 7th rank, and mate threatening moves are extended, killer- and history heuristic help to order moves, and a SEE swap routine is used to determine winning captures.

Evaluation

Amundsen's evaluation with a pawn structure cache features piece-square tables, and further considers mobility, passed pawns and hidden passed pawns, king safety through king piece tropism, and various features and defects such as outposts, rook on open file, seventh rank and behind passers, and bad bishop to name a few, and knows to trade pieces when ahead, but pawns when behind.

Publications

John Bergbom (2004). Schackprogrammet Amundsen. (2D1464 Större avancerad individuell kurs i datalogi) pdf (Swedish) ^[7]

Forum Posts

A new chess program by Dann Corbit, Winboard Forum, May 22, 2004
Amundsen 0.3 and his book : problem ? by Claude Dubois, Winboard Forum, May 24, 2004
Amundsen 0.35 exe by Jim Ablett, Winboard Forum, August 25, 2004
Amundsen 05 Windows binaries by Jim Ablett, Winboard Forum, September 14, 2005
Amundsen 0.65 (released on January 11th 2008) by Denis P. Mendoza, Winboard Forum, January 15, 2008
Amundsen 0.65.1 Windows builds available by Jim Ablett, Winboard Forum, February 23, 2008
Amundsen_075JA with illegal moves by Günther Simon, Winboard Forum, January 18, 2009

External Links

Chess Engine

Misc

References

^ Master of Science - Nada, KTH
^ Amundsen chess program
^ A new chess program by Dann Corbit, Winboard Forum, May 22, 2004
^ Fram Museum - Polar Expeditions
^ Captain Roald Amundsen at wheel leaving Nome for North Pole, 1920, Source:Roald Amundsen from Wikipedia, Library of Congress | digital ID cph 3c21515, Lomen Bros
^ amundsen-0.80.tar.gz, bitboards.c
^ Amundsen chess program (old page)

What links here?

Page	Date Edited
Amundsen	Sep 3, 2013
BitScan	Sep 10, 2017
Delphil	Sep 17, 2016
Denis Mendoza	Mar 16, 2013
Engines	Mar 10, 2018
John Bergbom	Feb 14, 2013
PolarChess	May 15, 2017
Prophet	Sep 30, 2017
Siberian Chess	Feb 27, 2017
Test-Positions	Feb 25, 2018

Up one level

Amy

GerdIsenberg — Tue, 09 May 2017 20:47:04 GMT

Home * Engines * Amy

		Amy, a Chess Engine Communication Protocol aka XBoard compliant open source chess program under the GNU General Public License by Thorsten Greiner, written in C. Its development already started in 1993 on the Amiga ^[1], and continued on UNIX platforms, in particular FreeBSD ^[2]. Amy 0,6 was ported to Windows for Winboard by Dann Corbit in early 2000 ^[3]. Amy applies ABDADA ^[4] inside a NegaScout framework ^[5] as parallel search algorithm, further using fractional ply extensions aka the SEX Algorithm , Null Move Pruning, and Extended Futility Pruning . Amy played the WMCCC 1995 in Paderborn and various International Paderborn Computer Chess Championships.
The Seal of Amy ^[6]

Forum Posts

2000

Amy-0.6 released by Thorsten Greiner, CCC, February 04, 2000
Amy 0,6 für Winboard by Dann Corbit, Winboard Forum, February 05, 2000
Re: Amy and Isi at Paderborn? =( by Thorsten Greiner, CCC, February 14, 2000
Amy-0.7 released by Thorsten Greiner, CCC, March 22, 2000
Amy play very strong in my FQ-2 tournament ! by Frank Quisinsky, Winboard Forum, April 20, 2000
Re: Amy play very strong in my FQ-2 tournament ! by Thorsten Greiner, Winboard Forum, April 25, 2000
Amy Source Code Is Outstanding Re: Quality source code by Brian Richardson, CCC, November 21, 2000

2002 ...

Great news from Thorsten Greiner: New Amy v0.8!! by Leo Dijksman, Winboard Forum, July 24, 2002
Amy 0.8 by Jonas Cohonas, CCC, July 28, 2002
Amy 0.8.1 by Thorsten Greiner, Winboard Forum, July 29, 2002
Amy 0.8.4 by Thorsten Greiner, Winboard Forum, June 23, 2003
Amy 0.8 mp x64 Windows build available by Jim Ablett, CCC, December 31, 2007

2010 ...

Comet B15, Amy 0.6 Green Light Chess 2.07a available ... by Frank Quisinsky, CCC, February 04, 2010 » Comet, Green Light Chess

External Links

Chess Engine

Amy's ICGA Tournaments
tgreiner.net - Thorsten's Nifty Geeklog Site, archive.org
Download Amy 0.8.7, archive.org
Amy compiled by Jim Ablett, hosted by Kirill Kryukov
Amy - a chess program for playing and analyzing games from The FreeBSD Ports Archive
Amy 0.87b in CCRL 40/40

Misc

Demonology

References

^ Re: Amy play very strong in my FQ-2 tournament ! by Thorsten Greiner, Winboard Forum, April 25, 2000
^ Amy - a chess program for playing and analyzing games from The FreeBSD Ports Archive
^ Amy 0,6 für Winboard by Dann Corbit, Winboard Forum, February 05, 2000
^ Re: Deep Sjeng testers wanted by Gian-Carlo Pascutto, CCC, August 29, 2002
^ Something interesting about Amy by Dann Corbit, CCC, February 05, 2000
^ Amy from Demonology by Joan De La Haye
^ The demon Bael from Collin de Plancy's Dictionnaire Infernal, 1862

What links here?

Page	Date Edited
Amy	May 9, 2017
Amyan	Dec 10, 2013
Comet	Jan 8, 2016
Deep Sjeng	Jan 7, 2016
Eigenmann Endgame Test	Jun 1, 2017
Engines	Mar 10, 2018
Green Light Chess	Jan 21, 2018
IPCCC 1994	Jul 31, 2013
IPCCC 1997	Aug 24, 2013
IPCCC 1998	Feb 25, 2018
IPCCC 2000	Dec 21, 2012
Monsoon	Feb 8, 2015
Pseudorandom number generator	May 11, 2017
Steve Timson	Feb 2, 2013
Thorsten Greiner	May 9, 2017
Typhoon	Apr 18, 2016
WMCCC 1995	Jan 3, 2018

Up one level

Android-Chess

GerdIsenberg — Thu, 02 Jun 2016 13:48:24 GMT

Home * Engines * Android-Chess

		Android-Chess, an open source chess application for Android, written by Jeroen Carolus, released under the MIT License. Android-Chess consists of a Java chess GUI and an engine. The engine was initially written in Java for Jeroen's pruning research and M.Sc. thesis ^[1], and has been ported to C++ and communicates with the GUI via JNI.
Android-Chess ^[2]

Description

Android-Chess is a bitboard engine using rotated bitboards to determine sliding piece attacks, and does not take advantage of the outer square optimization using an 8-bit occupied index with four lookup tables of 256*64*8 or 128 KiB each, thus 1/2 MiB in total. Alpha-beta is embedded inside an iterative deepening loop without aspiration. Evaluation considers material and various pawn structure and piece terms.

External Links

References

^ Jeroen Carolus (2006). Alpha-Beta with Sibling Prediction Pruning in Chess. Master's thesis, pdf
^ andriod-Chess

What links here?

Page	Date Edited
Android-Chess	Jun 2, 2016
Engines	Mar 10, 2018
Jeroen Carolus	Jun 2, 2016
Mathematician	Apr 9, 2018

Up one Level

APIL chess

GerdIsenberg — Sun, 17 May 2015 20:37:31 GMT

Home * Engines * APIL chess

APIL chess, (APILchess - Asynchronous Process Interaction Library chess)
an open source distributed chess program for educational purposes and private use written by Ulf Lorenz and first published in July 2002 ^[1]. APILchess represents the board using a 16x12 mailbox array with 16-bit disjoint piece flag encoding, and piece-lists. There are traces (Hydra.h), that the Asynchronous Process Interaction Library was already used for early Hydra trials.

Download

APILchess.tar

External Links

Other - Ulf Lorenz - Fachbereich Mathematik - Technische Universität Darmstadt (dead APILchess Software links)
Index of /chess/engines/Jim Ablett/APILCHESS compiled by Jim Ablett, hosted by Kirill Kryukov
APILChess 1.05r1b in CCRL 40/4

References

^ Other - Ulf Lorenz - Fachbereich Mathematik - Technische Universität Darmstadt (dead APILchess Software links)

What links here?

Page	Date Edited
APIL chess	May 17, 2015
Engines	Mar 10, 2018
Parallel Search	Dec 30, 2017
Ulf Lorenz	Dec 22, 2016
University of Paderborn	Aug 17, 2014

Up one Level

Arasan

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

Home * Engines * Arasan

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

Bitboard Trials

Jon Dart, May 1996 ^[7]

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

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

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

Magic Bitboards

Jon Dart, August 2008 ^[8] :

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

PEXT/PDEP Bitboards

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

Automated Tuning

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

Tournament Play

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

Photos & Games

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

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

Forum Posts

1995 ...

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

2000 ...

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

2005 ...

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

2010 ...

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

2011

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

2012

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

2013

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

2014

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

2015 ...

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

2016

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

2017

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

2018

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

External Links

Chess Engine

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

Misc

References

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

What links here?

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

Up one Level

asmFish

GerdIsenberg — Wed, 14 Feb 2018 19:45:35 GMT

Home * Engines * Stockfish * asmFish

		asmFish, a port of Stockfish in x86-64 assembly by Mohammed Li, optional using AVX2 and BMI2 instructions, assembled with FASM to run under Windows or UNIX/Linux, first released in June 2016. The fun project is about to demonstrate how an experienced assembly programmer can optimize a program compared with GCC ^[1] . A few structural optimizations were also applied, such as elimination of piece lists as already tried in Stockfish ^[2] . Critical functions in asmFish do not conform to the x86-64 ABI concerning register usage and calling convention ^[3]. Some less time critical code was ported using GCC generated assembly output, such as Ronald de Man's probing code for Syzygy Bases. asmFish further supports large pages, and its parallel search is numa aware ^[4] ^[5] .
Istiophorus platypterus, one of the world's fastest fish ^[6]

Forum Posts

2015

[for fun] rewrite of stockfish into asm and question on source by Mohammed Li, FishCooking, January 09, 2015
Re: [for fun] rewrite of stockfish into asm and question on source by Mohammed Li, FishCooking, April 18, 2016

2016

new humanistic compile of SF is 108KB by Mohammed Li, FishCooking, May 28, 2016
Re: Speedup and simplicity idea by Mohammed Li, FishCooking, June 28, 2016
ASM Fish for Linux and Windows by Norbert Raimund Leisner, CCC, July 26, 2016
asmFish 44 cores by A. Turkoglu, FishCooking, August 28, 2016
Scaling of Asmfish with large thread count by Dann Corbit, CCC, October 07, 2016 » Parallel Search
New asmFish released by Stefan Pohl, CCC, November 04, 2016

2017 ...

Reaching Lyudmil Antonov by Art Ford, CCC, January 23, 2017
asmfish_macOS_11082017 by Michael B, CCC, November 08, 2017
asmFish update - all flavors of OS by Michael B, CCC, January 20, 2018
Re: asmFish update - all flavors of OS by T. Poppins, CCC, January 23, 2018
New asmfish by Günther Simon, CCC, February 12, 2018

External Links

Chess Engine

Misc

Yes - We Have Heaven, Long Distance Runaround, The Fish (Schindleria Praematurus), Album Fragile (1971), YouTube Video

References

^ Re: [for fun] rewrite of stockfish into asm and question on source by Mohammed Li, FishCooking, April 18, 2016
^ removal of piece lists by Mohammed Li, FishCooking, November 11, 2014
^ Agner Fog's manuals
^ asm/readme.txt at master · tthsqe12/asm · GitHub
^ lets get the ball moving down the field on numa awareness by Mohammed Li, FishCooking, August 30, 2016
^ Istiophorus platypterus, Image by Citron, March 2010, CC BY-SA 3.0, Wikimedia Commons, Sailfish from Wikipedia, Indo-Pacific sailfish from Wikipedia

What links here?

Page	Date Edited
asmFish	Feb 14, 2018
Assembly	Sep 3, 2017
CFish	Feb 1, 2018
Engines	Mar 10, 2018
Lyudmil Antonov	Aug 31, 2017
Memory	Dec 8, 2017
Parallel Search	Dec 30, 2017
Portfish	Sep 8, 2016
Stockfish	Apr 7, 2018
x86-64	Mar 6, 2018

Up one Level

Bagatur

GerdIsenberg — Sat, 10 Sep 2016 21:15:53 GMT

Home * Engines * Bagatur

		Bagatur, a free open source chess program under the Eclipse Public License ^[1] written in Java by Krasimir Topchiyski from Bulgaria. The project has started around year 2000. The engine is quite strong, for example the ELO of version 1.4d is about 2500 based on CCRL ^[2] . The open source project is hosted at GitHub ^[3] , where one can find everything relevant like downloads and java source code of the program. Under Windows and Linux the program hasn't its own user interface and uses arbitrary UCI user interfaces like Arena. Under Android there is a game called Chess Art For Kids ^[4] with an own GUI, which incorporates Bagatur as a chess engine.
One of Bagatur's Logos

Etymology

Technical Information

Etymology

Bagatur (βαγατουρ or βογοτορ) is a higher rank of proto-Bulgarian warrior. According to some authors the word comes from Turkic (bagadur) and literally means brave, brave man. According to the same in the Russian language will pass as Богатыри - hero.

Technical Information

The programming code is structured in multiple Java modules / APIs, which could be used separately, including modules for experiments with Artificial Intelligence and Machine Learning. More details could be found inside the readme files of each sub-project of the programming code ^[5]. Here are some of the algorithms and heuristics applied in Bagatur:

Selectivity

Tables

Misc
- Board Representation - mix between Arrays and Bitboards
- Opening Book
- Gaviota endgame tablebases

Forum Posts

BagaturChess -an interesting chess engine by Ruxy Sylwyka, CCC, August 11, 2011
BagaturChess 1.2c (Java) by Krasimir Topchiyski by Ruxy Sylwyka, CCC, December 04, 2011
Check Latest Bagatur Version! by George Speight, CCC, September 15, 2012

External Links

Chess Engine

Misc

References

What links here?

Page	Date Edited
Bagatur	Sep 10, 2016
Chess Art For Kids	Sep 13, 2016
Engines	Mar 10, 2018
Krasimir Topchiyski	Sep 9, 2016

Up one Level

Barbarossa

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

Home * Engines * Barbarossa

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

Forum Posts

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

External Links

Chess Engine

Misc

References

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

What links here?

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

Up one level

BBChess (SI)

GerdIsenberg — Mon, 12 Jan 2015 21:08:34 GMT

Differential Evolution

Home * Engines * BBChess (SI)

BBChess,
a free open source engine licensed under the GNU General Public License, written in ANSI C by Borko Bošković starting in 2005. BBChess is Chess Engine Communication Protocol compatible and can be compiled for Linux and Windows. It performs a parallel search using threads, PVS, and determines sliding piece attacks with magic bitboards.

Differential Evolution

BBChess' was further object of research in genetic programming at Computer Architecture and Languages Laboratory ^[1], Institute of Computer Science ^[2] at University of Maribor, its evaluation was tuned by Differential Evolution (DE), also topic of Bošković's Ph.D. thesis ^[3] ^[4]:

The DE algorithm employs mutation and cross-over operations to generate new individuals and selection operation to select individuals that will survive into next generation. Before selection operation is employed, individuals have to be evaluated. In our case individuals are evaluated according to the games they have played. Therefore individuals play a specific number of games in each generation and individuals with greater efficiency survive into the next generation...

With the proposed tuning approach, we tuned the chess evaluation function of BBChess chess program. Tuning was done with and without expert knowledge. When we tuned the parameters without expert knowledge, because the search space was huge, we tuned only a few parameters. After 500 generations of the evolutionary process, the value of parameters convergence to the values that relationship were approximately equal as known from the chess theory. When we tuned the parameter values with expert knowledge, the tuning intervals of parameter values were set around the approximate values and the number of tuned parameters was 190. The obtained results show that, our approach was successful.

Namesake

BBchess by Bernard Brioit

Publications

Borko Bošković, Sašo Greiner, Janez Brest, Viljem Žumer (2006). A Differential Evolution for the Tuning of a Chess Evaluation Function. IEEE Congress on Evolutionary Computation, 2006
Borko Bošković, Sašo Greiner, Janez Brest, Viljem Žumer (2007). Uglaševanje šahovskega programa BBChess z uporabo algoritma diferencialne evolucije. Zbornik šestnajste mednarodne Elektrotehniške in računalniške konference ERK (Slovenian)
Borko Bošković, Sašo Greiner, Janez Brest, Aleš Zamuda, Viljem Žumer (2008). An Adaptive Differential Evolution Algorithm with Opposition-Based Mechanisms, Applied to the Tuning of a Chess Program. Advances in Differential Evolution, Studies in Computational Intelligence, ISBN: 978-3-540-68827-3
Borko Bošković (2010). Differential Evolution for the Tuning of a Chess Evaluation Function. Ph.D. thesis, University of Maribor
Borko Bošković, Janez Brest (2011). Tuning Chess Evaluation Function Parameters using Differential Evolution. Algorithm. Informatica, 35, No. 2, pdf
Borko Bošković, Janez Brest, Aleš Zamuda, Sašo Greiner, Viljem Žumer (2011). History mechanism supported differential evolution for chess evaluation function tuning. Soft Computing, Vol. 15, No. 4

Forum Posts

BBChess 1.2 : 2296 by Patrick Buchmann, CCC, September 21, 2007
BBChess 1.2a : 2287 by Patrick Buchmann, CCC, October 10, 2007
BBChess 1.3a : 2309 by Patrick Buchmann, CCC, March 02, 2008
BBChess 1.3b : 2384 by Patrick Buchmann, CCC, Januray 17, 2009

External Links

Chess program BBChess - Computer Architecture and Languages Laboratory, University of Maribor
BBChess 1.3b in CCRL 40/40
BBChess 1.3b 64-bit 2CPU in CCRL 40/4
Black Stone Raiders - live at Festival Lent, Maribor, June 26, 2011, YouTube Video
Jean-Paul Bourelly, Darryl Jones, Will Calhoun

References

^ Computer Architecture and Languages Laboratory
^ Institute of Computer Science
^ Borko Bošković (2010). Differential Evolution for the Tuning of a Chess Evaluation Function. Ph.D. thesis, University of Maribor
^ Borko Bošković, Janez Brest (2011). Tuning Chess Evaluation Function Parameters using Differential Evolution. Algorithm. Informatica, 35, No. 2, pdf

What links here?

Page	Date Edited
BB	Jan 8, 2016
BBchess	Oct 30, 2011
BBChess (SI)	Jan 12, 2015
Borko Bošković	May 23, 2016
Engines	Mar 10, 2018
Genetic Programming	Dec 26, 2017
MinkoChess	Sep 5, 2013
University of Maribor	Nov 10, 2016

Up one Level

Beaches

GerdIsenberg — Sat, 10 Jun 2017 07:36:50 GMT

Home * Engines * Beaches

		Beaches, (BeachesChess) a Winboard compliant chess engine by Robert Pope, written in C++, first mentioned and hosted by Benny Antonsson in 2002 ^[1]. The later published source code with version history from 2006 til 2010 ^[2] refers a bitboard engine - despite processing many of them per node, using 8-bit occupied state rotated bitboard lookups for sliding pieces - the control structure of the legal move generator and evaluation reminds more on a mailbox approach without piece list. Search is plain alpha-beta with transposition table, null move pruning and fractional ply decrements with an conventional evaluation, taking material and piece-square tables along with some pawn structure and king safety terms into account, as well the population of ored aggregated attacks per side.
Chess at the Beach ^[3]

Forum Posts

2002 ...

New WinBoard compatible engine - Beaches 0.96 by Robert Pope by Benny Antonsson, Winboard Forum, July 16, 2002
New WinBoard compatible engine - Beaches 0.96 by Robert Pope by Benny Antonsson, CCC, July 16, 2002
New version of Beaches by Benny Antonsson, Winboard Forum, September 04, 2002
BeaChes 1.2 by Benny Antonsson, Winboard Forum, October 03, 2002
Beaches 1.5 download by Robert Pope, Winboard Forum, January 22, 2003

2005 ...

Beaches playing random moves by Olivier Deville, Winboard Forum, May 05, 2005
make/unmake by Robert Pope, Winboard Forum, April 08, 2006 » Unmake Move
WAC 109 by Robert Pope, Winboard Forum, June 17, 2008 » Win at Chess
0x88 engines by Robert Pope, CCC, May 01, 2009

2010 ...

Missing checkmates by Robert Pope, Winboard Forum, October 28, 2010
Beaches 1.20 by Robert Pope, CCC, September 21, 2015

External Links

Chess Engine

BeachesChess
Beaches compiled by Jim Ablett, hosted by Kirill Kryukov
Beaches 2.32 in CCRL 40/4

Misc

References

^ New WinBoard compatible engine - Beaches 0.96 by Robert Pope by Benny Antonsson, Winboard Forum, July 16, 2002
^ BeachesChess, Here is the source code of a slightly later version of Beaches (2.32)
^ Anything goes in Santa Monica - strenuous upper arm workouts, playing on swings, or brain workouts in the form of chess matches, source: Muscle Beach and Chess Beach, Santa Monica, Image by InSapphoWeTrust, June 18, 2011, CC BY-SA 2.0, Wikimedia Commons

What links here?

Page	Date Edited
Abbess	Jun 10, 2017
Beaches	Jun 10, 2017
Engines	Mar 10, 2018
Robert Pope	Jun 10, 2017
Unmake Move	Jun 10, 2017
Win at Chess	Sep 25, 2017

Up one Level

Belofte

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

Home * Engines * Belofte

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

Features

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

History

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

Rating

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

Forum Posts

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

External links

References

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

What links here?

Page	Date Edited
Engines	Mar 10, 2018

Up one level

Belzebub

GerdIsenberg — Tue, 20 Oct 2015 17:35:12 GMT

Home * Engines * Belzebub

		Belzebub, a WinBoard compliant open source chess engine written by Radosław Kamowski in Java, released in May 2002 as free chess game for mobile phones ^[1] ^[2]. Belzebub played the first and second Polish Computer Chess Championship. After finishing last at the PCCC 2002, Belzebub became runner-up of the uniform category at the PCCC 2003 behind Tytan.
Beelzebub ^[3]

Etymology

Belzebub is the Polish diction of Beelzebub or Baalzebûb, Arabic: بعل الذباب‎, Ba‘al az-Zubab, literally "Lord of the Flies", a Semitic deity that was worshiped in the Philistine city of Ekron. In later Christian and Biblical sources, Beelzebub is referred to as another name for Devil ^[4] ^[5] ^[6]. In Christian demonology, classified by Peter Binsfeld in Tractatus de confessionibus maleficorum & Sagarum an et quanta fides iis adhibenda sit, 1589 ^[7], Beelzebub is one of the seven Princes of Hell ^[8] associated with gluttony, one of the seven deadly sins. Gluttony also occurs in chess ^[9] or even more in computer chess with basically material based evaluation, i.e. grabbing unimportant pawns with the queen, ignoring development and king safety.

Description

Search

Belzebub uses plain 8x8 board arrays, and applies alpha-beta with null move pruning inside an iterative deepening framework with aspiration windows. Move ordering considers the principal variation from previous iteration maintained in a triangular PV-table, MVV-LVA for captures and killer- and history heuristic otherwise.

Repetitions

Like TSCP, Belzebub uses following algorithm to detect repetitions, credited to John Stanback, originated from SCP and his GNU Chess versions ^[10]. However, it may detect false repetitions in case of exchanging two unequal pieces ^[11]. Further, the routine keeps the garbage collector busy by allocating the integer array each call, even if the fifty move counter is less or equal three.

/* reps() returns the number of times that the current
   position has been repeated. Thanks to John Stanback
   for this clever algorithm. */
int reps() {
   int i;
   int b[] = new int[64];
   int c = 0;
   /* count of squares that are different from
     the current position */
   int r = 0; /* number of repetitions */
   /* is a repetition impossible? */
   if (fifty <= 3) {
      return 0;
   }
 
   /* loop through the reversible moves */
   int m = hply - fifty - 1;
   if (m < 0) {
      m = 0;
   } // gdy gra jest wznawiana to tablica hist jest pusta
   for (i = hply - 1; i >= m; --i) {
      if (++b[hist_from[i]] == 0) {
         --c;
      } else {
         ++c;
      }
      if (--b[hist_to[i]] == 0) {
         --c;
      } else {
         ++c;
      }
      if (c == 0) {
         ++r;
      }
   }
   return r;
}

Selected Games

PCCC 2003 - Belzebub - Robin ^[12]

[Event "PCCC 2003"]
[Site " Łódź, Poland"]
[Date "2003.08.?"]
[Round "?"]
[White "Belzebub"]
[Black "Robin"]
[Result "1-0"]
 
1.Nf3 Nf6 2.e3 e6 3.Bb5 Be7 4.d4 O-O 5.O-O d5 6.Re1 Bd7 7.Bd3 c5 8.Bd2 Nc6 
9.Nc3 Rc8 10.Bb5 Ne4 11.a4 Nxd2 12.Qxd2 cxd4 13.exd4 Bb4 14.Re3 Qa5 15.Qd1 
a6 16.Bxc6 Bxc6 17.Ne2 Be8 18.c3 Be7 19.b3 Bd8 20.Re5 Bd7 21.Rh5 f6 22.Qc2 
g6 23.Rh6 Re8 24.Nh4 Kg7 25.Rxh7+ Kxh7 26.Qxg6+ Kh8 27.Qf7 Rg8 28.Nf4 Rg7 
29.Nhg6+ Kh7 30.Nf8+ Kh8 31.N4g6+ Rxg6 32.Nxg6# 1-0

External Links

Chess Engine

Demonology

Misc

References

^ Chess Mobile by Grzegorz Sidorowicz, May 27, 2002
^ chess.no-fate.ru - Mobile java chess download - szachy.zip src/engine.java
^ Beelzebub as depicted in Collin de Plancy's Dictionnaire Infernal (Paris, 1863)
^ Catholic Encyclopedia: Beelzebub
^ New Advent Bible: Matthew 12:24-29
^ New Advent Bible: Luke 11:15-22
^ historicum.net: Traktate: Binsfeld (Themenschwerpunkt Hexenverfolgung)
^ Beelzebub from Wikipedia
^ Reykjavik Open 2013. Fifth round. The advantages of communing with nature | WhyChess
^ Re: Detecting three-fold repetition? by John Stanback, CCC, July 17, 2000
^ Re: Move Tables - explain as if I'm five by Karlo Bala Jr., CCC, November 05, 2012
^ II Mistrzostwa Polski Programów Szachowych - PGN
^ The demon Bael from Collin de Plancy's Dictionnaire Infernal, 1862

What links here?

Page	Date Edited
Armageddon	Jan 24, 2014
Belzebub	Oct 20, 2015
Engines	Mar 10, 2018
Karlo Bala Jr.	Feb 19, 2017
PCCC 2002	Mar 14, 2013
PCCC 2003	Mar 13, 2013
Radosław Kamowski	Mar 16, 2013
Repetitions	Jan 16, 2018
SCP	Jun 16, 2016
TSCP	Feb 5, 2016

Up one Level

Beowulf

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

Home * Engines * Beowulf

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

Features

^[4]

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

Forum Posts

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

External Links

Chess Engine

Misc

References

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

What links here?

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

Up one Level

Betsabe

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

Home * Engines * Betsabe

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

Description

Board Representation

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

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

Search

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

Evaluation

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

Selected Games

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

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

Forum Posts

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

External Links

Chess Engine

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

Misc

References

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

What links here?

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

Up one level

Wikispaces : chessprogramming - items matching description

Abulafia

Table of Contents

See also

Forum Posts

External Links

Chess Engine

Misc

References

What links here?

AdaChess

Table of Contents

Forum Posts

External Links

References

What links here?

Alfil

Table of Contents

C# Engine Project

Selected Games

See also

Forum Posts

2007 ...

2010 ...

2015 ...

External Links

Chess Engine

Misc

References

What links here?

AliBaba

Table of Contents

See also

Forum Posts

External Links

Chess Engine

Misc

References

What links here?

Alice

Table of Contents

Bitboards

See also

Forum Posts

External Links

Chess Engine

Misc

References

What links here?

Amoeba

Table of Contents

Features

Board Representation

Search

Evaluation

Tournament Manager

See also

Forum Posts

2016

2017

2018

External Links

Chess Engine

Misc

References

What links here?

Amundsen

Table of Contents

Description

Bitboard Infrastructure

Rotated Bitboards

BitScan & PopCount

Search

Evaluation

See also

Publications

Forum Posts

External Links

Chess Engine

Misc