Viewing profile — Tobs40
Tobs40
HN member- Joined
- Fri, Sep 26, 2025, 5:19 PM UTC
- HN karma
- 23
- Public activity
- 13 items
- HN profile
- View on Hacker News ↗
About Tobs40
No profile information was provided.
Recent public activity
-
comment
Comment #45390992
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.
-
comment
Comment #45390972
Oh no, I forgot to rename that variable before publishing, haha
-
comment
Comment #45390958
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…
-
comment
Comment #45390914
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).
-
comment
Comment #45389554
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 …
-
comment
Comment #45389497
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 .__.
-
comment
Comment #45389405
Thanks for appreciating my article ^__^
-
comment
Comment #45389356
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 …
-
comment
Comment #45389336
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 …
-
comment
Comment #45389308
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 blac…
-
comment
Comment #45389090
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 leg…
-
comment
Comment #45389056
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 the…
-
comment
Comment #45388876
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 gratef…