Author: Jeremiah Penery
Date: 17:52:51 05/17/01
Go up one level in this thread
On May 17, 2001 at 17:50:11, Ralf Elvsén wrote: >I think Jesper is concerned over the use of the O()-notation. If one >thinks chess scales exponentially with search depth in a "practical" >sense only, one should say "my-homemade-O(a^n)". Chess is definitely o(exp(n)) (little-o), whether it is O(exp(n)) (big-O) or not. I'm already arguing in a different thread, and I won't expand that here.
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.