Author: Dann Corbit
Date: 11:31:59 01/27/00
Go up one level in this thread
The base argument assumes that speed increases exponentially (Moore's law). If speed increases exponentially and chess is an exponential problem, then there is a linear increase in a program's ability to solve.
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.