Author: Inmann Werner
Date: 00:49:30 02/15/00
Go up one level in this thread
On February 14, 2000 at 15:10:57, Andrew Dados wrote: > Let us consider a node at ply 0, where eval>alpha. We call qsearch, returned >score is < alpha. Now, at next iteration that position will also fail low >(assuming same alpha), because there will be no other moves for failing low side >then qsearch moves again... >So: we can store that score in HT with (depth + 1) instead of (depth) due to >above... or am I missing something? (I do that trick for a while, no side >effects found yet except for lower node count). > >(The above assumes same set of moves is being considered on all qsearch plys) > >-Andrew- Seems like an interesting thing, but I do not understand full, what you mean. 1) You mean distance 0 , not ply 0 or? (last normal search node?) 2) At distance 0, the eval>alpha comes from the evaluation function? 3) After qsearch, the eval < alpha comes back? 4) then you store at distance 0 in Hash wit 1 distance increased? ???? Werner
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.