GlobeHoppr – find a route between cities using limited-distance jumps
GlobeHoppr – find a route between cities using limited-distance jumps
Hi HN, I built a game where you have to travel from point A to B by hopping through intermediate cities. Each jump has a maximum range, so you can’t simply select the destination. You need to build a route through cities that are close enough together, using as few jumps as possible. It sounds straightforward until you need to cross a part of the world where you only know one or two cities. I’ve found that the game exposes a different kind of geographical knowledge: not just knowing where countries are, but understanding how cities connect across a region. There’s a fixed daily route that everyone can compare, along with unlimited practice games, weekly challenges and multiplayer. I hope people enjoy it and I would love any feedback!
Share cardActual performance
Launch Intel predictions
Analyze your own launch →Correct prediction on native model
Similar products
PySdfScad,an openSCAD interpretor using signed-distance-functions
I mapped what's within walking distance for European cities using OSM
Metro Route Planner For Indian Cities
Free Multilingual Distance & Route Calculator
How many U.S. cities can you name?
Golang pkg get the distance between two geographic lat, lon coordinates
Minus 2.0: Subtract the Distance
Create sightseeing route in each city in the world
Standalone KeystoneJS route callbacks
A gem that fixes Ruby NameErrors using Lewenstein distance and ast search