Author: Dann Corbit
Date: 13:52:12 05/09/01
Go up one level in this thread
By now it is. At one time, it was a discussion as to whether the game of chess algorithm is O(1) or something else. I tried to show that it is O(exp(n)), and others argue that it is O(1). I tried to get a formal agreement on definitions of terms, and it seems that even that cannot be achieved.
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.