Skip to content
  1. Home
  2. Games
  3. Coding Games for Kids
  4. Mini Internet

Mini Internet · Coding game for kids

Mini Internet

Tap dotted lines to lay cables, or tap routers one by one to plan a route from computer A to computer B. The packet travels along your route. Find the fewest hops or the fastest time.

Ages 10+18 levels🔊 Sound🗣️ Voice
👶 Ages 10+ 🏁 18 levels 🔊 Sound effects 🗣️ Read aloud 📱 Works on tablets 🆓 Free, no sign-up

Free internet game for kids ages 10–13: lay cables, route data packets, find the fastest path with Dijkstra's algorithm and fix broken links in a mini network.

How to play Mini Internet

Your child runs a tiny internet with two computers, A and B, and a set of routers in between. Every level is about getting a packet (the little envelope) from A to B, and each stage adds one big idea about how networks work.

Levels Stage What your child does
1–3 Lay the cables Tap dotted lines to build a connection. Level 3 has only enough cable for the shortest route.
4–6 Fewest hops Plan routes router by router. Each hop counts.
7–9 Fastest route Cables now have delays in milliseconds. Find the lowest total time.
10–13 Dijkstra by hand Act as the algorithm: finish the router with the smallest number, update its neighbors, repeat until B.
14–16 Broken links A cable snaps while the packet is traveling. Reroute from where it stopped, then rebuild the message from out-of-order packets.
17–18 Unbreakable network Buy cables so that A can still reach B even if any single cable breaks, as cheaply as possible.

Networks are generated randomly, so every round is a fresh puzzle.

What your child learns

Packets and routers. Watching the envelope hop from router to router makes an invisible process visible. Children see that messages travel in steps, that each router only needs to know the next hop, and that a single message can be split into many numbered pieces.

Shortest paths. Counting hops is a gentle first step. Adding delays turns it into an optimization problem where the obvious route is often not the best. Comparing totals is plenty of mental arithmetic practice too.

A famous algorithm. Dijkstra’s algorithm is taught in university computer science courses, yet its core rule is simple enough for a 10-year-old to follow. Doing it by hand, with numbers updating on each router and a table of best times, shows how a computer can find the best route without trying every possibility.

Resilience and redundancy. Networks are built with backup paths so that one cut cable does not take a town offline. In the final levels your child designs for failure: the test button breaks each cable one at a time and reveals any weak spot. It is an engineering mindset that applies far beyond computers.

Sequence numbers. When packets arrive out of order, numbers on each one make it possible to rebuild the message. This is a simplified version of what internet protocols do every second.

Tips for parents

  1. Talk about everyday examples. A video call, a photo sent to grandma or a game update all travel as packets through routers just like these.
  2. Estimate before calculating. On the fastest-route levels, ask your child to guess the best total before tapping. Then compare.
  3. Say the Dijkstra rule out loud. “Smallest unfinished number, finish it, update neighbors.” Repeating it makes the algorithm stick.
  4. Use the hints wisely. After two slower routes, the best one glows. Encourage your child to work out why it is faster.

Offline activities and variations

  • Paper network. Draw towns connected by roads with travel times, then find the fastest route together using the same “finish the closest town” rule.
  • Human packets. Write a short message on cards, one letter per card with a number, shuffle them and pass them around the room. The receiver must put them back in order.
  • Find the weak link. Look at a map of bus or train lines. Which single closed station would cut the network in two?

Common mistakes

  • Choosing the route with the fewest hops on a delay level. Always add up the milliseconds.
  • In Dijkstra, picking the router closest to B instead of the one with the smallest number so far.
  • On the final levels, building two routes that share one cable. That shared cable is still a single point of failure.

Frequently asked questions

What does Mini Internet teach about how the internet works?
Data does not travel as one big lump. It is cut into small packets that hop from router to router until they reach the destination, where they are put back in order. The game shows each of these steps, plus what happens when a cable breaks.
What is Dijkstra's algorithm and is it too advanced?
It is a classic method for finding the shortest path in a network, used in map apps and network routing. The idea fits on one line: always finish the closest unfinished stop next, then update its neighbors. Kids aged 10 and up can do it by hand with the game's help, and the first two Dijkstra levels highlight the right choice.
Why is the fewest-hops route not always the fastest?
Each cable has a delay in milliseconds. A route with more hops can still be quicker if every cable on it is fast. Spotting that difference is the heart of levels 7 to 9.
How are stars earned?
Stars reward optimal routes and few mistakes. A slower route still delivers the packet, but the game asks your child to find a better one, and after two tries it shows the best route as a hint.

More games like Mini Internet

All coding games for kids →