TalkChess.com

Thanks for the suggestion. It indeed works, modulo the deletion of the appropriate commands in the makefile. This is something I did not want to do at first because it feels as an alteration to the engine intended by the developer. You can also use the binary provided in the github repository. Avoi...

Also, several old engines have been compiled for Linux by Jim Ablett and are available here:

http://kirr.homeunix.org/chess/engines/ ... ENGINES%20++/

My programs run under Linux (better than under Windows in fact):
- Dumb 1.0 to 1.3 about 2200 Elo (CCRL 40/4 scale)
- Amoeba 1.0 to 2.8: about 2600 to 3000 Elo on CCRL 40/4
Have fun with them.

Hello, I made some further simplifications in Dumb's code, that resulted in a faster and slightly stronger chess engine. You can dowload some binaries here: https://github.com/abulmo/Dumb/releases/tag/v1.3 N.B.: I used more generic compilation settings. The 64 bit versions should work on any 64-bit ...

I did a fast test with Amoeba: - On tree size & search time. I did count the nodes & time searched at depth 18 on 200 positional positions: with aspiration: 674769965 nodes in 592.523s : 1138807 nps without: 654081365 nodes in 651.913s : 1003326 nps So aspiration window does not seem to reduce tree ...

I am not sure to understand your proposal. To me Reinforcement learning (RL) is what is often called here Texel Tuning, ie a way to tune the eval parameters from played game. Your proposal looks like building an opening book (from the current position) and loading it to the hash table to improve the...

The only "way of thinking" invoked by me so far is that: * it is a flaw to require sending of data at a time that it cannot possibly be available * it is a flaw to require sending of data that is irrelevant You are right, but it is a minor detail, of which nobody cares about among the UCI engines (...

I find the UCI pondering spec truly horrible. It violate both UCI key principles, to the point that it feels like a piece of Winboard grafted on UCI: (1) statelessness. (2) simplicity for engine developers. I wonder how you can say that. Assertions (1) and (2) are both wrong: - UCI pondering does n...

xr_a_y wrote: ↑

Tue Oct 30, 2018 11:21 am

Indeed Dumb as window/pvs/nullmove/TT/check extension/IID but no LMR, but its evaluation is smarter than Minic PST only.

Dumb's evaluation is tapered and well tuned but it remains quite simplistic: material + pst + tempo.

You may have a look at Dumb, my simple chess program in D language (a C/C++ like language): https://github.com/abulmo/Dumb It is bitboard based, using the hyperbola quintessence algorithm to generate moves. Overall, Dumb has less lines of code than minic and probably use less sophisticated algorithm...