TalkChess.com

FoxSEE 3.3.4 https://github.com/redsalmon91/FoxSEE/releases KnightX 2.0 http://technochess.free.fr/ Minic 2.33 (unofficial edition) https://github.com/tryingsomestuff/Minic-Dist/tree/master/Minic2 - v2.31 https://github.com/tryingsomestuff/Minic/releases Sapeli 1.90 https://github.com/SamuraiDangyo...

Instead of a big ass list of FRC fens. One could simply play 100000 games against some stable FRC engine to see there's no illegal moves. Some study like positions are ok for unit testing. About this position: nrbbnk1r/pp2pppq/8/2pp3p/3P2P1/1N6/PPP1PP1P/1RBBNKQR w HBhb - 0 9 SF: Need to pipe in stdi...

You forget I wrote: Bugs is result of missing test cases. Writing clear code is first thing to do. O wait that won't help if algorithms, ideas or visions are bad. Yes! Clear code is usually the best choice. Like Stroutstrup said: Simple code is usually fast code. Recently I removed KPK Bitbases fro...

Rust isn't written in C++. The very first versions were written in OCaml, until it was possible to actually write a Rust compiler in Rust itself. (This is called bootstrapping: the rustc compiler, written in Ocaml, compiles some Rust code... Which happens to be a rust compiler, that can compile tha...

It requires cargo to build and lots of dependencies. No wonder it doesn't work. Never understood this cargo system. Only way to fix it would be pull all that dependency crap and build a static package. I personally stay away from all libraries, frameworks (Especially JavaScript frontend frameworks ...

I too have had plenty of time up my sleeve lately to work on my program and have found a few glaring errors that, once fixed, have led to better play. I find it fascinating that with chess programming, errors don't crash the program, but simply result in worse play. This I find makes it difficult t...

C was created to be one thing: a portable assember. That is, a language that is easier to read and write than assembler and makes programs run on multiple architecture without rewriting, but being just as fast. It succeeded. I love C, but I love Rust better because of it's awesome static code analy...

In Sapeli I use the selection sort algorithm for all the sorting. I guess this is the same algorithm as Stockfish uses (or insertion sort ?). Root nodes: I sort at depth 0 with Eval + random noise(to avoid repetiting games). Then the best move is put on the top after every iteration. Search nodes: I...

Funny thing it that I have pretty much only removed crap and Sapeli has gained +50 ELO on CCRL Blitz lists :) I just posted this: Speed is your currency that buys you other things in a topic where you're also a participant. I don't find it funny or strange at all that optimizing the code to be fast...

That's too much code. I simply Board = moves + i; And nothing else. There is no simpler way to do it. copy+make or what's the correct terminology. Don't understand. What is "+ i". "ï" is next move? Then each time you need the current position you have to reconstruct it from the moves. Too slow. It'...