This problem in geometry has been solved in no less than EIGHT ways by a pair of students. How would you solve it? How many of their solutions can you follow? How are they the same or different? Which do you like best?
Follow hints using a little coordinate geometry, plane geometry and trig to see how matrices are used to work on transformations of the plane.
Given probabilities of taking paths in a graph from each node, use matrix multiplication to find the probability of going from one vertex to another in 2 stages, or 3, or 4 or even 100.
We have not yet received any solutions to this problem! Can you be the first?