Search "user:ClaireWerk"

The position occurred 3 times, after the 46th move from white, after the 48th and after the 50th. That's a valid 3-fold repetition as per the FIDE rules. Link to the game is here since OP didn't provi…

Easy answer: It's in the rules of fide (sort of) under article 8: https://handbook.fide.com/chapter/E012018 More sophisticated answer: You need to have a recording of the moves to make claims for thre…

Because Rg7+ Kh8 Ng6# is mate, which is usually bad. f5 prevents the mate by allowing the bishop to control g7.

I meant it for streaming and videos on demand, e.g. for Youtube. Thank you :)

Hay, we'd like to create a joint account on lichess, on which we as a team can play stuff like hand&brain, talk about our moves for educational purposes, etc. In the ToS, is says: "Some Users may want…

@C4to Are you sure about -1/2 <|y|/|x| < 1/2? Id argue that even 0 <= |y|/|x|, sharpening your bound ;)

I cannot offer you a perfect solution, but one that is reasonably close: Your problem can be cast into the form of a metric travelling salesman problem. Take all fields you want to reach as nodes, tak…

@soloMidOrWillFeed Then tell me how the memory footprint is to be calculated. I'm fully aware that this way of storing positions yield 7.25 PiB for 423,836,835,667,331 positions alone. There are 7 pie…

How do you get to 5 PB? Given there are 38,176,306,877,748,245 positions by the count of kirill-kryukov.com, and each position has to have at least 8*log(2, 12)*log(2, 64) Bit (approx. 173), so say 22…

To be more specific, the best k lines (depending on your settings) for black are displayed, however, the evaluation is just negated (so +x became -x and vice versa). It still sorts the results correct…