Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Bitmaps and offsets

Author: Chris Whittington

Date: 09:46:21 12/02/97

Go up one level in this thread



On December 02, 1997 at 12:32:04, Robert Hyatt wrote:

>I'd also suggest changing the subject line for this thread.  Crafty is
>not remarkably fast.  IE Rebel 8 is faster on equal hardware (although
>if it could be ported to the alpha, crafty would likely be nearly 2X
>faster).
>
>A better subject would be "bitmap programming" or some such...

Done.

One point:

offsets give you all the attacks, defenders on each square already
organised with the *size/value* of the piece in order.

working out piece safety and so on is easier with offset data.


bitmaps give you all the attacks/defenders, but essentially in random
order.

bitmaps give you nicely organised piece location data, for pattern maps
and stuff.


piece safety calculations are done by slower, knowledge intensive
programs. thus bitmap design (unless you're also willing to generate
attack tables as well) will steer the program(mer) away from this sort
of knowledge (within the current framefork of doing things).

Enuff said :)

Chris Whittington




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.