This is a temporary, read-only recovery of the chessprogrammingwiki while a longer-term plan is worked out. Editing is not possible right now, but will be again soon.
Chess Programming Wiki All pages Other namespaces

Rotated Indices

Home * Board Representation * Bitboards * Sliding Piece Attacks * Rotated Indices

Barbara Mittman - Yellow Cherries 1Barbara Mittman - Yellow Cherries 1

  1. Still Lifes by Barbara Mittman↩︎

Rotated indices,
a deconcentrated version of rotated bitboards, proposed by Alessandro Damiani 1 as used in his engine Fortress. Instead of using rotated bitboards with packed 15 diagonals and 15 anti-diagonals each, Alessandro applies an array of 16 + 30 rotated indices for all 16 orthogonal and 30 diagonal lines on the board. Those indices are incrementally updated during make/unmake, which takes a tad more effort - but once updated, the rotated indices pay off, the more often they are used inside a node of the search. No further computation is required to look up attacks, pure indexed memory accesses.

The possible disadvantage - rotated indices, similar or slightly worse than rotated bitboards, are not as versatile as techniques relying on one occupancy bitboard only - if it is about a temporary change of the occupancy on the fly for x-rays and pinned pieces etc..

See also

Forum Posts

References

Up one Level

  1. Re: Rotated bitboards by Alessandro Damiani, rgcc, October 31, 1997↩︎

Categories: Barbara Mittman

What links here

Contributors: GerdIsenberg.