<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	>
<channel>
	<title>Comments on: Google Treasure Hunt - use logic to solve 3rd question</title>
	<atom:link href="http://blog.gadodia.net/google-treasure-hunt-use-logic-to-solve-3rd-question/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.gadodia.net/google-treasure-hunt-use-logic-to-solve-3rd-question/</link>
	<description>"... tech .... fun .. bizarre ... india .... pictures ..... anything in the world ...."</description>
	<pubDate>Fri, 05 Dec 2008 13:33:47 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6.2</generator>
		<item>
		<title>By: David Webb</title>
		<link>http://blog.gadodia.net/google-treasure-hunt-use-logic-to-solve-3rd-question/#comment-9169</link>
		<dc:creator>David Webb</dc:creator>
		<pubDate>Mon, 02 Jun 2008 04:55:46 +0000</pubDate>
		<guid isPermaLink="false">http://blog.gadodia.net/google-treasure-hunt-use-logic-to-solve-3rd-question/#comment-9169</guid>
		<description>Thanks for this. It helped me in working out my solution (http://thebigbyte.blogspot.com/2008/06/how-to-solve-third-question-google.html). I'm looking forward to the next question!
Cheers,
David</description>
		<content:encoded><![CDATA[<p>Thanks for this. It helped me in working out my solution (http://thebigbyte.blogspot.com/2008/06/how-to-solve-third-question-google.html). I&#8217;m looking forward to the next question!<br />
Cheers,<br />
David</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Vaibhav</title>
		<link>http://blog.gadodia.net/google-treasure-hunt-use-logic-to-solve-3rd-question/#comment-9153</link>
		<dc:creator>Vaibhav</dc:creator>
		<pubDate>Thu, 29 May 2008 03:51:44 +0000</pubDate>
		<guid isPermaLink="false">http://blog.gadodia.net/google-treasure-hunt-use-logic-to-solve-3rd-question/#comment-9153</guid>
		<description>Yup... got it correct (the second time.. must have made a silly mistake the first time around)....</description>
		<content:encoded><![CDATA[<p>Yup&#8230; got it correct (the second time.. must have made a silly mistake the first time around)&#8230;.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: dwardu</title>
		<link>http://blog.gadodia.net/google-treasure-hunt-use-logic-to-solve-3rd-question/#comment-9138</link>
		<dc:creator>dwardu</dc:creator>
		<pubDate>Wed, 28 May 2008 12:04:57 +0000</pubDate>
		<guid isPermaLink="false">http://blog.gadodia.net/google-treasure-hunt-use-logic-to-solve-3rd-question/#comment-9138</guid>
		<description>&lt;a href="#comment-9137" rel="nofollow"&gt;@Vaibhav&lt;/a&gt;… good, at least I’m not alone ;)</description>
		<content:encoded><![CDATA[<p><a href="#comment-9137" rel="nofollow">@Vaibhav</a>… good, at least I’m not alone <img src='http://blog.gadodia.net/wp-includes/images/smilies/icon_wink.gif' alt=';)' class='wp-smiley' /></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Vaibhav</title>
		<link>http://blog.gadodia.net/google-treasure-hunt-use-logic-to-solve-3rd-question/#comment-9137</link>
		<dc:creator>Vaibhav</dc:creator>
		<pubDate>Wed, 28 May 2008 11:17:06 +0000</pubDate>
		<guid isPermaLink="false">http://blog.gadodia.net/google-treasure-hunt-use-logic-to-solve-3rd-question/#comment-9137</guid>
		<description>@dwardu... i identify with your pain. sometime you have to step back and look for a simpler way out. i did the same in the first puzzle, where i thought i will brute force the solution. turned out that i would never have got there, then i tried some finesses and it worked. :)</description>
		<content:encoded><![CDATA[<p>@dwardu&#8230; i identify with your pain. sometime you have to step back and look for a simpler way out. i did the same in the first puzzle, where i thought i will brute force the solution. turned out that i would never have got there, then i tried some finesses and it worked. <img src='http://blog.gadodia.net/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: dwardu</title>
		<link>http://blog.gadodia.net/google-treasure-hunt-use-logic-to-solve-3rd-question/#comment-9131</link>
		<dc:creator>dwardu</dc:creator>
		<pubDate>Wed, 28 May 2008 09:52:36 +0000</pubDate>
		<guid isPermaLink="false">http://blog.gadodia.net/google-treasure-hunt-use-logic-to-solve-3rd-question/#comment-9131</guid>
		<description>Like you, I’m not into networking, but I figured out how it should be done, and consulted about &lt;a title="Route summarization" href="http://en.wikipedia.org/wiki/Route_summarization" rel="nofollow"&gt;those &lt;em&gt;/24&lt;/em&gt;s&lt;/a&gt; with Wikipedia.

Then, this is the point where I erred:

I did a quick regex replace to convert the table into Java code loading the table in an array, programmed a recursive solution, got the result, and submitted it. But this took me about forty minutes!

Only then did I realise that with so many little nodes, I could have reasoned from the start that it would have been &lt;em&gt;much&lt;/em&gt; faster to compute manually.

Grrrrrrr!</description>
		<content:encoded><![CDATA[<p>Like you, I’m not into networking, but I figured out how it should be done, and consulted about <a title="Route summarization" href="http://en.wikipedia.org/wiki/Route_summarization" rel="nofollow">those <em>/24</em>s</a> with Wikipedia.</p>
<p>Then, this is the point where I erred:</p>
<p>I did a quick regex replace to convert the table into Java code loading the table in an array, programmed a recursive solution, got the result, and submitted it. But this took me about forty minutes!</p>
<p>Only then did I realise that with so many little nodes, I could have reasoned from the start that it would have been <em>much</em> faster to compute manually.</p>
<p>Grrrrrrr!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Vaibhav</title>
		<link>http://blog.gadodia.net/google-treasure-hunt-use-logic-to-solve-3rd-question/#comment-9130</link>
		<dc:creator>Vaibhav</dc:creator>
		<pubDate>Wed, 28 May 2008 09:48:06 +0000</pubDate>
		<guid isPermaLink="false">http://blog.gadodia.net/google-treasure-hunt-use-logic-to-solve-3rd-question/#comment-9130</guid>
		<description>@Godie... nopes, no cheat... although i didn't use the subnet calculator, but I think in my case, most IPs were /24 (which meant that I didn't have to take the default route)... not sure if that made sense...</description>
		<content:encoded><![CDATA[<p>@Godie&#8230; nopes, no cheat&#8230; although i didn&#8217;t use the subnet calculator, but I think in my case, most IPs were /24 (which meant that I didn&#8217;t have to take the default route)&#8230; not sure if that made sense&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: godie</title>
		<link>http://blog.gadodia.net/google-treasure-hunt-use-logic-to-solve-3rd-question/#comment-9129</link>
		<dc:creator>godie</dc:creator>
		<pubDate>Wed, 28 May 2008 08:32:25 +0000</pubDate>
		<guid isPermaLink="false">http://blog.gadodia.net/google-treasure-hunt-use-logic-to-solve-3rd-question/#comment-9129</guid>
		<description>I had to check the subnet calculator near the end nodes (cheat?), that was tricky... Except if i missed something on the first nodes X_X</description>
		<content:encoded><![CDATA[<p>I had to check the subnet calculator near the end nodes (cheat?), that was tricky&#8230; Except if i missed something on the first nodes X_X</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Attila Oláh</title>
		<link>http://blog.gadodia.net/google-treasure-hunt-use-logic-to-solve-3rd-question/#comment-9127</link>
		<dc:creator>Attila Oláh</dc:creator>
		<pubDate>Tue, 27 May 2008 23:47:09 +0000</pubDate>
		<guid isPermaLink="false">http://blog.gadodia.net/google-treasure-hunt-use-logic-to-solve-3rd-question/#comment-9127</guid>
		<description>I like your term, "fancy Linux commands" :)</description>
		<content:encoded><![CDATA[<p>I like your term, &#8220;fancy Linux commands&#8221; <img src='http://blog.gadodia.net/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ajit</title>
		<link>http://blog.gadodia.net/google-treasure-hunt-use-logic-to-solve-3rd-question/#comment-9124</link>
		<dc:creator>Ajit</dc:creator>
		<pubDate>Tue, 27 May 2008 19:57:42 +0000</pubDate>
		<guid isPermaLink="false">http://blog.gadodia.net/google-treasure-hunt-use-logic-to-solve-3rd-question/#comment-9124</guid>
		<description>Yup..I did the same way too.</description>
		<content:encoded><![CDATA[<p>Yup..I did the same way too.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Vaibhav</title>
		<link>http://blog.gadodia.net/google-treasure-hunt-use-logic-to-solve-3rd-question/#comment-9121</link>
		<dc:creator>Vaibhav</dc:creator>
		<pubDate>Tue, 27 May 2008 17:43:35 +0000</pubDate>
		<guid isPermaLink="false">http://blog.gadodia.net/google-treasure-hunt-use-logic-to-solve-3rd-question/#comment-9121</guid>
		<description>@Spotcat... well, if there is a curveball, we will get to know about it when we receive a result on the answer.

However, going through default routes only in my question was running me in circles, so, I think this should have been it.</description>
		<content:encoded><![CDATA[<p>@Spotcat&#8230; well, if there is a curveball, we will get to know about it when we receive a result on the answer.</p>
<p>However, going through default routes only in my question was running me in circles, so, I think this should have been it.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: spotcatbug</title>
		<link>http://blog.gadodia.net/google-treasure-hunt-use-logic-to-solve-3rd-question/#comment-9120</link>
		<dc:creator>spotcatbug</dc:creator>
		<pubDate>Tue, 27 May 2008 17:40:24 +0000</pubDate>
		<guid isPermaLink="false">http://blog.gadodia.net/google-treasure-hunt-use-logic-to-solve-3rd-question/#comment-9120</guid>
		<description>That's how I answered it too. Without more information from the question, I don't see how it could be done any other way. Nothing was said about finding optimal paths or anything like that. I suppose it could come down to needing to know some obscure fact about the way IP routing works. Like, suppose that, for some reason, when a path becomes "too long" (whatever that would mean), the sender defaults to it's default gateway, even though it had a direct entry in its table for the destination. That's just an "off the top of my head" example of the type of curve ball that could be contained in this, otherwise totally straight-forward (easy!), question. They did say it would the treasure hunt would test trivial knowledge.</description>
		<content:encoded><![CDATA[<p>That&#8217;s how I answered it too. Without more information from the question, I don&#8217;t see how it could be done any other way. Nothing was said about finding optimal paths or anything like that. I suppose it could come down to needing to know some obscure fact about the way IP routing works. Like, suppose that, for some reason, when a path becomes &#8220;too long&#8221; (whatever that would mean), the sender defaults to it&#8217;s default gateway, even though it had a direct entry in its table for the destination. That&#8217;s just an &#8220;off the top of my head&#8221; example of the type of curve ball that could be contained in this, otherwise totally straight-forward (easy!), question. They did say it would the treasure hunt would test trivial knowledge.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
