bit manipulation - Generating Moves from Bitboard

Question

Example: Noughts and Crosses Say I have a bitboard for all occupied squares and using a mask I generate a Bitboard of all unoccupied squares by xoring it with a mask:

010       111        101
111   ^   111   =>   000
000       111        111

How do I now generate all possible moves from that new Bitboard? Simply by iterating over every new bit? Wouldn't that defeat the efficiency purpose of the Bitboards all together?

question from:https://stackoverflow.com/questions/65645547/generating-moves-from-bitboard

Answer 1

Waitting for answers