Choose the difficulty
School year and age are only a guide. Choose based on experience; you can switch modes at any time.
Directions: ↑ up, ↓ down, ← left, → right. One step moves to one adjacent cell. For example, “6 × →” is one command card and 6 steps.
Your algorithm
Add commands, then press “Run”. Click a command to remove it. Each attempt starts at the starting position. Reach the treasure on the program’s final step.
Each card is used once. Click a card in the algorithm to return it to the backpack.
🧭 Expedition passport
✓ Stamp – challenge completed. ⭐ Gold star – optimal solution without extra commands.
How to play and what are we learning?
Algorithm – a precise sequence of actions. The traveller makes no decisions of their own: they only follow your instructions.
Debugging: the journey stops if you hit an obstacle or leave the map. Read which command caused the problem and fix the plan. Every run starts at the starting position. Extra steps after reaching the treasure are not allowed: the challenge is completed only when the entire program ends at the treasure.
Repeat cards: “Repeat 3 × →” is one command with a step counter in this game (it performs 3 consecutive steps). This shortens the algorithm so it fits within the card budget.
Command backpack: In challenges 9–10, cards move into the algorithm and cannot be reused. Remove a card from the algorithm to return it to the backpack. In challenge 10, use every card and reach the treasure on the final step.
State and condition: in challenges with a key, the treasure opens only with the key. This demonstrates a condition: IF the traveller has a key → the treasure opens, ELSE → the journey stops.
Discuss after the expedition
Which command produced an unexpected result? How did you work out what to change? How many steps did the program take and how many cards did it need? Could you write the same route more briefly?