Author: Tom Likens
Date: 11:59:21 11/17/02
Go up one level in this thread
On November 17, 2002 at 13:06:39, Tom Likens wrote: [snip] >Data about the board can be represented by setting a bit in a bitboard >(i.e. the bitboard containing the location of all the white pieces would have >a bit set corresponding to each square a white piece resided on). The >real advantage of this method is that it is exceedingly easy to extract >information out of these bitboards using basic (i.e. *fast*) AND, OR, >XOR operations. For example, to obtain all the pieces a white knight >on E5 would attack we could OR the pre-computed knight attack from E5 Sorry, actually we could AND the two bitboards to get the resultant captures. >with the bitboard containing the location of all the black pieces. The >resultant bitboard would*only* have bits set that corresponded >to captures. regards, --tom
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.