Author: Mogens Larsen
Date: 14:04:02 05/09/01
Go up one level in this thread
On May 09, 2001 at 16:52:12, Dann Corbit wrote: >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. Maybe you should try to agree on a book covering the subject and start on page one. Something resembling a study group ;-). Mogens.
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.