Hidato
Loading Hidato…
The game didn't start. It may be blocked by your browser or network. Try again, or play something similar:
This game is made for landscape. Turn your phone sideways for the best view.
Play next
More Puzzle
A logic puzzle where you fill a grid with consecutive numbers from 1 to N such that each number is in a…
About Hidato
A logic puzzle where you fill a grid with consecutive numbers from 1 to N such that each number is in a cell adjacent (orthogonal or diagonal) to the next consecutive number. Invented by Dr. Gyora Benedek.
Description provided by GameZipper.
How to play
- Find the endpoints. The numbers 1 (smallest) and N (largest) are always pre-filled. These are your chain's start and finish.
- Tap an empty cell to open the number picker. Choose the number that extends the chain from the last placed number.
- 8-direction adjacency: cells touch if they share a side or a corner — so you can move diagonally to escape tight spots.
- Use hints when stuck. You start each level with 3 hints. The hint fills one cell with the correct number.
- Win condition: When all cells are filled and the chain 1→N is continuous (no broken links), you win! Earn up to 3 stars based on time and hint usage.
Controls
This game supports touch, keyboard, mouse input; the exact controls are explained inside the game.
Questions
- What is Hidato?
- Hidato (a.k.a. Number Snake) is a logic puzzle invented by Israeli mathematician Dr. Gyora M. Benedek. The goal is to fill the grid with consecutive numbers from 1 to N such that each number is adjacent to the next — horizontally, vertically, or diagonally — forming a single connected chain.
- How do you play Hidato?
- Tap any empty cell to open the number picker, then choose the number that fits the chain. Adjacent cells include the 8 neighbors (orthogonal and diagonal). The first (1) and last (N) numbers are always pre-filled. Build a continuous path from 1 to N.
- Is Hidato difficult?
- Hidato ranges from easy (5x5) to expert (10x10). Start small, look at where the chain is broken, and use diagonal moves to escape dead ends. A helpful trick: count the gap between the highest filled number and N to estimate the remaining length.
