Wikispaces : chessprogramming - items matching description

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

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]

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

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

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

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

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

Bison

GerdIsenberg — Thu, 29 Sep 2016 14:18:44 GMT

Home * Engines * Bison

		Bison, an UCI compliant open source chess engine by Ivan Bonkin, written in C++ and licensed under GPLv3. Bison played the CCCCISC 2008 over the board. Whether Bison is merely a rewrite of the Fruit concepts, using bitboards instead of vector attack arrays, as suggested by Dann Corbit ^[1], might be subject of scientific research - opposed to the Rybka Controversy, both sources are freely availably ^[2] ^[3].
American Bison ^[4]

Description

Board Representation

Bison is a bitboard engine and uses rotated bitboards to determine sliding piece attacks. It performs the 2x32-bit SWAR-implementation to count populations, and De Bruijn multiplication to scan bits forward in bitboard serialization.

Search

Bison applies PVS alpha-beta with transposition table, null move pruning with zugzwang verification search, razoring, IID, futility-, history-, delta- and mate distance pruning, LMR and various extensions inside an iterative deepening framework with aspiration windows and floating point fractional ply depths. SEE is used in move ordering and to determine winning tactical moves in quiescence.

Evaluation

Evaluation is sped up by pre-initialized material-tables indexed à la Strelka and a pawn hash table and might be lazy. It otherwise takes pawn structure, mobility considering pinned pieces and king piece tropism and various pattern and attacks under account with focus on king safety and passed pawns, speculatively aggregating middle- and endgame scores, which were tapered by a range of 24 game phases.

Selected Games

CCCCISC 2008, round 3, Bison - Counter ^[5]

[Event "CIS 2008"]
[Site "Moscow SDCHESS RGSU"]
[Date "2008.03.01"]
[Round "3"]
[White "Bison 8.2.4r"]
[Black "Counter 0.8"]
[Result "1/2-1/2"]
 
1.Nf3 d5 2.d4 Nf6 3.c4 e6 4.Nc3 Be7 5.Bg5 h6 6.Bh4 O-O 7.e3 b6 8.Rb1 c6
9.cxd5 exd5 10.Bd3 Bg4 11.O-O Ne4 12.Bxe7 Qxe7 13.Qc2 Bxf3 14.gxf3 Nxc3
15.Qxc3 a5 16.Rbc1 Rc8 17.Kh1 Qf6 18.Be2 Nd7 19.Qb3 a4 20.Qa3 c5 21.dxc5
Rxc5 22.b4 Rxc1 23.Qxc1 Qe6 24.Qc2 Ne5 25.Rc1 a3 26.Qd2 Nc6 27.b5 Ne7 
28.Rc3 Qd6 29.Qd4 Rc8 30.Rxc8+ Nxc8 31.Bd3 Qc5 32.Qh4 Ne7 33.Kg2 f6 34.Qa4
Kf7 35.Be2 Qc3 36.Bd1 g6 37.Qa7 Qc4 38.Bb3 Qxb5 39.e4 Qc5 40.Bxd5+ Kg7
41.Qd7 h5 42.Be6 Qg5+ 43.Kh3 Qc5 44.f4 g5 45.fxg5 fxg5 46.Bd5 g4+ 47.Kg2
Kh6 48.Qe6+ Ng6 49.Qf6 h4 50.h3 gxh3+ 51.Kxh3 Qc1 52.Qf3 Qg5 53.Bb3 Nf4+
54.Kh2 b5 55.Kh1 Kg6 56.Bc2 Kf6 57.Qc3+ 1/2-1/2

Forum Posts

2008 ...

Is Bison kosher ? by Olivier Deville, CCC, February 05, 2008
Bison 8.2.4r : 2152 by Patrick Buchmann, CCC, February 07, 2008
Bison 9.6 is released... by Dr.Wael Deeb, CCC, June 10, 2009
Bison 9.6 : 2507 by Patrick Buchmann, CCC, June 12, 2009
Bison Info by Ted Summers, CCC, June 19, 2009
Bison 9.8 : 2528 by Patrick Buchmann, CCC, August 02, 2009
Bison 9.11 is released... by Dr.Wael Deeb, CCC, November 22, 2009
Bison 9.11 : 2585 by Patrick Buchmann, CCC, November 23, 2009

2010 ...

Bison by Graham Banks, Winboard Forum, March 04, 2010
About derivatives by Olivier Deville, OpenChess Forum, August 11, 2011

External Links

Chess Engine

Misc

Extant Bison

Extinct Bison

References

^ Re: Bison by Dann Corbit, Winboard Forum, March 04, 2010
^ Bison at SourceForge.net
^ Fruit Chess Engine by Fabien Letouzey - Fruit 2.1 source
^ Animated sequence of a buffalo (American bison) galloping. Photos taken by Eadweard Muybridge (died 1904), first published in 1887 at Philadelphia (Animal Locomotion). Animation by Waugsberg, July 16, 2006, American bison from Wikipedia
^ The The First championship of the CIS (Первый официальный чемпионат СНГ) from sdchess.ru

What links here?

Page	Date Edited
Bison	Sep 29, 2016
CCCCISC 2008	Jan 19, 2014
DayDreamer	Aug 22, 2016
Engines	Mar 10, 2018
Ivan Bonkin	Jan 19, 2014

Up one Level

Bobcat

GerdIsenberg — Tue, 27 Jun 2017 16:02:27 GMT

Home * Engines * Bobcat

		Bobcat, a strong open source chess engine under the GNU General Public License, written in C++ by Gunnar Harms. The so far only concrete implementation of the abstract protocol class supports UCI. The development started in the second half of 2008, and the program played on FICS under the handle 'Almere', the name of Gunnar's home town on the Flevopolder, two meters below sea level ^[1]. Bobcat played the CCT13 with 4½/7 and the WCRCC 2011 with 6/10. Bobcat's opening book is made by Denis Mendoza ^[2].
Bobcat ^[3]

Description

Bitboards

Bobcat is a bitboard engine and uses Pradu Kannan's magic bitboards ^[4] to determine sliding piece attacks, and (conditionally compiled) Matt Taylor's folded forward bitscan ^[5].

Search

Bobcat's search is PVS alpha-beta with transposition table inside an iterative deepening framework with aspiration windows and fractional ply increments, and uses exception handling, catching integers for search termination. Selectivity is applied by extensions for singular moves ^[6], single replies, pawn moves to the seventh rank and safe checks, further by fractional reductions of none tactical late moves, adaptive nullmove pruning and various pruning and razoring techniques. The quiescence search considers captures and promotions ^[7]. Two search threads access a shared hash table.

Evaluation

A material class encapsulates point values, material balance and interior node recognizer, the tapered eval features piece-square tables and population count mobility and considers pawn structure with focus on passed pawns, king safety and multiple other piece related features.

Selected Games

WCRCC 2011, round 1, Nightmare - Bobcat ^[8]

[Event "WCRCC 2011"]
[Site "Internet Chess Club"]
[Date "2011.07.23"]
[Round "1"]
[White "NightmareX"]
[Black "Bobcat2x"]
[Result "0-1"]
 
1.e4 c5 2.Nf3 d6 3.d4 cxd4 4.Nxd4 Nf6 5.Nc3 a6 6.h3 e6 7.Be2 Bd7 8.O-O Be7 9.Qd3 
Nc6 10.Rd1 O-O 11.Qg3 Nxd4 12.Rxd4 Qb6 13.Rd1 Bc6 14.Bg5 Bd8 15.Rxd6 Nh5 16.Qe3 
Nf6 17.Rxd8 Qxd8 18.Qg3 Qb8 19.Bf4 Qd8 20.Bh6 Ne8 21.Be3 Qa5 22.Rd1 Nf6 23.Bh6 
Ne8 24.a3 Rd8 25.Rxd8 Qxd8 26.Be3 Qe7 27.Bd3 f6 28.Bc4 Kh8 29.e5 b5 30.Bd3 f5 
31.Ne2 Nc7 32.b4 Qd7 33.Bc5 Rc8 34.Qf4 h6 35.Nd4 Ba8 36.c4 bxc4 37.Bxc4 Bd5 38.Be2 
Qa4 39.Qc1 Nb5 40.Nxb5 axb5 41.Bd1 Qa6 42.Be2 Ra8 43.h4 Qxa3 44.Qxa3 Rxa3 45.Bxb5 
g6 46.f3 Kg7 47.Kf2 Rc3 48.Kg3 Bc4 49.Ba4 g5 50.hxg5 hxg5 51.Be7 Ra3 52.Be8 Rb3 
53.Kf2 Rb2+ 54.Kg1 g4 55.fxg4 fxg4 56.Kh2 Bd5 57.Kg3 Rxg2+ 58.Kf4 Bf3 59.b5 Rb2 
60.Bd6 Rb3 61.Bh5 Rxb5 62.Be7 Be2 63.Bf6+ Kh6 64.Be8 Rb3 65.Bc6 Bf3 66.Be8 g3 
67.Bg5+ Kg7 68.Bh4 g2 69.Bf2 Bd5 70.Bh5 Rb1 71.Be2 g1=Q 72.Bxg1 Rxg1 73.Bd3 Ra1 
74.Bc2 Re1 75.Bd3 Kh6 76.Bc2 Re2 77.Bd3 Rf2+ 78.Ke3 Rf3+ 79.Kd4 Rxd3+ 80.Kxd3 Kg5 
81.Kc3 Kf5 82.Kd4 Bc6 83.Kc5 Kxe5 84.Kc4 Kf4 85.Kb3 e5 86.Kc2 e4 87.Kd1 e3 88.Ke2 
Ke4 89.Kd1 Kf3 90.Ke1 e2 91.Kd2 Be8 92.Ke1 Bf7 93.Kd2 Kf2 94.Kc1 e1=Q+ 95.Kb2 Qd2+ 
96.Kb1 Ke2 97.Ka1 Qa2# 0-1

Forum Posts

Re: CCT 13: Bobcat by Gunnar Harms/Denis Mendoza has entered by Gunnar Harms, CCC, January 26, 2011 » CCT13
int's mixing with __int64's in argument list not working? by Gunnar Harms, CCC, March 09, 2011
Re: New version of Bobcat by Gunnar Harms, CCC, March 22, 2011 » Singular Extensions
Re: Aspiration windows by Gunnar Harms, CCC, January 08, 2012 » Aspiration Windows
A game by the new Bobcat by Gabor Szots, CCC, November 22, 2015
Bobcat 8.0 released by Günther Simon, CCC, November 07, 2016
Open-source improvements released by Norman Schmidt, CCC, June 26, 2017

External Links

Chess Engine

Misc

References

^ Re: CCT 13: Bobcat by Gunnar Harms/Denis Mendoza has entered by Gunnar Harms, CCC, January 26, 2011
^ bobcat/book/README at master · Bobcat/bobcat · GitHub
^ Bobcat from Comparative illustration of bobcat and Canada lynx, Ernest Ingersoll (1906). The life of animals, Bobcat from Wikipedia
^ bobcat/src/Magic.h at master · Bobcat/bobcat · GitHub
^ bobcat/src/Bitmanip.h at master · Bobcat/bobcat · GitHub
^ Re: New version of Bobcat by Gunnar Harms, CCC, March 22, 2011
^ bobcat/src/Search.h at master · Bobcat/bobcat · GitHub
^ 2011 Fifth Annual ACCA World Computer Rapid Chess Championships - Results

What links here?

Page	Date Edited
Bobcat	Jun 27, 2017
CCT13	Dec 6, 2013
CookieCat	Nov 15, 2016
Denis Mendoza	Mar 16, 2013
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Gunnar Harms	Feb 15, 2013
Norman Schmidt	Oct 12, 2017
TCEC Season 10	Jan 3, 2018
TCEC Season 11	Apr 18, 2018
TCEC Season 9	Nov 6, 2017
WCRCC 2011	Oct 21, 2014
WildCat	Nov 11, 2016

Up one Level

Brainless

GerdIsenberg — Sat, 24 Jun 2017 08:54:00 GMT

Home * Engines * Brainless

Brainless,
a Chess Engine Communication Protocol compliant open source chess engine under the GNU General Public License, written in C++ by Matthew Lai and Wieland Belka with contributions from Pawel Koziol. Brainless started as project from Matthew 's high school years and has been abandoned in about 2008, when German chess master Wieland Belka and Pawel Koziol contributed to the evaluation to play the First Italian Open Chess Software Cup, 2010 in Carugate. It plays on FICS under the handle BrainlessChess(C) ^[1]. The opening book is converted from Beowulf.

Photos

IOCSC 2010: Dolphin and Brainless operated by local chess players ^[2]

Description

^[3]

Board Representation

Brainless is a bitboard engine and uses rotated bitboards indexed by 6-bit line occupancy to determine sliding piece attacks, and uses the GCC builtins trailing zero count and population count ^[4] for bitboard serialization and mobility.

Search

The search is PVS alpha-beta with transposition table inside an iterative deepening framework with aspiration windows. Selectivity is applied by adaptive null move pruning (R=2 + depth >= 7), LMR, IID and check extensions, the quiescence search considers captures and promotions only. Along with the killer heuristic, static exchange evaluation improves move ordering, and also prunes bad captures near the tips.

Evaluation

The evaluation function, written by Wieland Belka, with contributions from Pawel Koziol, consists mainly of material, piece-square tables, cached pawn structure, king safety and various evaluation patterns.

Namesake

Brainless (Forth) by David Kühling

Forum Posts

Re: resources on how to write an eval function? by cyberfish, March 14, 2008

External Links

Chess Engine

Misc

References

What links here?

Page	Date Edited
Brainless	Jun 24, 2017
Brainless (Forth)	Jun 24, 2017
Eichhörnchen	Jul 16, 2013
Engines	Mar 10, 2018
IOCSC 2010	Jul 13, 2013
Matthew Lai	Dec 6, 2017
Wieland Belka	Jul 13, 2013

Up one Level

Brainless (Forth)

GerdIsenberg — Sat, 24 Jun 2017 08:52:59 GMT

Home * Engines * Brainless

Brainless,
an open source chess program by David Kühling, released in 2010 under the GPL Version 3 ^[1]. Brainless is written in ANS Forth ^[2], and uses the Forth terminal for interacting with the user and make use of ANSI color terminals and Unicode chess piece glyphs for quasi-graphical display.

Namesake

Brainless by Matthew Lai, Wieland Belka and Pawel Koziol

External Links

Chess Engine

Misc

References

What links here?

Page	Date Edited
Brainless	Jun 24, 2017
Brainless (Forth)	Jun 24, 2017
Engines	Mar 10, 2018
FCP	Jun 15, 2013
Forth	Jun 15, 2013

Up one Level

Buzz

GerdIsenberg — Wed, 22 Jun 2016 21:03:01 GMT

Home * Engines * Buzz

		Buzz, a Chess Engine Communication Protocol compliant chess engine written by Pradu Kannan in C++. An early version is available as open source engine under the GPL ^[1], intended to be an example program for new chess programmers. Buzz is a bitboard engine and applies Pradu Kannan's main stream implementation of Magic Bitboards with individual table sizes for each square, later dubbed Fancy Magic Bitboards, the generator is available as open source from the Buzz site. Buzz got a 2.2 x speedup from 32-bits to 64-bits on Core2 ^[2]. It uses a kind of principal variation search, dubbed Node-Type Search (NTS), explicitly considering node types ^[3], and utilizes multiple threads for a parallel search. In collaboration with Andres Valverde and Fonzy Bluemers, Buzz' search was incorporated into the team effort Dirty.
Buzz playing Twister ^[4]

Tournaments

So far, Buzz played the first three ACCA Americas' Computer Chess Championships, the ACCA 2006, ACCA 2007, and ACCA 2008, the first two ACCA World Computer Rapid Chess Championships, WCRCC 2007 and WCRCC 2008, as well the CCT9.

Photos & Games

ACCA 2008: Bob Hyatt, Charles Roberson, Pradu Kannan, Brian Richardson and Ted Summers ^[5]

ACCA 2008, Buzz - Tinker ^[6]

[Event "ACCA 2008"]
[Site "Internet Chess Club"]
[Date "2008.11.09"]
[Round "5"]
[White "Buzz"]
[Black "Tinker"]
[Result "1-0"]
 
1.e4 c5 2.Nf3 d6 3.Bb5+ Bd7 4.Bxd7+ Qxd7 5.O-O Nc6 6.c3 Nf6 7.d4 cxd4 
8.cxd4 Nxe4 9.d5 Nd8 10.Re1 f5 11.Nc3 Nxc3 12.bxc3 Rc8 13.Qd4 Kf7 
14.Qxa7 Rxc3 15.Qd4 Rc7 16.Be3 Rc8 17.Rac1 Kg8 18.Rxc8 Qxc8 19.Qa4 Nf7 
20.Rc1 Qd8 21.Nd4 Ne5 22.Ne6 Qb8 23.Rc7 Ng6 24.Bd4 h6 25.Qd7 Qa8 26.Nxf8
1-0

Forum Posts

Handling 3-rep/50-move in hash tables by Pradu Kannan, Winboard Forum, February 19, 2007 » Repetitions, Transposition Table
Re: Speedup with bitboards on 64-bit CPUs by Pradu Kannan, CCC, April 27, 2007
Compiling for Unix by Pradu Kannan, Winboard Forum, May 08, 2007 » Unix
Slight enhancement to PVS by Pradu Kannan, Winboard Forum, June 10, 2007 » Principal Variation Search, Node Types
Re: multithreading questions by Pradu Kannan, CCC, August 08, 2007 » Thread
A Few General Questions on Parallel Search by Pradu Kannan, Winboard Forum, August 31, 2007 » Parallel Search
Re: Adjusting weights the Deep Blue way by Pradu Kannan, Winboard Forum, September 01, 2008

External Links

Chess Engine

Misc

References

^ Buzz - A Winboard Chess Engine
^ Re: Speedup with bitboards on 64-bit CPUs by Pradu Kannan, CCC, April 27, 2007
^ Slight enhancement to PVS by Pradu Kannan, Winboard Forum, June 10, 2007
^ Buzz, a stylized yellowjacket as official mascot of the Georgia Institute of Technology
^ The 2008 Third Annual ACCA Americas' Computer Chess Chamionships Site Pics from UAB » ACCA Americas' Computer Chess Championship, ACCA 2008
^ The 2008 Third Annual ACCA Americas' Computer Chess Championships - Results

What links here?

Page	Date Edited
ACCA 2006	Jul 14, 2014
ACCA 2007	Jul 14, 2014
ACCA 2008	Jul 14, 2014
Alaric	Mar 4, 2014
Andres Valverde	Apr 6, 2013
Buzz	Jun 22, 2016
CCT9	Aug 25, 2013
Christopher Conkie	May 17, 2016
Dirty	Nov 14, 2017
Engines	Mar 10, 2018
Georgia Institute of Technology	Nov 14, 2017
Homer	Dec 23, 2013
Matilde	Jan 1, 2014
Pradu Kannan	Aug 3, 2015
Symbolic	May 8, 2017
Unix	Jun 28, 2015
Wasp	Nov 24, 2017
WCRCC 2007	Nov 21, 2016
WCRCC 2008	Nov 21, 2016
Witz	Nov 14, 2017

Up one level

Carballo

GerdIsenberg — Sun, 02 Oct 2016 16:16:45 GMT

Home * Engines * Carballo

		Carballo, an open source chess engine by Alberto Alonso Ruibal, written in Java, licensed under the GNU General Public License, and first released in 2009 ^[1]. Carballo supports the UCI protocol, and a HTML5 based GUI dubbed Mobialia Chess ^[2], developed by Lukas Laag with the Google Web Toolkit (GWT) using the Vectomatic SVG library ^[3] ^[4]. Carballo features pondering, a PolyGlot opening book, and since version 1.2, Chess960.
Storkeegen ^[5]

Etymology

Carballo is actually a Galician word meaning oak, it's all about search trees ^[6].

Description

^[7]

Board Representation

Carballo is a bitboard engine and applies magic bitboards to determine sliding piece attacks. Staged move generation along with move ordering is controlled by an iterator object which gets the next move during search, and uses legal move generation. This is so far implemented by making and testing whether pseudo-legal moves leave the own king in check.

Search

The search performs alpha-beta PVS inside the iterative deepening loop with aspiration windows, utilizing a transposition table also in quiescence, verified and indexed by Zobrist Keys. Selectivity considers the wide range of state of the art techniques.

Move Ordering

Selectivity

Evaluation

The evaluation is designed to plug in various evaluaton functions. Available are a simplified evaluation function, a sophisticated, complete evaluation function, an experimental one, and some dynamic for specialized endgames, such as a KPK bitbases ^[8]. Most important features are listed below.

Simplified

Complete

Forum Posts

Carballo (Java UCI) by Alberto Alonso Ruibal by Christopher Conkie, CCC, October 28, 2009
Re: Carballo (Java UCI) by Alberto Alonso Ruibal, CCC, October 29, 2009
A new Carballo 0.5 by Ruxy Sylwyka, CCC, April 19, 2011
Test Carballo 0.8 JA by Pedro Castro, CCC, July 03, 2013
Carballo 1.2 Gauntlet for CCRL 40/40 by Graham Banks, CCC, April 15, 2015
Carballo 1.2 exe by Arnaud lohéac, CCC, May 05, 2015
Carballo 1.3 is out by Arnaud lohéac, CCC, July 18, 2015
Carballo Chess engines by Damir Desevac, CCC, October 02, 2016

External Links

Chess Engine

Misc

References

^ Re: Carballo (Java UCI) by Alberto Alonso Ruibal, CCC, October 29, 2009
^ Mobialia Chess - Mobialia
^ lib-gwt-svg « vectomatic
^ vectomatic - standard dynamic 2D graphics in web browsers - Google Project Hosting
^ Storkeegen was (The last living branch on the tree died in 1981) an old oak (Quercus robur) in Nordskoven, Hornsherred near Jægerspris in the northern part of the island of Zealand, Denmark. This drawing is by Axel Schovelin and printed in Troels Frederik Troels-Lund (1914). Daglivt liv i Norden i det sekstende Aarhundrede. Volume 1, 4th Edition, Egen i Danmark, p. 27, Roble - Wikipedia.es (Spanish), Quercus robur, Wikimedia Commons
^ albertoruibal/carballo · GitHub
^ carballo/readme.md at master · albertoruibal/carballo · GitHub
^ carballo/core/src/main/java/com/alonsoruibal/chess/evaluation at master · albertoruibal/carballo · GitHub

What links here?

Page	Date Edited
Alberto Alonso Ruibal	Sep 23, 2017
Carballo	Oct 2, 2016
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Godot	Apr 28, 2015

Up one Level

Cassandre

GerdIsenberg — Fri, 05 Jul 2013 15:29:13 GMT

Home * Engines * Cassandre

		Cassandre, an Chess Engine Communication Protocol and UCI compliant open source chess engine under the terms of the GNU General Public License (GPL), written in C++ by Raphael Grundrich, Thomas Adolph and Jean-Francois Romang, first released in March 2003. Cassandre started as a student project at Louis Pasteur University, Strasbourg ^[1]. It is based on bitboards, in particular Rotated bitboards with 256 occupancy states to determine sliding piece attacks, bitscan aka first- and last one by conditional 16-bit lookups, and population count by eight byte lookups credited to Dann Corbit, and uses the alpha-beta algorithm ^[2].
Cassandra ^[3]

External Links

Chess Engine

Misc

References

^ Cassandre - Chess Engine
^ Cassandre - Chess Engine - About
^ Cassandra by Evelyn De Morgan (1898, London). Cassandra in front of the burning city of Troy at the peak of her insanity, Cassandra from Wikipedia

What links here?

Page	Date Edited
Cassandre	Jul 5, 2013
Engines	Mar 10, 2018
Jean-Francois Romang	Oct 23, 2017
Raphael Grundrich	Jul 5, 2013

Up one level

CFish

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

Home * Engines * Stockfish * CFish

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

Forum Posts

2016

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

2017 ...

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

External Links

GitHub - syzygy1/Cfish: C port of Stockfish

References

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

What links here?

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

Up one Level

Cheops (Miller)

GerdIsenberg — Fri, 13 Jan 2017 21:25:34 GMT

Home * Engines * Cheops

		Cheops, (CHEOPS, CHEss OPponent Simulator, Χέοψ) a didactic open source chess program written by Tristan Miller in C++, licensed under the GNU GPL, first released in 1999, version 1.0 in 2003, and version 1.2 in February 2015 ^[1]. The program uses a command line interface to interact with the user, and prints simple text diagrams to display the current position during game play. Moves are printed and entered in pure algebraic coordinate notation. Daniel José Queraltó has produced a build of CHEOPS 1.2 for Microsoft Windows. Michael Yee has produced an UCI compliant build of CHEOPS 1.1 ^[2] ^[3].
CHEOPS logo ^[4]

Description

Cheops uses a 64-square linear array board representation and performs a legal move generation anti-pattern by looking for from-squares of own pieces traversing the board in spiral order from center to h1-edge, keeping, returning and splicing ^[5] std::list as local move list variables on the stack. The tree search is fixed depth alpha–beta without quiescence search. The static evaluation function considers material, mobility, center proximity, king piece tropism, and a few pawn structure terms such as isolated, doubled and backward pawns ^[6].

Forum Posts

CHEOPS 1.2 -- An AI chess engine -- released on 2015-02-01 by Tristan Miller, rgcc, February 03, 2015
CHEOPS UCI Engine - missing Windows binaries by Norbert Raimund Leisner, CCC, March 27, 2015
CHEOPS 1.3 -- An AI chess engine -- released on 2016-12-27 by Tristan Miller, rgcc, December 28, 2016

External Links

Chess Program

Misc

References

^ CHEOPS 1.2 -- An AI chess engine -- released on 2015-02-01 by Tristan Miller, rgcc, February 03, 2015
^ CHEOPS - Third-party binaries
^ UEL by Patrick Buchmann
^ CHEOPS logo by Jin Wicked
^ list::splice - C++ Reference
^ CHEOPS - nothingisreal.com

What links here?

Page	Date Edited
CHEOPS	Apr 18, 2015
Cheops (Miller)	Jan 13, 2017
Engines	Mar 10, 2018

Up one level

Chesley

GerdIsenberg — Tue, 25 Dec 2012 19:27:08 GMT

Home * Engines * Chesley

Chesley,
an open source chess engine by Matt Gingell under the GNU Public License, written in C++ and supporting both Windows and POSIX. Chesley is compatible with the Chess Engine Communication Protocol. It takes its name from Chesley B. “Sully” Sullenberger, the pilot who successfully landed a airplane on the Hudson river around the time Matt was getting started ^[1]. Chessley is a bitboard program, and applies rotated bitboards not using the outer square optimization for a fourfold table reduction ^[2]. Matt made experiments with the Score data type in Chesley, and replaced 32-bit integer by Float, taking the same space ^[3].

External Links

References

What links here?

Page	Date Edited
Chesley	Dec 25, 2012
Engines	Mar 10, 2018
Float	Nov 11, 2016

Up one Level

Wikispaces : chessprogramming - items matching description

AdaChess

Table of Contents

Forum Posts

External Links

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

References

What links here?

Amy

Table of Contents

See also

Forum Posts

2000

2002 ...

2010 ...

External Links

Chess Engine

Misc

Demonology

References

What links here?

asmFish

Table of Contents

See also

Forum Posts

2015

2016

2017 ...

External Links

Chess Engine

Misc

References

What links here?

BBChess (SI)

Table of Contents

Differential Evolution

Namesake

See also