lucasart

only argv[0] for now.

> 1. I would be able to see and play possible continuations in "learn from mistakes" without going out from it. You can, but only once you have completed the...

@vondele: Can you try to reproduce with c-chess-cli instead ? Would be interested to see what happens in these extreme testing conditions. Download and compile (simple C program, no dependencies):...

That's interesting because c-chess-cli does not do the 'PGN Queue from master thread' thing from cutechess (whose intended purpose is to guarantee that PGNs are ordered sequentially). It does I/O...

SPRT is optimal. That is, if the underlying assumptions are true. The underlying assumption of the trinomial SPRT that is false in practice, is that games `2*N` and `2*N+1` (same...

I think what @vondele suggest is excellent design. SF itself could be reduced to a library, without UCI. And UCI would be an independent program (which can be a simple...

My experience is as follows: * blitz rating 1793 on lichess. * I score about 50% against SF level 5 on lichess. That's playing in real blitz conditions 5'+3" no...

@Sopel97 I will try when my computer is fixed. One thing I notice is that random eval perturbation + depth (or nodes?) limit should suffice. Running a multi PV search...

@vondele I tried it at 1500 elo: 5+3 blitz, no takebacks, FRC (to reduce opening knowledge factor and focus purely on gameplay, SF is bookless here). As expected, SF played...

@tillchess in this context we are referring to 1500 elo for the lichess blitz rating scale. This translates to 1000 elo blitz on chess.com. perhaps you are much stronger than...