It was a fun way to get children to understand repetition (repeat until) and selection (if___, do___).
If the child reaches the destination, they get 10/10 for route score. However, their algorithm needs to be the most simplest way possible to get 10/10. For example, I can reach the destination by doing move forward, move forward, move forward, turn left... and so on but I won't get a good score for my algorithm score. In the class, students were willing to get full marks so even when they managed to reach the destination, they examined their algorithm to find out how they can make it simpler.