TalkChess.com

Hi Gabor, Version 2.x is a complete rewrite in c++ because some things were difficult to fix in c code. Pv variation tracking up to root node of search. Cross platform multi threading Move score instead of score relative to resulting position UCI implementation ... I could probably get those things ...

Could you please elaborate on your criteria? 1) Open source (most are on git anyway) C/C++ only? 2) Easy compile with make/cmake on both, Linux and MacOSX, with g++ and clang, telling their name on init. As per uci protocol, the name should be told by the id name feedback after issuing uci command. ...

Thanks for the feedback. No output is a bit strange. In version 2.0.8 onwards there is iterative deepening and on going to next search depth, there should be output on the best move found till now. The queen en prise is something I noticed. Search gets cut off when time expires and direct refutation...

Thanks a lot for the android build. This is great news. I will start testing right away. Works on Android so far, but, when using analyzing mode in DroidFish, i see no evaluation information. UCI_Analyze.. stuff has not been implemented yet. Could be the reason. Also, when starting the engine, i see...

Version update: Belofte 2.0.8 has been released on Windows/Linux/Mac in 32 and 64 bit under GPL v2. Major changes: plays time-based levels when selecting uci protocol implements iterative deepening with bruteforce search Builds are non optimized as compilation with -flto or -march generates problems...

fncll wrote: ↑

Tue Oct 27, 2020 10:14 pm

Any tips on compiling on OSX (10.15.7)? I get the following error:

Code: Select all

ld: symbol(s) not found for architecture i386
clang: error: linker command failed with exit code 1 (use -v to see invocation)

Corrected compile script has been published in sourceforge. Needs an update on source files too.

Are you compiling with the project/compile.sh script? For Mac OS X, it will compile both 32 and 64 bit versions. This works fine on Mac OS X 10.8.5, the version I use.... from a higher version on, I do not know exactly when 32 bit support was dropped, the 32 bit compile does no longer work. For thos...

A new release of Belofte is available. Version 2.0.6. This is a rewrite from scratch in C++ respecting UCI. Tested on Windows/Linux/Mac in 32/64 bit. You can set the algorithm used in UCI. Please note that current version is not yet respecting time-levels, only depth levels. (Cutechess tc=inf depth=...

Thanks for your efforts but I have bad news. When I try to play a game against Belofte, it starts thinking when out of book but it never moves. In fact I can see with task manager that after a couple of moves it is no longer in memory. I have seen 2 different problems: 1) On windows 32 bit, the ver...

Belofte 0.9.18 released. This is mainly a bugfix release that solves regressions introduced by 0.9.14 and 0.9.16. Also fixes CPU usage. Timeobserver thread on linux using 5% and windows 25% (time function?) only starts when time bound search is starting. Due to commenting some parts in the unused se...