What is the hardest puzzle on Puzzle.now?
Asking for the single hardest puzzle is a bit like asking for the hardest sport. It depends entirely on what your brain finds tricky.
Logic that stacks up
Big nonograms are brutal because every wrong guess can cascade into a mess. There is one correct picture and no room for luck, so a large grid demands long chains of careful deduction with no shortcuts to lean on.
Planning far ahead
Tower of Hanoi looks simple with three discs but explodes with more: the minimum move count doubles and then some with each disc you add. Holding that whole recursive plan in your head is a serious mental workout, as our page on the minimum moves shows.
When difficulty is personal
Some people breeze through Lights Out yet freeze on word searches, and others feel the opposite. The hardest puzzle is usually the one that fights your natural strengths, which is exactly why trying a variety of games is the best way to find your own toughest test.
Related questions
What is a nonogram?
A nonogram, also known as Picross, is a grid puzzle solved with number clues along each row and column. Those numbers tell you the lengths of the filled runs in that line. Fill the squares correctly and a hidden picture appears. Each puzzle has one logical solution.
What is the minimum number of moves in Tower of Hanoi?
The minimum number of moves is 2 to the power of n, minus 1, where n is the number of discs. So three discs need 7 moves, four need 15, and ten need 1023. Each extra disc more than doubles the work, which is why big towers get so demanding.
Can a puzzle be unsolvable?
In theory yes, some arrangements genuinely have no solution, such as certain random slide puzzle layouts blocked by parity. But a well-designed puzzle always has an answer by definition. On Puzzle.now, every board we hand you is guaranteed solvable, so you can always finish.