Author: Dan Andersson
Date: 10:07:36 06/01/02
Go up one level in this thread
>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. MvH Dan Andersson
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.