Author: Dann Corbit
Date: 13:35:00 05/09/01
Go up one level in this thread
On May 09, 2001 at 16:24:09, Andrew Dados wrote: [snip] >And what does it have to do with fact that constant (however big) is of O(1)? > >I don't argue IF CHESS IS PRACTICALLY SOLVABLE; I am just trying to show you, >that there exist an algorithm solving ANY chess position with cost of O(1). No such algorithm exists. >Unlike sorting of any number of elements, or TSP with any number of cities. It is the exact same situation. Look at the sorting algorithm insertion sort that I provided. Is it really O(1)? If you put that definition in a text book, what will a peer review say about it?
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.