Author: Vincent Vega
Date: 23:45:48 03/10/00
Go up one level in this thread
On March 10, 2000 at 12:59:16, Dann Corbit wrote: >As a mathematician, if you have any computer programming experience, then you >are surely aware of O(f(n)) notation. If a program has a superior algorithm, >then even if it is a bad implementation, at *some* point, it will dominate a >program with an inferior algorithm. Not really because chess is finite but in practice you're right because chess is probably deep enough for even small f(n) advantage to become superior.
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.