Author: Anthony Cozzie
Date: 11:03:39 01/17/05
Go up one level in this thread
>i agree with that,you didnt claim "chess has been solved" but you did claim " >Any finite game can most definitely be solved"with faster hardware" This statement seems quite correct to me. My dual opteron can solve chess given enough time, it is just that this amount of time (while finite) is very large. For faster hardware, this time will become smaller. On the other hand, there are tasks that are infinite. For example, no computer could ever print every prime number, or compute the exact value of pi, no matter how much time it got, because those are both infinite tasks. This is just basic mathematics, albeit rather nonintuitive. anthony
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.