Changes

'''Sliding Pieces''' can move an indefinite number of [[Squares|squares]] along a [[Ranks|horizontal]], [[Files|vertical]], or [[Diagonals|diagonal]] line until the edge of the board or another piece obstructs the [[Rays|ray]] of a line. This applies for [[Bishop|bishops]], [[Rook|rooks]] and [[Queen|queen]]. Sliding piece [[Move Generation|move generation]] is more extensive than generation of none sliding [[Knight|knight]], [[Pawn|pawn]] or [[King|king]] moves. With board arrays it requires a loop along the ray, scanning each square for emptiness to continue, or [[Occupancy|occupancy]] by own or opponent piece to break, combined with an off the board test to terminate the ray loop as well. However, such a loop may be designed in an efficient way generalized for all pieces as broached in [[Table-driven Move Generation]] and in [[Bruce Moreland|Bruce Moreland's]] ''Programming Topics'' <ref>[http://web.archive.org/web/20070715002634/www.brucemo.com/compchess/programming/movetable.htm Move Table move generation] from [[Bruce Moreland|Bruce Moreland's]] [http://web.archive.org/web/20070607231311/www.brucemo.com/compchess/programming/index.htm Programming Topics]</ref>. With [[Bitboards|bitboards]] one relies on the various techniques to [[Sliding Piece Attacks|generate attack sets]], which further requires [[Bitboard Serialization|serialization]] to finally [[Encoding Moves|encode moves]] in move generation.

=See also=