Author: Andrew Dados
Date: 12:10:57 02/14/00
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-
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.