driusan / blunder

A UCI compatible chess engine written in Golang

Overview

Blunder is an open-source UCI compatible chess engine. The philosophy behind Blunder's design is for the code to straightforward and easy to read, so that others can benefit from the project.

Version	Estimated Rating (Elo)	CCRL Rating (Elo)	WAC1	IQ6 2
1.0.0	1400	N/A	N/A	N/A
2.0.0	1570	N/A	N/A	N/A
3.0.0	1782	N/A	N/A	N/A
4.0.0	1832	1734	N/A	N/A
5.0.0	2000	2080	N/A	N/A
6.0.0	2200	N/A	N/A	N/A
6.1.0	2200	N/A	N/A	N/A
7.0.0	2280	??	279	2477

^{1 Win At Chess}

^{2 IQ6 Test}

Installation

Compiling Blunder is fairly simple.

All that is needed is to visit Golang downlaod page, and install Golang using the download package appropriate for your machine. To make using the Golang compiler easier, make sure that if the installer asks, you let it add the Golang compiler command to your path.

Your installation should be up and running in about 5-7 minutes, and from there, you need to open up a terminal/powershell/ command line, navigate to blunder/blunder, and run go build. This will create an executable for your computer, which you should then able to run.

Usage

Blunder, like many chess engines, does not include its own GUI for chess playing, but supports something known as the UCI protocol. This protocol allows chess engines, like Blunder, to communicate with different chess GUI programs.

So to use Blunder, it's reccomend you install one of these programs. Popular free ones include:

• Arena
• Scid
• Cute-chess

Once you have a program downloaded, you'll need to follow that specfic programs guide on how to install a chess engine. When prompted for a command or executable, direct the GUI to the Golang exectuable you built.

Features

• Engine
  • Bitboards representation
  • Magic bitboards for slider move generation
  • Zobrist hashing
• Search
  • Negamax search framework
  • Alpha-Beta pruning
  • MVV-LVA move ordering
  • Quiescence search
  • Time-control logic supporting classical, rapid, bullet, and ultra-bullet time formats.
  • Repition detection
  • Killer moves
  • Transposition table
  • Null-move pruning
  • Reverse futility pruning
  • History Heuristics
  • Principal Variation Search
  • Fail-Soft
• Evaluation
  • Material evaluation
  • Tuned piece-square tables
  • Tapered evaluation
  • Mobility
  • Texel Tuner

Changelog

The changelog of features for Blunder can be found in the docs/changelog.md.

Credits

Although Blunder is an orginal project, there are many people without whom Blunder would not have been finished. The brief listing is included here (in no particular order). For the full listing, with elaborations, see docs/credits.md:

My girlfriend, Marcel Vanthoor, Hart Gert Muller, Sven Schüle, J.V. Merlino, Niels Abildskov, 
Maksim Korzh, Erik Madsen, Pedro Duran, Nihar Karve, Rhys Rustad Elliott, Lithander, 
Jonatan Pettersson, Rein Halbersma, Tony Mokonen, SmallChess, Richard Allbert, Spirch, and
the Stockfish Developers.

These credits will be updated from time to time as a remember or encounter more people who have helped me in Blunder's development.

License

Blunder is licensed under the MIT license.