Belofte is a promising chess program. Belofte is a Flemish word that can be translated as 'a Promise' or 'someone with potential'. In this context, the latter is the intended meaning. The most correct translation would be 'A promising chess program'. It is pronounced as 'b-euh-loft-euh'.
The chess program comes without user interface but is compatible with xboard. This means, it can be used as a plug-in for the majority of all commercial and free chess programs. At this moment, it has been tested on Mac OS X. There is nothing that stops it from being used on any version of Windows or UNIX or Linux, if one would like to make such a version. The current strength of Belofte is about 1200 elo at freechess.org in in Lightning and 750 in Blitz. Version 0.2.8 has 751 on GURL. Version 0.9.0 has 692 on CCRL. Version 0.9.3 has 989 on CCRL. Version 0.9.12 gains at least 200 elo.
Please refer to the manual for more detailed instructions. For a quick introduction, please read the readme.md file.
Binary version 0.2 is available.
Binary version 0.2 is available.
http://www.rwbc-chess.de/Ratings/Ratings.htm Version 0.2.8: position 1207 http://www.computerchess.org.uk/ccrl/404/ Version 0.9.3: position 631 Version 0.9.0: position 643
Belofte is a self-written chess program available on Mac OS X and on Linux i386. It works with XBoard or from the command line. It also plays on freechess.org under the same name. You can meet it there during weekdays in between 20.00 CET and 06.00 CET. The main concept behind 'Belofte' is not to be yet another chess program but to change some fundamentals in chess programs. Most chess programs work by selecting the best move according to evaluation and search. 'Belofte' is different in that. It will select amongst one of the good moves according to a certain desire. It changes fundamentally from the traditional minimax algorithms; it does not retain the best move in a certain position, but a series of plausible moves in a position. For that, it will analyse the games of the opponent to see what moves he/she will play and uses these moves in its analysis. I do not throw away all chess development concepts: What is implemented is: • Alpha-beta • Quiescence • Opening books What will be implemented in the future is: • Iterative deepening • Transposition tables • Endgame tablebases • en-passant moves • analysis mode
|Language||Native translation||Name of application.|
|English||English||Belofte - A promising chess program|
|Flemish / Dutch||Vlaams / Nederlands||Belofte schaak|
There are as many elo levels as peer groups. Elo levels can be compared to IQ. They give a relative indication how persons compare to each other but they cannot be used to compare a person of group A to a person of group B. FIDE elo at the 1900 range is comparable to USCF in the 2000 range, and FIDE 2500 is comparable to USCF 2650. The score obtained for a program should more or less be the average of all different tests, but is no absolute indication. For each test set, the elo level for a 50% and 100% score is given, together with the standard deviation. When scoring less than 50%, the results should no longer be representative.
|0.1||680 ??||First version|
|0.2||Ports to Solaris and HPUX|
|0.2.2||???||Internal development version|
|0.2.4||???||Internal development version|
|0.2.5||1038 ??||Internal development version|
|0.2.6||1190 ??||Opening book implemented. Rating obtained after 6600 games. Top rating 1294.|
|0.2.7||19/03/2005||1130 ??||Mac OS X version. Saving multiple times same game resolved. Slight change in evaluation function. Windows version available. Linux version available.|
751 on GURL-2
742 in FreeChess Blitz
|Added opening book colour transposition and better balancing of good moves in opening book. Better handling of shorter games. Correction of castling information. Adding partial comments for autodoc. Documentation available. License conditions added. Rename of binary book and taking into account Intel Mac for opening books.|
|0.3.0||after 17/5/2005||not rated||Conversion to Universal binary, a lot of optimizing. But still not finished. It plays from time to time on the internet and while under development. First conversion to cpp|
|0.4.0 till 0.6.2||after 17/5/2005||not rated||Implementation of multi-threading and multi-algorithm. Development on Win32 platform.|
|0.9.0||06/06/2017||692||Continuation of 0.2.8 branch, port to Linux 64 bit. Change in license conditions, available on Git. The 0.9.0 branch is the temporay version of 0.9.0 containing the big part of work. It has been merged in the master branch and tagged on final release.|
|0.9.1 and 0.9.2||24/07/2017||1100 (estimated)||Instead of fixed depth based on available time, respect time levels. Recognises 3 fold repetition. Correction of some illegal moves. Multi-threaded approach. Different threads: UI, timeobserver, search, pondering. Updates on evaluation function. Huge increase in strength.|
|0.9.3||12/07/2018||989||Standard build does not compile UCI specific commands. Multi-threading fixed on linux build. Available on Win64 and Linux64.|
|0.9.6 till 0.9.8||10/12/2019||1100 (estimated)||Standard build does not compile UCI specific commands. Other builds not tested. Available on Win32 and Linux64.|
|0.9.10||06/02/2020||1200 (estimated)||Xboard protocol only. Available on Win32 and Linux64.|
|0.9.12||12/02/2020||1300 (estimated)||Quiescent search fixed. Xboard protocol only. Available on Win32 and Linux64.|
|0.9.13 till 0.9.14||13/02/2020||1300 (estimated)||Xboard and UCI protocol. Available on Win32, Linux32 and Linux64.|