Author: Jay Scott
Date: 15:42:13 01/04/06
Go up one level in this thread
On January 04, 2006 at 17:41:54, Charles Roberson wrote: >Is it possible for an improvement in search depth to result in a performance >degradation Yes, this is called game-tree pathology (or search-depth pathology) and is well-known to theoreticians. Here is a paper by Vadim Bulitko et al which cites the seminal early-1980's papers by Dana Nau and Don Beal, who were the first to discover and investigate this phenomenon. http://citeseer.ist.psu.edu/612788.html Jay
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.