Author: Severi Salminen
Date: 11:17:07 03/16/01
Go up one level in this thread
>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
This page took 0.03 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.