×
[bitmask] is a logic puzzle where you must find the unique grid of 0s and 1s that satisfies all given masks. each mask requires a specific number of overlapping 1s between your grid and its pattern. think of it as a binary sudoku where numerical constraints interact to reveal a single solution.
cell states
inactive
default state (0)
empty
inactive cells that are not part of the mask pattern
mask pattern
inactive cells that will count toward the mask objective when active
active (non-overlapping)
cells that are active but are not part of the mask pattern. these do not count toward or against the mask objective
active (overlapping)
cells that are active and are part of the mask pattern. these count toward the mask objective
mask objective
each mask has a target count that you must match. the count represents how many cells should be active (1) in both your grid AND the mask pattern
too low (blue)
you need more overlapping 1s to reach the target
satisfied (green)
you have exactly the right number of overlapping 1s
too high (orange)
you have too many overlapping 1s and need to deactivate some
example
your grid
1
0
0
1
0
0
1
0
1
0
0
0
0
1
0
0
mask A
1
0
0
1
0
0
0
0
1
0
0
0
0
0
0
1
in this example:
- there are three cells that are both active in your grid AND part of the mask pattern (the green ones)
- the objective is 4, so you need one more overlapping 1
- the bottom-right cell of your grid can be activated to satisfy the mask
summary
to complete the puzzle:
- toggle cells in your grid to create a pattern of 0s and 1s
- watch the labels on each mask to see the effect of your changes
- all five masks must be satisfied simultaneously to solve the puzzle
- when all masks are green, click "submit" to check your solution
every puzzle has exactly one unique solution.
take your time, experiment with different patterns, and have fun!