loading...
arrow keys or swipeswipe to slide every tile
same + same = same
different numbers need a gate
NOT the max: overflow bonus
score = result in decimal
CLASSIChow many bits?
enter your initials:
Final Score: 0
You count with ten digits, 0 to 9. A computer counts with two, 0 and 1. That is all binary means.
Think of a tile as four lamps in a row, each on (1) or off (0). Each lamp is worth double the one to its right: 8, 4, 2, 1. The number on the tile is whatever the lit ones add up to.
Four lamps is why 4-bit tops out at 15. Two lamps top out at 3, eight lamps at 255. That is the whole of the bit modes.
Before any of it touches a whole number, a gate is a rule about one lamp against one lamp: two in, one out. There are only four rules, and each is four lines long. Read them as "in, in, out".
A gate does not know what 5 is. It takes the two tiles' lamps column by column, applies that one rule four times, and reads the answer back as a number. Nothing carries the way addition carries.
Column 1: both lamps on, XOR says off. Column 2: one on, one off, so on. Column 4: one on, so on. Column 8: neither, so off. That is 0110, which is 6.
The same two tiles through the other two gates. Same lamps, different rule, different number out:
And NOT needs only one tile: it flips all four lamps. ¬5 is 0101 flipped to 1010, which is 10.
That is all of binary and all four gates. Everything past here is the game.
Just as in 2048, use arrow keys or swipe to move tiles on a 4 by 4 grid in any direction.
As a warm up, play 2048 (actually, 2^N) at magmacrunch.com/arcade!
same + same = same (idempotence)
different numbers need gates
e.g., you cannot merge 1 + 2 directly; you must use tiles with logic gates (⊕ ∨ ∧ ¬).
gate usage:
The N-bit mode has a maximum value (2^N - 1):
¬ MAX = OVERFLOW BONUS!
• bitwise operations never exceed the maximum, but ¬ NOT of the max value is 0, and no tile can hold 0
• that tile disappears (clears space) and awards a 3× max value bonus
• this is the only way to overflow
• e.g., in 2-bit: ¬11 = 00 → overflow! +9 pts
• e.g., in 4-bit: ¬1111 = 0000 → overflow! +45 pts
This is the ultimate survival mode with escalating difficulty!
how it works:
example progression:
Start: 2-BIT, max = 3
Merge: 1 OR 2 to get 3
UPGRADE! now 3-BIT, max = 7
Merge tiles in another way to create 7
UPGRADE! now 4-BIT, max = 15
...and so on through 8-BIT!
example (4-bit): first time reaching 15 → +15 pts + 30 bonus = 45 pts total!
"No general method for the solution of
questions in the theory of probabilities
can be established which does not
explicitly recognize […] those universal
laws of thought which are the basis
of all reasoning."
George Boole, 1854
Turns off visual effects to save power.
creditsgame by:
magmacrunch media
music:
"George Boole Has Entered the Chat" by Juanito Thompson
sound effects:
Played on a MOOG GRANDMOTHER synthesizer
original concept:
Inspired by Gabriele Cirulli's 2048 (2014), reimagined with Boolean logic instead of addition.
built with:
HTML5, CSS3 and vanilla JavaScript · Web Audio API · Press Start 2P by CodeMan38 · adenosine
named in honor of:
George Boole (1815-1864), father of Boolean logic
cheapness impact factor:
2.4
last updated:
September 17, 2026