tag:blogger.com,1999:blog-10128187.post1415306528307032869..comments2023-08-13T17:00:01.974+02:00Comments on From the Fiber Trenches to the Clouds: Google Treasure Hunt 2008: Puzzle 3 (network) solutionUnknownnoreply@blogger.comBlogger3125tag:blogger.com,1999:blog-10128187.post-73651896302953000862009-06-07T16:33:46.029+02:002009-06-07T16:33:46.029+02:00Hello Mr Simon,
Mathematically I found exactly 24...Hello Mr Simon,<br /><br />Mathematically I found exactly 2456 solutions (paths) for your problem. Most optimal is “PONMLKHG” according to the algorithm of DJIKSTRA. I see that I am far from your solution “PONMLKDEIGH”. Can you explain me the technical side of the question in very simple terms. I am a mathematician and the networks are not my field.<br /><br />I thank you for answering me.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-10128187.post-10846367186972126632009-06-03T22:59:10.319+02:002009-06-03T22:59:10.319+02:00> WHY NOT "P L K G" ?
That would be ...> WHY NOT "P L K G" ?<br /><br />That would be a better path, but you have to use the forwarding table at each hop. Like on the Internet, forwarding is hop-by-hop and may not always result in the optimal path. There could even be loops.Simon Leinenhttps://www.blogger.com/profile/13848639114358999199noreply@blogger.comtag:blogger.com,1999:blog-10128187.post-25287000928692009302009-06-03T18:23:39.788+02:002009-06-03T18:23:39.788+02:00WHY NOT "P L K G" ?WHY NOT "P L K G" ?Anonymousnoreply@blogger.com