Changes

Jump to: navigation, search

Shifted Bitboards

23 bytes added, 13:09, 23 January 2021
no edit summary
'''Shifted Bitboards''',<br/>
an method to determine sliding piece attacks introduced by [[Neels Groenewald]] as implemented in his engine [[NagaSkaki]] <ref>[https://web.archive.org/web/2011101202102420120104163142/http://www.mayothi.com/nagaskakichess5nagaskakichess6.html How NagaSkaki plays chess - The thinking processMove generation] ([https://en.wikipedia.org/wiki/Wayback_Machine Wayback Machine], January 04, 2012)</ref>.
The idea is original and does not need huge memory tables. However, with the proposed 56 64-bit operations for either rook and bishop attacks its [[Space-Time Tradeoff|space-time tradeoff]] seems not that advantageous with respect to time, which looks more in the range of set-wise [[Fill Algorithms|fill algorithms]] for multiple sliders, like [[Dumb7Fill|dumb7fill]] or its parallel prefix [[Kogge-Stone Algorithm|Kogge-Stone]] pendant.
=External Links=
* [https://web.archive.org/web/2011101202102420120104163142/http://www.mayothi.com/nagaskakichess5nagaskakichess6.html How NagaSkaki plays chess - The thinking processMove generation] ([https://en.wikipedia.org/wiki/Wayback_Machine Wayback Machine], January 04, 2012)* [http://mysite.mweb.co.za/residents/lollapot/homepagenagaskaki_chess.html How NagaSkaki: A Free plays chess program for Windows] (20032002, NagaSkaki 2.0)
=References=
<references />
'''[[Sliding Piece Attacks|Up one Level]]'''

Navigation menu