Author: Rolf Tueschen
Date: 05:22:22 06/03/02
Go up one level in this thread
On June 02, 2002 at 22:36:15, Dante Rosati wrote: >>It is accepted (by most) that a chess program is a system, of which >>the opening book is an integral part. > >As a thought experiment: a very fast computer (or one with unlimited time) could >create a "tree" of every possible move up to, say, 500 ply. This would then be >not only an opening book, but a middle game book and end game book too. Then, >the computer would not need to do anything other than consult its "tree" to play >a move. In other words, all the computing would have been done once and for all >to create the tree. > >The other extreme is to not have any pre-computed book at all, but rather >compute from scratch each line as it arises in the game. Given the right >algorithms, and a fast enough computer, doesn't this give the same result in the >end? Your problem seems to be the definition of "the right algorithms", don't you see that? In principle your are right, with infinite time and infinitely strong computers and infinitely good algorithms, oh yes, of course, that would be alright. Rolf Tueschen > >"Reinventing the wheel" is irrelevant if doing so each time is trivial due to >computing power. > >Dante
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.