Dijkstra’s Algorithm
Paint roads, forest, mud and walls. Find the cheapest route from camp to tower.
- Weighted Maze
- Weighted Data Tables
- 5 chapters
Myth Engine
Try the free demoFree demo
Learn computer science through games and puzzles.
Paint roads, forest, mud and walls. Find the cheapest route from camp to tower.
Slide the tiles into order, or let A* find a route.
Make a picture whole, one exchange at a time.
Crack a code, then let the computer find yours.