Computer Chess Club Archives

Search

Messages

Subject: Are attack_to and attack from supposed to be incrementaly computed ?

Author: Mathieu Pagé

Date: 19:49:28 10/21/04

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

• Re: Are attack_to and attack from supposed to be incrementaly computed ? Robert Hyatt 21:16:10 10/22/04
• Here is how I think it could be done Mathieu Pagé 07:14:13 10/22/04
• Re: Are attack_to and attack from supposed to be incrementaly computed ? Rick Bischoff 04:55:30 10/22/04
• Re: Are attack_to and attack from supposed to be incrementaly computed ? Thorsten Greiner 04:14:49 10/22/04
  • Re: Are attack_to and attack from supposed to be incrementaly computed ? Mathieu Pagé 06:51:50 10/22/04
  • Re: Are attack_to and attack from supposed to be incrementaly computed ? Reinhard Scharnagl 05:12:39 10/22/04
• Re: Are attack_to and attack from supposed to be incrementaly computed ? Stuart Cracraft 20:47:40 10/21/04
  • Re: Are attack_to and attack from supposed to be incrementaly computed ? Robert Hyatt 21:19:00 10/22/04
    • Re: Are attack_to and attack from supposed to be incrementaly computed ? Stuart Cracraft 09:52:55 10/23/04

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.