Author: Heiner Marxen
Date: 12:00:48 06/01/02
Go up one level in this thread
On June 01, 2002 at 13:07:36, Dan Andersson wrote: >>Why do you think that draws (even with large/long cycles) are recognized >>easily with PN^2 ? Do you have experience? Data to share? Theoretic >>insight? >As the problems with detecting long draws are depth based. A best first search >seems appropriate. But to avoid duplicate work, a cache of already evaluated >nodes need to be probed also. A modified PN search called Proof-Set Search by >Martin Müller might be applicable. Thanks! Can be downloaded (ps orf pdf) via http://web.cs.ualberta.ca/~mmueller/publications.html I havn't yet studied it thoroughly, but it sounds quite interesting after a short look into it. Also, Martin Müller seems to have more to say about advanced search methods, maybe I'll read his other papers also. Many thanks for the pointer! >MvH Dan Andersson Cheers, Heiner
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.