Hmm. 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?
No, 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.
Great explanation - thanks!
Reminds me of deep blue not knowing what to do and moving randomly while being white in the first match against Kasparov. It won.