Is there a perfect algorithm for chess? [closed]
“I argued that there could not exist a deterministic Turing machine that always won or stalemated at chess.” You’re not quite right. There can be such a machine. The issue is the hugeness of the state space that it would have to search. It’s finite, it’s just REALLY big. That’s why chess falls back on … Read more