Every daily puzzle so far, with its answer
Gatesmith publishes one logic-gate puzzle a day: a short story, a truth table, and a challenge to build a circuit that matches it with as few gates as possible. Once a day is over, its puzzle lands here with the smallest known circuit, a walkthrough of why that circuit works, and the leaderboard as it stood. If you missed a day you can still replay it from each page; late solves do not join that day's leaderboard.
The list
| No. | Title | Day (UTC) | Difficulty | Size | Best known | Solvers |
|---|---|---|---|---|---|---|
| 8 | The Dragon Guard | 2026-10-23 | easy | 3 in, 1 out | 3* | 0 |
| 7 | The Workshop Alarm | 2026-10-22 | easy | 3 in, 1 out | 3* | 0 |
| 6 | The Tram Line Switch | 2026-10-21 | easy | 3 in, 1 out | 3 | 0 |
| 5 | The Radio Signal Filter | 2026-10-20 | easy | 3 in, 1 out | 2* | 0 |
| 4 | The Bakery Oven Timer | 2026-10-19 | easy | 2 in, 1 out | 2* | 0 |
| 3 | The Vault Breaker | 2026-10-18 | hard | 4 in, 2 out | 13* | 0 |
| 2 | The Lighthouse Beacon | 2026-10-17 | medium | 3 in, 1 out | 5* | 0 |
| 1 | The Greenhouse Sprinkler | 2026-10-16 | medium | 3 in, 2 out | 4 | 0 |
How a daily puzzle is made
Each night a puzzle designer, an AI running on our own hardware, writes a story and one Boolean rule per output. Nothing it writes is trusted. The server parses each rule into a truth table, throws the puzzle away if any output is constant, equal to a single input, or a repeat of a recent day, and then runs an exhaustive search over small circuits to find the fewest gates that can build it from the allowed set. That count becomes the "best known" par. If the search hits its limit before proving minimality, the par is marked with an asterisk here and the game says "best known" rather than "optimal". If the designer is unreachable at midnight, a hand-made puzzle from the practice bank takes the day, so the archive never has a gap.
Reading the answers
Each archive page shows the reference circuit as a numbered list of gate equations: g1 = POWER OR DRILL, g2 = NOT SAFETY, and so on, ending with which signal feeds each output. Reading a circuit this way is how engineers write netlists, and it maps one-to-one onto what you would draw in the simulator. The walkthrough under the table is computed from the truth table itself: how many rows switch the output on, which inputs actually matter, and whether the output is secretly just a copy or an inversion of one input. New to gates? Start with the Learn guides.