Here is a three-part summer math challenge for ya! Explain HOW to solve the following problems: ❶ Calculate the total number of routes from the purple dot to the orange dot given that the route must not cross itself (in other words, you cannot visit an intersection more than once on the same route). ❷ Same as problem 1, but only routes passing through all intersections are valid. ❸ Same as problem 1, but you must constantly move towards the goal, never away from it. Simply put, you can only move UP or RIGHT.
The solution will be shared in a separate project later. I came up with this problem while working on a Math-related project I will share in the near future. If you find it too challenging - try drawing a simplified version of the map, with just a few intersections, and figure out the logic first. Good luck!
