Author: Uri Blass
Date: 00:31:05 03/17/01
Go up one level in this thread
On March 16, 2001 at 14:17:07, Severi Salminen wrote: >>This is an idea that I haven't had time to try (of course, most probably it >>was tried before by somebody else...). >>Suppose this scenario: I have alloted 30 s for the move, I finish one iteration >>at 20 s so most probably I won't be able to finish the next one on time. >>Would it be useful to go to the next iteration searching with alpha, alpha+1 >>just to test if the pv_move fails low? If it doesn't, I just return that move. > >Well you also can fail high, which gives you another good move. This also can >happen without finishing the current iteration so I think it is wise to search >normally. > >Severi If you finish iteration after 20 seconds then failing high cannot give you a different move unless you get a score for the first move in less than 10 seconds. Usually you use more than 1/3 of your time for the first move. Usually it does not change significantly in different iterations and if you used 1/2 of your total time for the best move in the previous iteration then you are also going to use something similiar for the first move in the next iteration. Uri
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.