Author: Jeremiah Penery
Date: 10:18:49 05/18/01
Go up one level in this thread
On May 17, 2001 at 20:47:30, Jeremiah Penery wrote: >What is a "chess algorithm"? Currently, they are alpha/beta algorithms. They >are simply passed the arguments that limit the size of the tree. Your argument >is like taking a sorting algorithm, but giving it a list of only 1000 numbers >for input and saying "Sorting 1000 numbers is O(1)". It's not even a valid >statement! You can pass the algorithm more than 1000 numbers if you want, but >it simply ignores all the extra numbers and sorts the original 1000, in the same >amount of time. This really does not make the sorting algorithm O(1). This isn't quite what I wanted to say. What I mean is that if you write a program that sorts 1000 numbers and call it "Sort". You can give the program more numbers, but it ignores them. Of course the program uses a sorting algorithm to do its work, but just because in this program it works on 1000 numbers or less does not make the sorting algorithm O(1). This is very similar to the chess program situation.
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.