Author: Dan Andersson
Date: 15:45:16 05/08/01
Go up one level in this thread
I don't think every problem is computable in practice, the folding of generalized (road)maps is not computable yet AFAIK. But I'm interested in the possibility that given the finite state space of chess there might be a provable way of computing the value of chess with a less than exponential function of the number of positions. A kind of useless intellectual curiosity of no practical use, yet. My only real objection in this tread was the Profs. statement that chess was an infinite game, and then only based on the fact of the finite state space. A game of chess might continue forever in the volontary drawing rules are not applied. There are true infinite games with unbounded state spaces, some even solvable. As for the Proof Set search idea, I'm not sure I can construct the proof sets in polynomial time. It's all to easy to hide operations by mistake. Regards Dan Andersson
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.