Author: TEERAPONG TOVIRAT
Date: 08:43:59 08/25/00
Hi, I'm trying to make use of old PV moves from triangular PV array . I see some programs always clear the array each time the search() is called. I notice that after the search() returns PV[0][0] (assume that starting ply=0) and suppose the next human player move is equal to PV[0][1], the old PV[0][2..to..end] are still useful at least for the move ordering function. Is it correct? ...and If this situation(human move=PV[0][1] happens, is it good idea to start iterative searching at the end of last PV line instead of from depth 1,2,3... ? My reasons are 1. We have already searched from PV[0][2] to PV[0][end] . 2. In case of time trouble,we already have the move PV[0][2] in hand. Thanks for any comment. Teerapong
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.