Author: David Rasmussen
Date: 14:09:47 05/17/01
Go up one level in this thread
On May 17, 2001 at 16:32:01, Jesper Antonsson wrote: >>But given those algorithms, specialized for chess, I would like for you to show >>me one that is O(1). You haven't yet. > >Take a look at Crafty, for example, it has available source code. It isn't a chess algorithm. It is a couple of algorithms coupled with some code to describe the input to these algorithms. The algorithms themselves are exponential. The runtime of the entire program is O(1). But since that always hold, for any program that terminates, it bears no valuable meaning.
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.