Author: Rick Bischoff
Date: 04:55:30 10/22/04
Go up one level in this thread
The attacks are generated on demand, but all the information necessary to compute them is updated incrementally (e.g., the rotated bitmaps of the sliding pieces, the occupation of each square, etc) On October 21, 2004 at 22:49:28, Mathieu Pagé wrote: >I just read this paper by Robert Hyatt on rotated bitmap: > >http://www.cis.uab.edu/info/faculty/hyatt/bitmaps.html > >It describe how to generate attack_to[] and attack_from[] bitmaps. I think those >tables are not updated incrementaly and are computed from scratch at each node. >Am I right, or is there a efficient way to do it incrementaly ? > >Moreover, it seem to me that attack_to should be computed "on demand" only, >since we will probably not use every square of it. So it could be a function : >attack_to(int sq). Does this make sense ? > >Mathieu Pagé >mathieu.page at gmail dot com
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.