Tobs40

6 ms·

1.
by Tobs40 1y ago
Author here! You are correct! It's White to move and White has 218 moves to choose from as their next move. My article proves that you can't do better than 218.
2.
by Tobs40 1y ago
Oh no, I forgot to rename that variable before publishing, haha
3.
by Tobs40 1y ago
Ah, I see the misunderstanding. I've always been solving the integer problem of course. But throughout the article, I improve the model formulation again and again through insights, which makes the LP relaxation tighter. Initially, it
4.
by Tobs40 1y ago
It's your turn and you have 218 moves to choose from. This is the best possible and the article proves this (assuming no bugs in machine or mind).
5.
by Tobs40 1y ago
Author here, my motiviation was intellectual curiosity and some random Lichess reading about chess engine authors wondering whether 8 bit e.g. numbers 0 to 255 (or 1 to 256), will be enough for storing the number of legal moves. Which trigg
6.
by Tobs40 1y ago
Author here, I considered but decided against the complexity, haha. I added a Github link towards the bottom of the article though. Code might not be pretty though .__.
7.
by Tobs40 1y ago
Thanks for appreciating my article ^__^
8.
by Tobs40 1y ago
Author here! Composing such a position is much easier than mathematically proving that there isn't a better one. Perhaps there is an elegant proof. Perhaps they had reasoning that proved that they couldn't do better while composin
9.
by Tobs40 1y ago
Author here! Did you read the entire article? It's 271.666... moves, not 271.0 :) This bound comes from model where whole decisions (0 or 1) are relaxed to continuous ones (0.0 to 1.0 and anything in between), e.g. a piece can only be
10.
by Tobs40 1y ago
Author here. The position is White to move, so even if the b2 pawn was not pinned by a white queen to the black king, it could not move. The b2 pawn is necessary to shield the black king from checks as this position is White to move - other
11.
by Tobs40 1y ago
Author here! Yes, if Gurobi and my code run as intended and I did not mess up any thinking while simplifying my chess model, then what I did is proof that the maximum number of legal moves available in a chess position reachable by a sequen
12.
by Tobs40 1y ago
Hi, author of the Lichess article here. relaxing and omitting chess rules also changed the choice of variables. I did try lazy constraints etc. before diving into the math, but they did not yield a significant speedup. For example, not cons
13.
by Tobs40 1y ago
Hi all, a friend of mine pointed out that my article is being discussed in this forum. I am sorry for choosing a suboptimal title and I hope that it is unambiguous now. I am grateful for your feedback and kind words! If you have any questio