Author: Rémi Coulom
Date: 01:46:08 05/23/02
Go up one level in this thread
On May 22, 2002 at 18:41:43, Omid David wrote: >Unfortunately in last few years there is a a severe lack of computer >chess academic research. The last computer chess PhD thesis which is >worth studying is Aske Plaat's 1996 thesis. And most references I've reviewed so >far for my thesis are rather old or not practical. > >Besides that, most theses discuss only fixed depth search!!! Am I the only one >working on variable depth search for thesis?!? Ernst Heinz's thesis is more recent (1999) and well worth studying. http://supertech.lcs.mit.edu/~heinz/ I think nobody does fixed-depth search. Null move, futility and extensions are very well-known heuristics that shape the search tree so each line is not searched at a fixed depth. Or maybe you have another definition of what variable depth is? Rémi
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.