Author: Robert Hyatt
Date: 20:31:06 04/18/01
Go up one level in this thread
On April 18, 2001 at 08:38:09, Jeremiah Penery wrote: >On April 18, 2001 at 05:37:49, Vincent Diepeveen wrote: > >>Also i'm splitting hardly near the leaves where all recursive programs >>keep on splitting near the leaves. That's the b.f. difference! > >Is this implying that Diep is using an iterated rather than a recursive search? >I find that pretty interesting. :) I guess there would be good points for it, >especially with parallelism, but it is harder to implement than a recursive >search... The Cray Blitz algorithm is easier to implement with an iterated search, but it is not essential to make it work. The problem is that we want to look at _all_ nodes in the current tree, and pick the best place to split. This can be done pretty easily in an iterated search. But it can be done with a recursive search. I've just never wanted to introduce the extra complexity into crafty (yet). But it is definitely doable since even though I am at ply 18 in the current tree, I can still set things up and start a process to helping me at ply=4 if I want to...
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.