Computer Chess Club Archives

Search

Messages

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

Author: Sune Fischer

Date: 11:59:45 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

I think there is a chance it can be a win on middle game positions, but it is
very expensive in the endgame. Just consider the number of squares that needs
updating when you move around a queen or rook.

-S.

• Re: Static Exchange Evaluation (SEE) for pruning in quiescence (?) Dan Andersson 12:24:59 08/19/03
  • Re: Static Exchange Evaluation (SEE) for pruning in quiescence (?) Sune Fischer 13:12:20 08/19/03
    • Re: Static Exchange Evaluation (SEE) for pruning in quiescence (?) Andrew Williams 10:30:56 08/20/03
      • Re: Static Exchange Evaluation (SEE) for pruning in quiescence (?) Dan Andersson 14:48:59 08/20/03
        • Re: Static Exchange Evaluation (SEE) for pruning in quiescence (?) Tord Romstad 08:52:18 08/21/03
          • Re: Static Exchange Evaluation (SEE) for pruning in quiescence (?) Dan Andersson 09:12:25 08/21/03

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.