XOR
Default action. Flips bits wherever the mask has 1s (1 → 0, 0 → 1).
Purge a volatile memory buffer before it overflows. Manipulate falling 4-bit masks, escalate to 8-bit widths as the board widens, and keep the mainframe stable for as long as possible.
Bitmasks are fixed-width strings of 1s and 0s that pack multiple boolean states into a single integer. Each bit is a toggle that can be tested with AND, set with OR, flipped with XOR, or inverted with NOT.
Every board row and falling piece in Bitmask starts as a four-bit mask where 1 marks an energised cell and 0 marks an inert cell. As you purge memory lanes, the bus widens to five, six, seven, then eight bits. Applying operations between masks drives the puzzle: XOR flips overlapping bits, AND carves away energised cells, and OR fuses new ones for deterministic, readable outcomes.
Default action. Flips bits wherever the mask has 1s (1 → 0, 0 → 1).
Keeps bits only where both row and mask have 1s, stripping everything else.
Fills bits to 1 wherever the mask carries 1s, perfect for setup plays.
Inverts every bit. Reserved for future corruption events and advanced modifiers.
You will mostly rely on XOR. Spend tokens to switch to AND or OR in sticky situations and earn them back every ten cleared rows.
Example: Current row 0101, mask 1100 → XOR = 1001, AND = 0100, OR = 1101.
Flip every bit in a row to 1 to purge it from the memory buffer before overflow. Each purge accelerates the clock and expands the lane width from 4 to 8 bits, pushing precision and foresight.
Share your thoughts, bug reports, or ideas below. If the form does not appear, open the feedback portal directly.