Author: Pauli Misikangas
Date: 02:10:08 03/11/99
Hi! I use PVS in my shogi program Shocky. So far I have implemented time controlling so that when time is up (I pre-define maximum thinking time for each move), I stop searching immediately and ignore the result from the node I was searching at the moment and return the previous best one. But then I got an idea. If I am re-searching a node on which PVS failed with null window search, and timeout occurs, should I return this one as the best node? In other words, if the PVS null window search fails (and return value is between alpha and beta), do I know that this is the best node so far even without re-searching the node with wider AB-window? Virtually Yours, Pauli Misikangas PS. Shocky's home page is at http://www.cs.helsinki.fi/~pmturune/Shocky_e.html
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.