Firstly, a bit about how network routing works.
- 1- Start at node S
- 2- First, add the current network node to the path. If D is the current network node the algorithm outputs the path and ends since the packet was just delivered to D. Otherwise advance to the next step.
- 3- Iterate each routing table entry:
- 4- D matches the Nth entry's network? Set the current node as the Nth entry's target gateway and Jump to step 2
- 5- D does *not* match any of the routing table entries? Set the current node as the current default gateway and Jump to step 2
This doesn't even need a program to calculate it. I performed these operations by hand, and it only took about 10 minutes. I'm still waiting on the answer, but I'm fairly confident that it's correct. If you want a spoiler for the default question, click here. The next question's coming out June 3rd (tomorrow) so you'd better hurry if you want to answer this!
By the way, if you're puzzling over those "/24"s, check out Route summarization on Wikipedia.
The Treasure hunt has been a great opportunity so far for the geeks of the world to get creative with some problem solving. I've enjoyed it, as I'm sure many others have. Hopefully Google will continue to promote these "fun" activites, as they get the developer community active and give Google a good image in so far as community involvement goes. Thanks Google!
Update: My answer was correct! :D