Logic Gate Puzzle is a deterministic, browser-based five-level directed-graph game that awards exactly 1,000 points when you wire AND, OR, and NOT gates so every final output evaluates to TRUE. The game hands you fixed binary sources, one or more gate cards, and a final OUTPUT card on each board. Your job is not to pick an answer from a list. You draw an actual directed graph by selecting an OUT port on a source or gate and then choosing an empty IN port on a gate or the final OUTPUT. Connections follow a visible OUT-to-IN rule, and the game only evaluates the circuit when every declared gate input and the final OUTPUT input has exactly one incoming wire. Five fixed puzzles progress from a single AND gate to a final circuit that combines OR and NOT branches into a final AND gate. There is no timer, no random source value, no hidden multiplier, and no partial credit — solve all five TRUE for the perfect score.
The Wiring Rules of the Logic Gate Game
Every level in Logic Gate Puzzle exposes three kinds of nodes: immutable SOURCE nodes with fixed Boolean values, gate cards (AND, OR, or NOT), and a final OUTPUT card. You build the circuit by selecting an OUT port on a source or a gate and then choosing an empty IN port on a gate or the final OUTPUT. The selected output is highlighted both visually and in text, and each connected input names the driver that currently fills it.
Two structural rules make almost every wiring decision correct. First, each IN accepts exactly one driver. You cannot stack two sources into the same input port. Second, an OUT may fan out to more than one destination. That fan-out is essential in the opening AND level, where the same TRUE source must reach both input ports of the gate. Once you grasp those two rules, the rest of the board is mostly about choosing which source goes where.
The validator rejects malformed connections without changing the board. Unknown ports, input-to-input attempts, output-to-output attempts, self-links, a second driver for an occupied input, duplicate edges, and directed cycles are all refused at once. None of these rejections count as a logical error, because they never enter the graph. The only way to record a logical mistake is to complete a valid graph whose final output evaluates to FALSE.
If you wire something wrong, click a filled IN port while no OUT is selected to disconnect that single wire. The rest of your graph stays intact, so a recoverable wrong circuit can be edited in place rather than rebuilt from scratch.
Truth Tables Used to Evaluate Every Circuit
The evaluation engine resolves the graph from the final OUTPUT backward through its drivers and applies the published Boolean truth tables. The AND table requires two inputs and returns TRUE only when both are TRUE. The OR table also requires two inputs and returns TRUE when either input is TRUE. The NOT table accepts exactly one input and returns its opposite. The game never guesses a value for a missing port and never evaluates a cyclic graph, so a partial diagram simply remains editable.
| Gate | Input A | Input B | Output |
|---|---|---|---|
| AND | FALSE | FALSE | FALSE |
| AND | FALSE | TRUE | FALSE |
| AND | TRUE | FALSE | FALSE |
| AND | TRUE | TRUE | TRUE |
| OR | FALSE | FALSE | FALSE |
| OR | FALSE | TRUE | TRUE |
| OR | TRUE | FALSE | TRUE |
| OR | TRUE | TRUE | TRUE |
| NOT | — | FALSE | TRUE |
| NOT | — | TRUE | FALSE |
These are the exact truth-table rows the game engine uses to score each level. The same Boolean behavior is documented by an MIT OpenCourseWare introduction to digital electronics and the Northwestern Mechatronics wiki on logic gates.
How to Solve All Five Levels in Logic Gate Puzzle
The five fixed levels in Logic Gate Puzzle progress from a single AND gate to a final circuit that mixes OR and NOT branches into a final AND. The exact source arrangement on every level is fixed, so the same topology solves the same board every run.
- Level 1 — AND with one TRUE and one FALSE source. The AND gate returns TRUE only when both inputs are TRUE. Select the OUT port on the TRUE source and connect it to AND's first IN. Select the same OUT again, then connect it to AND's second IN. The FALSE distractor is unused. The TRUE source fans out to both AND inputs.
- Level 2 — OR with three sources. OR returns TRUE when either input is TRUE. Identify one TRUE source, route it to OR's first IN, then route the same TRUE source (using fan-out) to OR's second IN. The remaining sources are unused.
- Level 3 — NOT with a single FALSE source. A NOT gate has exactly one input and produces its opposite. Wire the FALSE source into the NOT input. The NOT output becomes TRUE. Connect the NOT OUT to the final OUTPUT IN.
- Level 4 — NOT feeding AND. This level inverts a FALSE source before joining it with a TRUE source through AND. Wire the FALSE source into the NOT input, then route the NOT OUT into the first AND input. Wire the TRUE source into the second AND input. Because the NOT flipped FALSE to TRUE, both AND inputs are now TRUE, so the gate produces TRUE.
- Level 5 — OR and NOT branches into a final AND. The board feeds an OR branch and a NOT branch into a last AND gate. Build each branch first: route the relevant sources so the OR output is TRUE and the NOT output is TRUE, then connect both branch outputs into the two IN ports of the final AND. Both branches must evaluate to TRUE for the final AND to return TRUE.
Completing any single level with TRUE at the final output awards exactly 200 points. Five solved circuits therefore produce an exact perfect score of 1,000. The graph is evaluated automatically once every declared gate input and the final OUTPUT input has exactly one incoming wire; partial diagrams remain editable and do not count as mistakes.
Mistakes, Scoring, and the Two-Error Limit
Logic Gate Puzzle runs a strict recovery model. Only a complete valid graph whose output is FALSE records an error. That single mistake is recoverable: click the offending filled IN to disconnect one wire, choose a different driver, and try another valid topology. The game keeps a sorted edge signature of every FALSE graph you produce, so rebuilding exactly the same wrong edge set is deduplicated and cannot consume another error.
A second distinct complete graph that also produces FALSE closes the run. There is no partial-credit formula and no speed bonus. The only failure path is the two-error cap, and every wrong graph must differ from every other wrong graph by at least one edge for the cap to advance. Restart always returns to the same first board with empty wires and zero score, so the deterministic restart is by design and the only meaningful choices happen during the run itself.
The double-press Escape shortcut opens a simulated spreadsheet boss screen and returns you to the unchanged circuit when you repeat it, which is useful when you need to step away from the board without losing your wiring work.
Keyboard, Touch, and Pointer Controls
The interface uses large source, gate, input, and output buttons so pointer and touch players can tap each step. The selected output is visually and textually identified, every connected input names its driver, and a directed wire ledger lists each edge as FROM to TO. The ledger is the fastest way to confirm that every declared IN has exactly one driver before you evaluate.
Keyboard players get a complete route: Tab moves through every port, and Enter or Space selects an output, connects an input, or disconnects an occupied input. The Tab focus order follows the visible board, so you can walk through the same wiring plan you would tap with a mouse. Everything runs locally in the browser, and there is no account, download, upload, API, remote solver, model, external asset, random service, or personal data — only the shared best completed score may remain in this browser.
Why Logic Gate Puzzle Is the Logic Gate Game You Want
Many so-called logic gate games hide the Boolean work behind multiple-choice questions or random generators. Logic Gate Puzzle instead asks you to construct an actual directed graph. You select real OUT ports, draw real wires into real IN ports, and the validator either accepts the topology or rejects it. The five fixed boards — AND, OR, NOT, NOT-plus-AND, and OR-plus-NOT-into-AND — give you a clean progression from one gate to a multi-branch circuit without ever drifting into vague puzzle territory.
The game stays grounded in a single, narrow claim: it is a Boolean graph puzzle for entertainment and introductory practice. It makes no claim to simulate transistor timing, voltage thresholds, propagation delay, electrical loading, or physical hardware, so you can focus on the wiring logic itself. If you want a deeper companion walkthrough of the same five boards from a puzzle-by-puzzle angle, the Circuit Logic Game: Five Boolean Puzzles to TRUE guide covers the same levels side by side.
Related games on the site offer different connection and deduction challenges without replacing this directed logic-gate workflow, so Logic Gate Puzzle stands out as the page that actually makes you draw wires instead of guessing outputs.