Editing Bitboard (section)

====Pros====
Bitboards require more memory than piece-list board data structures, but are more execution efficient because many loop-and-compare operations are reduced to a single (or small number of) bitwise operation(s). For example, in mailbox, determining whether ''piece'' attacks ''space'' requires generating and looping through legal moves of ''piece'' and comparing the final space with ''space''.  With bitboards, the legal moves of ''piece'' are stored in a bitmap, and that map is ANDed with the bitmap for ''space''.  A non-zero result means that ''piece'' attacks ''space''.