Forge circuits. Beat the par. Come back tomorrow.
Every day the forge hands you a truth table and a short list of gates. Wire a circuit that matches every row, in as few gates as you can. Stuck? Ask the Gatesmith for a hint.
How it works
No account, no download. The whole game runs in your browser.
Read the table
Each puzzle is a story and a truth table: for every combination of inputs, the outputs the circuit must produce.
Wire the gates
Place gates from the allowed set, drag wires from output pins to input pins, and watch your own truth table update live.
Beat the par
Any matching circuit solves it. Fewer gates ranks higher on the daily leaderboard. Only gates that feed an output count.
Learn by doing
Start with the practice set and the short guides: NAND, adders, multiplexers, flip-flops.
Meet the forge
Every puzzle is designed by Gatesmith's own AI, then proven by code before you ever see it.
A new design every night
The forge invents a setting, names the inputs and outputs, writes the rule behind them, and prepares three hints.
Proven, not trusted
The rule becomes a truth table, trivial or repeated designs are thrown out, and a search finds the fewest gates that can build it. That number is the par.
Hints that see your board
Ask for help and the Gatesmith looks at your actual circuit and the rows that are still wrong, then answers in a sentence or two.
Private by design
No account, no tracking of your play. The AI runs on our own hardware, so your circuit is never sent to an outside AI service.
Short guides
Five-minute reads with circuits you can open directly in the simulator.
NAND is all you need
Why one gate type can build every other gate, and how to make XOR from four NANDs.
Half adders and full adders
How computers add: one bit, then a carry, then a whole word.
The multiplexer
A switch made of gates, and why it shows up everywhere from memory chips to video routing.
Latches and flip-flops
How a loop of gates remembers a bit, and what a clock edge really does.