Author: Dann Corbit
Date: 16:04:19 05/09/01
Go up one level in this thread
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. Gedankenexperiment: Your boss has asked you to analyze a chess engine for big-O performance. Will you really report O(1)? BE HONEST. ;-)
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.