Author: Robert Hyatt
Date: 08:29:30 04/12/04
Go up one level in this thread
On April 11, 2004 at 08:13:44, Dan Andersson wrote: >>If it is not possible to write a parallel search algorithm without a >>non-recursive alpha >>beta function, I am definitely not going to do it. :-) >> > There is nothing hindering you from using recursion. But for efficient paralell >algotithms you will probably have to make the stack explicit to be able to >access it. > >MvH Dan Andersson My next paper is going to describe how I use recursive negamax in Crafty with the parallel search. It isn't that difficult, although non-recursive is certainly a bit easier.
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.