Author: Nobuhiro Yoshimura
Date: 05:47:42 07/12/99
In program with iterative deeping like:
for( iteration=1; i<MAX_ITERATION; i++ )
search( alpha, beta);
If we do many search extensions in search(), it will search more deeper than
"iteration".
Is it a good idea to limit the search depth for each iteration ( for example,
maximum depth to be 2*iteration) , or not to limit the search depth.
Which idea is true in general?
If I limit the search depth, it will terminate the search-routine soon and
1) prabably it will find a right move in next iteration
2) prabably it will NOT find a right move in next iteration again.
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.