Computer Chess Club Archives

Search

Messages

Subject: Re: beating TSCP too! interesting game. (What's an attackboard?)

Author: David Rasmussen

Date: 00:21:23 01/09/01

Go up one level in this thread

On January 08, 2001 at 17:26:57, Severi Salminen wrote:

>>>>Well, generating moves is slow
>>>
>>
>>You don't have to generate moves to calculate mobility. You can just use
>>attackboards of some kind.
>
>Please enlighten me: what is an attackboard?
>
>Severi

It is a way to get all the squares to which a piece can move by a pseudolegal
move. In a bitboard based program, it would just be a bitboard of all the places
a piece on a given square can go to, given the configuration of pieces on the
board, if we disregard placing the king in check. Of course this wont account
for pinned pieces, overworked pieces, trapped pieces etc. But it will give you a
good idea of the mobility of a piece. Similar ideas can be made with
non-bitboard implementations.

• Re: beating TSCP too! interesting game. (What's an attackboard?) Severi Salminen 00:25:49 01/09/01
  • Re: beating TSCP too! interesting game. (What's an attackboard?) David Rasmussen 03:37:54 01/09/01
    • Re: beating TSCP too! interesting game. (What's an attackboard?) Severi Salminen 05:14:55 01/09/01
      • Re: beating TSCP too! interesting game. (What's an attackboard?) Uri Blass 08:06:16 01/09/01

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.