AND Gate (6 cards)
The AND gate takes two inputs and produces a single output. It only outputs 1 when both inputs are 1; in all other cases, it outputs 0. This gate is fundamental for implementing logical conjunction operations in digital circuits.
| Input A | Input B | Output |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 0 | 0 |
| 1 | 1 | 1 |
OR Gate (6 cards)
The OR gate accepts two inputs and generates one output. It outputs 1 if either input is 1, or if both inputs are 1. It only outputs 0 when both inputs are 0. This gate represents logical disjunction.
| Input A | Input B | Output |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 1 |
XOR Gate (5 cards)
The XOR (exclusive OR) gate takes two inputs and produces one output. It outputs 1 only when the inputs differ from each other. When both inputs are the same (both 0 or both 1), it outputs 0.
| Input A | Input B | Output |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 0 |
NOT Gate (6 cards)
The NOT gate is the simplest logic gate, taking a single input and producing one output. It inverts or flips the input bit, outputting 1 when the input is 0, and outputting 0 when the input is 1.
| Input | Output |
|---|---|
| 0 | 1 |
| 1 | 0 |
NAND Gate (3 cards)
The NAND gate operates on two inputs to produce one output. It functions as the opposite of the AND gate, outputting 0 only when both inputs are 1, and outputting 1 in all other cases.
| Input A | Input B | Output |
|---|---|---|
| 0 | 0 | 1 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 0 |
NOR Gate (3 cards)
The NOR gate takes two inputs and produces one output. It is the inverse of the OR gate, outputting 1 only when both inputs are 0, and outputting 0 when either or both inputs are 1.
| Input A | Input B | Output |
|---|---|---|
| 0 | 0 | 1 |
| 0 | 1 | 0 |
| 1 | 0 | 0 |
| 1 | 1 | 0 |
MULTIPLEXER (3 cards)
The MULTIPLEXER gate has three inputs: two data inputs and one selector input, producing a single output. The selector input determines which of the two data inputs is passed through to the output, effectively choosing between two signal paths.
| Data A | Data B | Selector | Output |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 0 | 1 | 0 | 0 |
| 1 | 0 | 0 | 1 |
| 1 | 1 | 0 | 1 |
| 0 | 0 | 1 | 0 |
| 0 | 1 | 1 | 1 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 1 | 1 |
SPLITTER (3 cards)
The SPLITTER gate takes one input and produces two identical outputs. It duplicates the input value to both output channels, allowing a single signal to be distributed to multiple destinations.
| Input | Output 1 | Output 2 |
|---|---|---|
| 0 | 0 | 0 |
| 1 | 1 | 1 |
BIT FLIP (3 cards)
Flip any one coin on the table.
ELECTRON STEAL (2 cards)
Take one coin from an opponent's reserve and add it to yours. You can play this coin, but it still belongs to the original owner.
QUANTUM SWAP (2 cards)
Swap any two coins on the table.
QUANTUM JUMP (3 cards)
Move one of your coins to any position on the table.
POLARITY REVERSAL (2 cards)
Flip all coins on a single gate (inputs and outputs).
INTERFERENCE (3 cards)
Remove one coin from any gate input and return it to its owner's reserve.
On your turn, choose one action:
When a gate has all its inputs filled, a gate activation is triggered immediately after its final input coin is placed.
When activated, the selector input (middle) determines which data input (left = 0, right = 1) passes through. The selector is passed to the output line as is.
Splitter is a powerful card that duplicates your signal. When it's activated, use a coin from your reserve to place in its output. If no coins remain in your reserve, you have to move one of the coins from the circuit board to the splitter's output.
Coins do not change hands, even in the case of Quantum Swap action cards being played.
The game ends when all players pass consecutively (everyone chooses to pass instead of taking an action).
Players might pass when:
Count all coins showing 1 anywhere on the circuit board.
Winner: Player with the most 1s.
Tie-breaker: Don't be overcompetitive, just acknowledge a shared win!