A circuit logic game lets you build real Boolean circuits by connecting source outputs to gate inputs and routing the result to a final output that must read TRUE. Logic Gate Puzzle is exactly that: a deterministic, browser-based puzzle where you wire source nodes, AND, OR, and NOT gates, and a final OUTPUT card across five fixed levels. You don't solve multiple-choice questions or pick a single answer; you physically construct the directed graph on the board, one OUT-to-IN connection at a time. Every level declares immutable source values and a fixed arrangement of gates, and your job is to fill every gate input and route every gate toward the final OUTPUT so the whole circuit evaluates to TRUE. Each solved level awards 200 points, and all five levels together produce a perfect score of exactly 1,000 points. There is no timer, no random source value, and no partial-credit formula — just five reproducible boards and a strict graph engine that rejects malformed connections without recording an error.
What the Logic Gate Puzzle Is
Logic Gate Puzzle is a five-level directed-circuit game built around three fundamental digital operations: AND, OR, and NOT. Each board gives you fixed binary sources, one or more gate cards, and a final OUTPUT card. Your task is not to answer a multiple-choice question. You must construct an actual directed graph by wiring output ports to input ports until the complete circuit evaluates to TRUE. Every connection follows a visible OUT-to-IN rule: select an OUT port on a source or gate, then select an empty IN port on a gate or the final OUTPUT. One output may fan out to more than one destination, which is essential in the opening AND level. Each input accepts exactly one driver. Clicking a filled input while no output is selected disconnects that wire, so a recoverable wrong circuit can be edited without restarting. The level names, source arrangements, graph layouts, and interface are original game content rather than randomly generated exercises.
How to Wire a Circuit Step by Step
The first level introduces an AND gate with one TRUE source and one FALSE distractor. AND returns TRUE only when both of its inputs are TRUE, so the useful source must fan out to both input ports. The second level introduces OR, which returns TRUE when either input is TRUE. Its three sources encourage you to route one TRUE signal while still filling both required gate ports. The third level focuses on NOT. An inverter has one input and produces its opposite, so a FALSE source becomes TRUE. Later levels combine gates: one circuit inverts a FALSE source before joining it with a TRUE source through AND, while the final circuit feeds an OR branch and a NOT branch into a last AND gate.
- Identify the declared SOURCE nodes, the gate cards, and the final OUTPUT card on the board.
- Read the gate rules — which inputs must be driven, what the gate returns, and which sources are TRUE or FALSE.
- Select an OUT port on a SOURCE or a gate; it becomes your active driver and is shown in the directed wire ledger.
- Select an empty IN port on a gate or the final OUTPUT to draw the wire; the connection is added to the ledger as FROM to TO.
- Repeat the OUT-then-IN sequence until every gate input has exactly one driver and every gate output has a directed path to OUTPUT.
- Click a filled IN while no OUT is selected to disconnect and revise a wire without losing the rest of the graph.
- Watch the final OUTPUT flip to TRUE — the level solves for exactly 200 points.
The Three Gates and Their Truth Tables
The graph engine resolves the circuit from the final OUTPUT backward through its drivers. Source nodes provide fixed Boolean values, and each gate applies a documented rule. AND requires two inputs and returns true only when both are true. OR requires two inputs and returns true when either is true. NOT requires exactly one input and reverses it. These are the four AND rows, the four OR rows, and the two NOT rows below, all of which the game's evaluation engine implements directly. The same gate definitions are documented in two accessible electronics references, including the Northwestern Mechatronics page on logic gates and the MIT OpenCourseWare introduction to digital signals.
| Gate | Input A | Input B | Output |
|---|---|---|---|
| AND | TRUE | TRUE | TRUE |
| AND | TRUE | FALSE | FALSE |
| AND | FALSE | TRUE | FALSE |
| AND | FALSE | FALSE | FALSE |
| OR | TRUE | TRUE | TRUE |
| OR | TRUE | FALSE | TRUE |
| OR | FALSE | TRUE | TRUE |
| OR | FALSE | FALSE | FALSE |
| NOT | TRUE | — | FALSE |
| NOT | FALSE | — | TRUE |
Scoring, Mistakes, and the Deduplication Rule
A graph is evaluated only when every declared gate input and the final OUTPUT input have exactly one incoming wire. Every gate output must also have a directed path to the final output. Partial diagrams remain editable and do not count as mistakes. 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 rejected without changing the board. The game never guesses a value for a missing port and never evaluates a cyclic graph.
Completing a graph with TRUE at the final output solves the level for exactly 200 points. Five solved circuits therefore produce an exact perfect score of 1,000. There is no timer, speed bonus, random source value, hidden multiplier, adaptive difficulty, or partial-credit formula. Restart always returns to the same first board with empty wires and zero score. A complete FALSE circuit records one recoverable graph error — disconnect a wire and try another valid topology. Rebuilding exactly the same wrong edge set is deduplicated, so it cannot consume another error. A second distinct complete graph that also produces FALSE closes the run. Structural rejections do not count as logical errors because they never enter the graph.
Controls, Accessibility, and Shortcuts
Pointer and touch players use large source, gate, input, and output buttons. Keyboard play uses Tab to move through every port and Enter or Space to select an output, connect an input, or disconnect an occupied input. 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. A double-press on Escape opens a simulated spreadsheet boss screen, then the same shortcut returns you to the unchanged circuit. Everything runs locally in the browser, so there is no account requirement, no download, no upload, no API call, no remote solver, and no personal data — only the shared best completed score may remain in this browser.
Why This Works as a Circuit Logic Game
A circuit logic game has to feel like wiring, not like guessing. Logic Gate Puzzle commits to that: you physically connect ports, see the directed wire ledger grow, and watch the final output settle into TRUE or FALSE based on the truth tables above. The puzzles are fixed rather than generated, so the same five circuits produce the same 1,000-point route on every run. Players who enjoy solving circuits under pressure may also enjoy the bomb-defuse game rules walkthrough for five circuits, which applies a different connection-and-deduction workflow to its own five boards. This page makes no claim to simulate transistor timing, voltage thresholds, propagation delay, electrical loading, or physical hardware — it is a Boolean graph puzzle for entertainment and introductory practice.
For a deeper look, see Logic Grid Puzzle Without Downloading: Browser-Based Play.