It’s good that we can assume magic bitboard functions are available, but in general bitboard move generation functions can accept any technique that produces a bitboard that gives the possible squares to move to. Say RookMoves is such a function, then you would populate the move list as follows:
What does a move board do in chess?
The move board is the resulting available moves for your piece, for a given blocker board. This includes possible captures for your piece. Note that it also includes capturing your own pieces (but you can just AND it with a NOT of your own piece locations to remove those).
What does one bit mean on a bitboard?
A one-bit inside a bitboard implies the existence of a piece of this piece-type on a certain square – one to one associated by the bit-position. Of course bitboards are not only about the existence of pieces – it is a general purpose, set-wise data-structure fitting in one 64-bit register.
Do you need a magic bitboard to make a sliding piece?
Of course, you might need to check whether it obeys the movement rules for the piece but that is trivial. Simply put, magic bitboards are an efficient way to take a position and obtain the legal moves for a sliding piece. First, you need to find some magic numbers.
What do you need to know about magic bitboards?
Simply put, magic bitboards are an efficient way to take a position and obtain the legal moves for a sliding piece. First, you need to find some magic numbers. Some of the code you write to find the magic numbers will also be re-used when you use the magic numbers. To start off, you need to write 5 functions.
Is the move board the same as the blocker board?
A blocker board is always a subset of the blocker mask (it needn’t show pieces on other squares (e.g., blockers = occupancy & blockermask; )). The move board is the resulting available moves for your piece, for a given blocker board.
