Author: Jeremiah Penery
Date: 05:38:09 04/18/01
Go up one level in this thread
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...
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.