Hopreckon
Find the shortest journey on an open word map.
· Replay
How to play
Count the fewest open, one-way arrows from each starting word to its destination. Starting at the destination takes zero arrows. If no directed route exists, choose No route. A closed arrow is unavailable. Count arrows, not visited words.
The printed map or theme register is the complete rule; no live graph, audience prediction or hidden popularity ranking is used.
Edit any answer freely, then submit the complete plan once. Each exact decision earns an equal share of 100 points, rounded to the nearest whole point. Reveal earns 0. Daily changes at 00:00 UTC. This authored collection repeats 8 daily puzzles and has 4 separate practice puzzles. The saved-progress notice shows whether this browser or the server is keeping your progress.
Authored English edition. Printed rules decide every answer; the saved-progress notice shows where your progress is kept.
Plan your answers
Current draft
Declared one-way map
Follow only the arrows shown. A word with no outgoing arrow ends the journey.
Decision review
Progress could not be saved on this device. Keep this page open to retain your attempt.