3 ms·
If you're like me and got very excited by teasers like this: > Another interesting thing we noticed is that there is a computable position in infinite chess, s
by cvoss 4y ago
If you're like me and got very excited by teasers like this:
> Another interesting thing we noticed is that there is a computable position in infinite chess, such that ... white has a computable strategy defeating any computable strategy of black—but in the category of arbitrary play, both players have a drawing strategy.
...then here is the original paper, where they go into much more detail:
https://arxiv.org/pdf/1302.4377.pdf https://arxiv.org/pdf/1302.4377.pdf
It sounds absolutely fascinating, and I want to learn more.
- NickC25 4y agoHmm. That is interesting - does that mean that in an infinite game, first mover's advantage is essentially enough to guarantee a victory for white? If so, does that mean that infinite chess is a solved problem?
- throwaway81523 4y agoNo, it means there is a specific computable position where white has a forced win, when both white and black have to follow computable strategies. But if they can use uncomputable strategies, it is a draw. Uncomputable = "if arbitrary Turing machine X halts, I move here, otherwise I move there", that sort of thing.