Computer Chess Club Archives




Subject: Re: Static Exchange Evaluation (SEE) for pruning in quiescence (?)

Author: Uri Blass

Date: 14:48:20 08/19/03

Go up one level in this thread

On August 19, 2003 at 13:56:53, Dan Andersson wrote:

> Dynamically updating attackboards is fairly fast. And you get legal moves and
>captures as an added benefit. I favour the attackboard board representation
>where each square is an unsigned 32 bit integer. One bit per piece no less. It
>can readily be combined with any other scheme AFAIK.
> When you make a move you update the attack information of the moved piece and
>pieces attacking the to and from squares as well as any captured piece. Castling
>and ep are special cases. This might be done with iteration or even using a
>bitboard. Whichever is fastest.
>MvH Dan Andersson

Can you explain what attackboard board representation you favour?
I simply do not understand it from this post.

I only understand that you remember for every square if it is attacked by a
pawn,knight,bishop,rook,queen,king but it is not enough to understand what
exactly do you have in this 32 bits number(I guess that you have more
information than it in your 32 bits).


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.