Hi,
I am currently programming a chess game using bitboards.
From what I have read on the internet, the best way (at least the most commonly used way) to generate moves for sliding pieces (rooks, bishops, and queens), involves the use of rotated bitboards. However, I cannot seem to come up with or find an efficient way to rotate bitboards.
For people not into chess programming, what I want to achieve is to transform something like:
Code:
11111111 00000000 00000000 00000000 00000000 00000000 00000000 00000000
to:
Code:
10000000 10000000 10000000 10000000 10000000 10000000 10000000 10000000
and:
Code:
00000001 00000001 00000001 00000001 00000001 00000001 00000001 00000001
and:
Code:
00000000 00000000 00000000 00000000 00000000 00000000 00000000 11111111
Is there any efficient way to do this?
Thank you very much.