Author: Daniel Shawul
Date: 21:49:37 12/25/04
Hi i read in the DTS paper that the main advantage of non recursive search is that splitting is possible anywhere in the tree. My quesion isn't it possible to split at shallower depth on the current line of search (from 0 to current ply P), by just undoing the moves made. If after searching few moves,IE when i get a reliable bound, i immediately undo the move that led to the current position with one of my threads, and then start parallel search at the previous ply. Or i can undo two moves back and start par. search at P-2. I think with non-recursive search the only thing possible is to split at points on the current line of search. This is like a modified PVS which releases idle processors after a good bound is established to search at previous plies. what do you think? daniel
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.