Author: Jesper Antonsson
Date: 15:11:57 05/15/01
Go up one level in this thread
On May 15, 2001 at 11:53:32, David Rasmussen wrote: >On May 15, 2001 at 06:40:58, Martin Schubert wrote: > >> >>O-Notation is never about one specific problem, it's about one "family" of >>problems. If you want to look at the asymptotical behaviour of chess, you need >>an input n, for example the size of the board. Other things don't make sense. >>You can't say, something is O(1) because of something is bounded. First you have >>to define what your "n" is, and then look at the asymptotical behaviour. >>It doesn't matter for example, if you play chess only on a 8x8-board. The >>question is "what would happen if you played on a nxn-board?". >> >>Martin > >Exactly. Most of us are talking about chess and "n" as "target search depth".
This page took 0.01 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.