Computer Science – Data Structures and Algorithms
Scientific paper
2007-04-28
ICGA Journal, Vol. 30, No. 2, pp. 85-91. (June 2007).
Computer Science
Data Structures and Algorithms
7 pages, 1 figure, 4 listings; replaced test positions, fixed typos
Scientific paper
This paper describes an approach for obtaining direct access to the attacked squares of sliding pieces without resorting to rotated bitboards. The technique involves creating four hash tables using the built in hash arrays from an interpreted, high level language. The rank, file, and diagonal occupancy are first isolated by masking the desired portion of the board. The attacked squares are then directly retrieved from the hash tables. Maintaining incrementally updated rotated bitboards becomes unnecessary as does all the updating, mapping and shifting required to access the attacked squares. Finally, rotated bitboard move generation speed is compared with that of the direct hash table lookup method.
No associations
LandOfFree
Avoiding Rotated Bitboards with Direct Lookup does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Avoiding Rotated Bitboards with Direct Lookup, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Avoiding Rotated Bitboards with Direct Lookup will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-367500