Author: Zach Wegner
Date: 22:59:03 12/25/04
Go up one level in this thread
You can indeed split anywhere in the tree with a recursive search, but you have to know where to split. If you have the whole stack in (accessable) memory, then you can find a split point anywhere along the search line. It also makes it much cleaner to do things like return from a split node, and you can adjust alpha/beta values along the stack when a new PV comes in on the split node. If you have a working parallel implementaion, you should probably keep your search the way it is. Regards, Zach
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.