Author: Peter McKenzie
Date: 16:51:46 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. To me the question doesn't make sense. I mean, what is N ?? It only makes sense to talk about big-O notation when you have an 'N' which varies with different inputs doesn't it? For sorting, 'N' is the number of elements to be sorted. For chess, what is 'N' ? Do you want 'N' to be the number of pieces left on the board? Or perhaps you are interested in some family of chess like games where the board can be of any size? cheers, Peter (being sucked into the off-topic void :-)
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.