Author: Severi Salminen
Date: 00:25:49 01/09/01
Go up one level in this thread
>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. Ok, thanks! Now I now I'm using attackboards... Severi
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.