Fewest gates wins; ties go to whoever solved it first. Only gates that feed an output count. Open inputs read as 0, and a loop that never settles shows X.
About the daily puzzle
Every day at midnight UTC Gatesmith publishes one logic-gate puzzle: a short story, a truth table with two to four inputs, and a set of allowed gates. Build a circuit that reproduces every row of the table using as few gates as you can. The "best known" count was found by an exhaustive search before the puzzle went live, so you always know the target; on days where that search could not prove minimality, beating it is possible and the leaderboard will record it.
Only gates that feed an output are counted. Inputs, outputs, wires and reused signals are free. The Hint button asks our own AI, running on our own hardware, for one sentence about your actual circuit and the rows still wrong; hints are limited per day. Under More puzzles you can forge a fresh puzzle at a chosen difficulty or work through fourteen hand-made practice puzzles that teach the standard circuits.
Missed a day? Every finished puzzle is in the archive with its truth table, the smallest known circuit written out gate by gate, and a walkthrough. New to logic gates? The Learn guides take about twenty minutes in total, and the Gatesmith guide covers rules, scoring and strategy.