Author: Robert Hyatt
Date: 17:49:52 09/20/98
Go up one level in this thread
On September 20, 1998 at 19:31:36, John Coffey wrote: >We all know that searching 1 ply, 2ply, 3ply, 4ply etc produces faster >results than just searching 4 ply by itself because the move odering >improves the efficiency of the alpha-beta pruning. > >But ... > >Has this approach ever been used above the base of the tree? i.e. If >I am doing a seven ply search and I make the first move for white and >I am searching the black responses, at this point would it pay to do >a 1ply, 2ply, 3ply, 4ply, 5 ply, and finally a 6 ply search? > >If so, then the number of sub-searches would get quite high. > >John Coffey there's no sense in doing it repeatedly, because if you do, you research too many nodes to the same depth. (think about it). But, at times, this is useful, and is called "internal iterative deepening." If, on the PV search at the next iteration, I can't find a hash move at any level, I do just what you suggest to find the best move to try there first... and it saves a good bit of time here and there...
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.