Logic Gate Simulator
Type a Boolean expression. Watch it become a logic circuit.
An online logic gate simulator and Boolean algebra calculator in one. Write a Boolean function the way you would on paper, and its truth table, Karnaugh map and minimized logic circuit appear beside it, updating live as you edit. Then convert to NAND-only or NOR-only, compare the gate count, and probe the circuit: it is drawn from your function, so it always matches what you wrote.
Free to use, with no limits. Create an account to save your work.
From expression to schematic in four moves.
Write the expression
Type the function as you'd write it on paper — a sum of products like A'B'C + ABC. Every other view builds from it.
Read the truth table
All 2ⁿ input combinations are listed with their output, so you can check the function row by row.
Minimize on the K-map
Adjacent 1s are grouped into the largest blocks possible. Each block becomes one product term in the simplified form.
Get the schematic
The minimized expression is drawn as gates — ready to convert, count, and probe on the circuit view.
One function, three forms.
NAND and NOR are universal gates: any circuit can be built from just one of them. On a breadboard that can mean a single chip type instead of several. Logic Gate Simulator does the conversion and counts the gates, so you see the trade-off before you build.
Everything in the simulator.
Live views
Truth table, K-map and schematic stay in step with your expression as you type.
Simplification
Get the minimized form of your function, alongside the K-map groups that produced it.
NAND-only conversion
Rebuild any function from NAND gates alone, with the new gate count shown beside the original.
NOR-only conversion
Rebuild it from NOR gates alone and compare the cost against the other two forms.
Gate and literal counts
See the cost of each form at a glance, so "simpler" always has a number attached.
The circuit, live
F drawn as gates and wires, redrawn as you type. Flip an input and watch which wires carry 1.