Author: nobody
Date: 14:12:53 09/09/05
In Matiyasevich's book there was a passage on the undecidability of whether an arbitrary game would end in a specific state. Is it still possible that a certain algorithm/gambit would be unavoidable in resulting of a loss/win/stalemate. If so, what is the feasibility of solving chess as far as the computational complexity.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.