Re:A proof P = NP was accidentally published in TOCT
by pentestercrab on Monday July 19, 2021 @09:43PM
(#27889280)
The fivefold repetition rule requires no claim by the players.
Re:A proof P = NP was accidentally published in TOCT
by ineedasername on Tuesday July 20, 2021 @07:06PM
(#27900400)
Ah, true... Given the double criteria for that (lack of pawn movement) it extends things a bit, but there would still be a finite number of moves.
However on an info it's chess board there would always be a unique board state possible. That doesn't by any means refute your point, only add a twist to things.
Also, if chess was "solved" and board states determined "winnable" after significantly more moves, the rules might very well change to extend that limit.
Something along those lines has happened before: When a combination of pieces have been shown to be "winnable" but might exceed the 50 move rule, exceptions have been made to the rule to allow more time to develop the win. At some point though, the rules went back to 50, but still with conditions about pawn moves, pieces taken, etc.
The history is interesting: 50 was originally chosen (or maybe just compromised on) because players felt than all winnable games could be won in 50 moves or under.