Author: Jesper Antonsson
Date: 12:04:41 05/10/01
Go up one level in this thread
On May 09, 2001 at 19:04:19, Dann Corbit wrote: >On May 09, 2001 at 18:51:34, Andrew Dados wrote: >[snip] >>One proof is that tablebases are computable. And you may precalculate their >>sizes. And they are correct. > >6 piece tablebase files are computable. > >A 32 piece tablebase file is most definitely not computable by any sane measure. In theory, it is computable. That we do not have enough time and space is a bit beside the point. >Gedankenexperiment: > >Your boss has asked you to analyze a chess engine for big-O performance. > >Will you really report O(1)? >BE HONEST. >;-) Yes, honest. :-P I will also report it's practical behaviour, of course.
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.