Fairy-chess leaper puzzle — hop from S to G with (3,1) antelope moves
You get an N×N grid with walls (darker cells), an orange S (start) and a golden G (goal). Draw a path from S to G using only antelope moves — a (3,1) leaper (8 directions, single hops). Walls block the path. Each puzzle has a unique shortest path. Find it in the minimum number of hops for 3 stars!
⭐ Beginner (6×6) → ⭐⭐ Easy (7×7) → ⭐⭐⭐ Medium (8×8) → ⭐⭐⭐⭐ Hard (9×9) → ⭐⭐⭐⭐⭐ Expert (10×10)
SELECT LEVEL
L1
⏱0:00
↦0
LEVEL COMPLETE!
★★★
Solved in 0s
0 moves · optimal
Click extend path (antelope hops only)U undoEnter checkR restartH hint
How To Play Antelope Path
You get an N×N grid with walls (darker filled cells are impassable), an orange S marker (start), and a golden G marker (goal).
Your task is to draw a path from S to G using only antelope moves: a (3,1) leaper that hops 3 rows + 1 column or 1 row + 3 columns in any direction (8 directions total). Each hop lands on a single cell — no sliding.
Tap the orange S marker to begin. The path starts there.
Tap any cell that is a single antelope hop (3+1 or 1+3 cells) from your last cell to extend the path.
You cannot step on walls (darker filled cells) or revisit a cell.
Reach the G marker to win. Each puzzle has a unique shortest path — solve in the minimum number of hops for 3 stars!
Controls:
Tap / click — extend the path to an antelope-reachable cell.
U / Backspace — undo last step.
Enter — check whether your path reaches the goal.
R — restart the level.
H — extend along the optimal path (3 hints per level).
Esc — back to level select.
Scoring: 3 stars for finishing in the optimal number of hops with no hints. Sub-optimal paths still complete the level but with fewer stars.