QOD #31
a scenario that could have taken place during the 2nd week of ssp
Three guys who live in Matilda Dorm--Nick Randolph, Geoff Mason, and our good friend Phil Ching--began to take interest in three girls who lived in Spepsi Dorm named Mary Ling, Caty Kendall, and Sophia Radner. Being the way they are, though, the guys were indecisive about exactly whom they liked the best, so they wanted to keep their options open and visit each girl in her dorm.
Because one guy was bashful, one was low-key, and one wanted to appear nonchalant about the whole situation, when he visited each girl's dorm, each guy had to make sure that the path he took never croseed the path that one of his friends took, or else gossip would start spreading through the entire SSP camp, although of course, SSPers were too classly to let that happen.
If Mary, Caty, and Sophia live side by side in three different rooms as shown in the map below, can you draw a line from each of the guys to each of the girls without crossing lines? Specifically, the three separate paths that Geoff takes to visit Sophia, Caty, and Mary can't cross the path that Nick and Phil take to visit the girls. All the paths must start from a guy (see examples below), but the paths can be as long and convoluted as necessary, so long as they don't cross (or pass over, or under, or through any girl's dorm room).
Can you solve the problem? If not, can you prove that nobody can?
[INSERT IMAGE HERE]
Solution and comments
