Author: Miguel A. Ballicora
Date: 12:14:04 05/09/01
Go up one level in this thread
On May 09, 2001 at 14:11:25, Ricardo Gibert wrote: > >But [in chess] the the length of the input does not increase and that's the >whole point. > In my very humble opinion (I am no computer scientist, not even a professional programmer), you guys are not confusing the answers but confusing the problem! There are two problems that are different 1) solve chess, know the absolute Truth. 2) solve a given position where the input is the number of plies (n) needed to see the solution. Some positions have different "n" so the input changes. In other words, mate in n would be an example. It is special because the number of possible positions I can give as input are finite. Still, the algorithm is exponential (in good programs, in mine is even worse :-) Regards, Miguel
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.