Author: Ernst A. Heinz
Date: 11:46:00 05/09/00
Go up one level in this thread
Hi Bas, >It seems that some (i.e. DarkThought) rotated BB programs use 1-at-a-time >movegeneration, that generate just the best MVV/LVA move. I don't understand >how they can make this work. Bob's earlier answer to your initial question essentially summarizes what we do. The find-victim and find-aggressor cycles translate into a loop nest with find-victim being the outer and find-aggressor being the inner loop. For each potential aggressor we do a full "attacks_from" calculation on the fly. In order to speed things up, we precompute King and Pawn "attacks_from" outside the loop nest. Moreover, after locating the potential victims of each find-victim cycle, we precompute some stuff which is needed by all subsequent find-aggressor cycles for these very potential victims. Last but not least, we exploit the victim and "attacks_from" history of all find-victim and find-aggressor cycles in order to shrink the sets of potential future aggressors. Hope this helps ... =Ernst=
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.