Author: Robert Hyatt
Date: 21:20:30 05/17/01
Go up one level in this thread
On May 17, 2001 at 18:13:48, Miguel A. Ballicora wrote: >On May 17, 2001 at 17:16:59, Jesper Antonsson wrote: > >>> >>>The algorithms used for chess such as alpha-beta, are general, and certainly >>>Omega(exp(n)). >> >>The algorithms used for chess are chess algorithms, which are alpha-beta with >>added constraints. The constraints make the algorithms O(1). > >So, bubblesort is O(1) when it is used to sort, for instance, license plate >numbers. > >Miguel Apparently some think so. I would not recommend anyone telling either their boss, or a prospective employer that, however... IE "if you can tell me the maximum number of inputs I will _ever_ have to sort, then I can do it with an O(1) algorithm...
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.