I'm confused, what did he change after the 271-move model to get it to produce the optimal solutions? It just says "With this improved model"...
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 0.23 there and only be 0.843 able to make a particular move. The advantage of this black magic is that it is way faster to compute and only overestimates the number of moves - hence we…
No reachable chess position with more than 218 moves
171–180 of 195 posts
Re: No reachable chess position with more than 218 moves
#172Earlier quoted context omitted.
It’s also rare to have one with more than 50 moves. I’m curious if this class of observation will help establish a true bounds. Especially because we don’t have a definition of what it means - my instinct is to first do that, so “infinity” isn’t the obvious upper bound.
What? Lots of serious chess games last more than 50 moves Not sure if I'm reading your comment correctly The upper bound of moves is 8848.5 https://www.reddit.com/r/chess/comments/168qmk6/longest_poss... ... under the rule that after 75 moves without a capture or pawn advancement the game is drawn
Re: No reachable chess position with more than 218 moves
#173I'm confused, what did he change after the 271-move model to get it to produce the optimal solutions? It just says "With this improved model"...
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 0.23 there and only be 0.843 able to make a particular move. The advantage of this black magic is that it is way faster to compute and only overestimates the number of moves - hence we…
Were you really just solving LPs up to this point in the article? How can these intermediate LPs be so slow to solve (6+ years) and yet Gurobi is able to solve the integer-restricted problem?
Re: No reachable chess position with more than 218 moves
#174Earlier quoted context omitted.
It’s also rare to have one with more than 50 moves. I’m curious if this class of observation will help establish a true bounds. Especially because we don’t have a definition of what it means - my instinct is to first do that, so “infinity” isn’t the obvious upper bound.
What? Lots of serious chess games last more than 50 moves Not sure if I'm reading your comment correctly The upper bound of moves is 8848.5 https://www.reddit.com/r/chess/comments/168qmk6/longest_poss... ... under the rule that after 75 moves without a capture or pawn advancement the game is drawn
Thanks for note re: upper bound with 75 moves without pawn advancing constraint.
Re: No reachable chess position with more than 218 moves
#175Re: No reachable chess position with more than 218 moves
#176Hi 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 questions, also in regard to proving similar chess facts, I'd be happy to help ^^ Best regards, Tobi
so just to be clear: for every board position there are no more than 218 moves available? is that the understanding?
Re: No reachable chess position with more than 218 moves
#177Earlier quoted context omitted.
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 0.23 there and only be 0.843 able to make a particular move. The advantage of this black magic is that it is way faster to compute and only overestimates the number of moves - hence we…
This part is unclear; what exactly did you change? Are you saying that the LP relaxation has value 271.666, but, when you enforce integrality, Gurobi can actually find and prove optimality of a solution with value 218? Were you really just solving LPs up to this point in the article? How can these intermediate LPs be so slow to solve (6+ years) and yet Gurobi is able to solve the integer-restricted problem?
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 gave 305.0 as upper bound, but after tightening the model (addind constraints that cut off that 305 solution and others) it gives 271.666...
- which leads to insanely faster search. It's like brute-forcing through all passwords of length 20 and a wizard telling you that you're wrong when you reach character 7 instead of 13.
Re: No reachable chess position with more than 218 moves
#178Earlier quoted context omitted.
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 .__.
Haha yeah, I saw the code and it is pretty comprehensible but some things are curious. I thought some of the naming was amusing "ENABLE_ROYAL_CUDDLING" etc. Thanks for the writeup.
Re: No reachable chess position with more than 218 moves
#179Isn't the very first move of any chess game a reachable chess position with more than 218 moves?
Maybe one of us is misunderstanding, but aren't there far fewer than 218 on the first move? The position in the article needed nine unobstructed queens to achieve 218 possible moves. For the first move, I think we could just enumerate the moves by hand, right? Eight pawns can move one or two spaces, that's 16 moves. The two knights have two moves, that's 4. Nothing else can move, can it? That's only 20 moves. EDIT: I…
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.
Re: No reachable chess position with more than 218 moves
#180Earlier quoted context omitted.
[flagged]
Thanks for the condescension. It really helps me file your comment's suggestions appropriately. Here's a general rule of thumb: If the options are a) answer someone's question, and b) answer someone's question but also then spend triple the word count telling them it was a stupid question Then picking (b) makes you an asshole. If all you had written was your first sentence this could have been a pleasant interaction…