<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
	<channel>
		<title>Latest posts for the topic "#134 - The Restaurant King (blue dice)"</title>
		<link>http://www.welovepuzzles.com/jforum/posts/list/3.page</link>
		<description><![CDATA[Latest messages posted in the topic "#134 - The Restaurant King (blue dice)"]]></description>
		<generator>JForum - http://www.jforum.net</generator>
			<item>
				<title>#134 - The Restaurant King (blue dice)</title>
				<description><![CDATA[ Please use this thread for discussion about this card.]]></description>
				<guid isPermaLink="true">http://www.welovepuzzles.com/jforum/posts/list/53.page#53</guid>
				<link>http://www.welovepuzzles.com/jforum/posts/list/53.page#53</link>
				<pubDate><![CDATA[Thu, 1 Mar 2007 18:58:25]]> GMT</pubDate>
			</item>
			<item>
				<title>#134 - The Restaurant King (blue dice)</title>
				<description><![CDATA[ Can anyone give me a hint about how to work this one out?

I get that you've got to find the cheapest route but other than manually computing the  100+ possibilities I can't think how to work this out.

Please help? :)]]></description>
				<guid isPermaLink="true">http://www.welovepuzzles.com/jforum/posts/list/53.page#1565</guid>
				<link>http://www.welovepuzzles.com/jforum/posts/list/53.page#1565</link>
				<pubDate><![CDATA[Thu, 8 Mar 2007 19:07:51]]> GMT</pubDate>
			</item>
			<item>
				<title>Re: #134 - The Restaurant King (blue dice)</title>
				<description><![CDATA[ <p><b>Spoiler:</b> (highlight to read)</p>
		<div id="spoiler">
			<p>You start and end at the Ace Bar. The two cheapest fares are from here to somewhere or back. Work out the rest of the route so you can encompass these fares in the cheapest manner.</p>
		</div>

I can't see any other tricks here.]]></description>
				<guid isPermaLink="true">http://www.welovepuzzles.com/jforum/posts/list/53.page#1573</guid>
				<link>http://www.welovepuzzles.com/jforum/posts/list/53.page#1573</link>
				<pubDate><![CDATA[Thu, 8 Mar 2007 19:37:32]]> GMT</pubDate>
			</item>
			<item>
				<title>Re: #134 - The Restaurant King (blue dice)</title>
				<description><![CDATA[ I thought I had this solved as follows
<p><b>Spoiler:</b> (highlight to read)</p>
		<div id="spoiler">
			<p>1.25+10.00+9.95+6.05+3.30 = 30.55</p>
		</div>
but it is incorrect.  Can anyone point out my mistake for me. Thanks]]></description>
				<guid isPermaLink="true">http://www.welovepuzzles.com/jforum/posts/list/53.page#3967</guid>
				<link>http://www.welovepuzzles.com/jforum/posts/list/53.page#3967</link>
				<pubDate><![CDATA[Tue, 10 Apr 2007 06:56:16]]> GMT</pubDate>
			</item>
			<item>
				<title>#134 - The Restaurant King (blue dice)</title>
				<description><![CDATA[ Jezza:

You may want to check your numbers against the actual fares on the card: two of the amounts in your calculation are a little bit out... the route looks good though.

Cas.]]></description>
				<guid isPermaLink="true">http://www.welovepuzzles.com/jforum/posts/list/53.page#3968</guid>
				<link>http://www.welovepuzzles.com/jforum/posts/list/53.page#3968</link>
				<pubDate><![CDATA[Tue, 10 Apr 2007 08:56:45]]> GMT</pubDate>
			</item>
			<item>
				<title>#134 - The Restaurant King (blue dice)</title>
				<description><![CDATA[ Brute force methodology:
<p><b>Spoiler:</b> (highlight to read)</p>
		<div id="spoiler">
			<p>There are only 12 options (24 if you count reverse paths, but as they're the same for our purposes you don't need them). 

Write out the options with a letter representing each restaurant (AB BC CD DE EA, etc.).

Find-replace each letter pair and it's opposite with the correct fare.

Import into a spreadsheet and sum up.

Profit!</p>
		</div>]]></description>
				<guid isPermaLink="true">http://www.welovepuzzles.com/jforum/posts/list/53.page#3986</guid>
				<link>http://www.welovepuzzles.com/jforum/posts/list/53.page#3986</link>
				<pubDate><![CDATA[Tue, 10 Apr 2007 17:37:46]]> GMT</pubDate>
			</item>
			<item>
				<title>Re: #134 - The Restaurant King (blue dice)</title>
				<description><![CDATA[ I have checked several times and my answer still comes to <p><b>Spoiler:</b> (highlight to read)</p>
		<div id="spoiler">
			<p>30.55</p>
		</div>.  What should I be aiming for?


EDIT: Thanks Casaubon.  Now solved .  My eyesight obviously failing me!]]></description>
				<guid isPermaLink="true">http://www.welovepuzzles.com/jforum/posts/list/53.page#4061</guid>
				<link>http://www.welovepuzzles.com/jforum/posts/list/53.page#4061</link>
				<pubDate><![CDATA[Thu, 12 Apr 2007 12:50:44]]> GMT</pubDate>
			</item>
			<item>
				<title>Re: #134 - The Restaurant King (blue dice)</title>
				<description><![CDATA[ Jezza,

There's a number wrong in your suggested solution:

<p><b>Spoiler:</b> (highlight to read)</p>
		<div id="spoiler">
			<p>You've got $9.95, but the actual tariff on the card is $9.55.</p>
		</div> 

Redo your calculation using the correct tariff and you should get your solve.

Cas.]]></description>
				<guid isPermaLink="true">http://www.welovepuzzles.com/jforum/posts/list/53.page#4062</guid>
				<link>http://www.welovepuzzles.com/jforum/posts/list/53.page#4062</link>
				<pubDate><![CDATA[Thu, 12 Apr 2007 12:57:10]]> GMT</pubDate>
			</item>
			<item>
				<title>Re: #134 - The Restaurant King (blue dice)</title>
				<description><![CDATA[ The way I worked out the route was:

<p><b>Spoiler:</b> (highlight to read)</p>
		<div id="spoiler">
			<p> I drew a map.  It's quite obvious where the shorted route is then !
</p>
		</div>]]></description>
				<guid isPermaLink="true">http://www.welovepuzzles.com/jforum/posts/list/53.page#4075</guid>
				<link>http://www.welovepuzzles.com/jforum/posts/list/53.page#4075</link>
				<pubDate><![CDATA[Thu, 12 Apr 2007 16:00:21]]> GMT</pubDate>
			</item>
			<item>
				<title>Re: #134 - The Restaurant King (blue dice)</title>
				<description><![CDATA[ <p><b>Spoiler:</b> (highlight to read)</p>
		<div id="spoiler">
			<p>It's actually a very simple implementation of the chinese postman problem. Usually the network is more limited though.</p>
		</div>]]></description>
				<guid isPermaLink="true">http://www.welovepuzzles.com/jforum/posts/list/53.page#4119</guid>
				<link>http://www.welovepuzzles.com/jforum/posts/list/53.page#4119</link>
				<pubDate><![CDATA[Fri, 13 Apr 2007 11:54:20]]> GMT</pubDate>
			</item>
			<item>
				<title>Re: #134 - The Restaurant King (blue dice)</title>
				<description><![CDATA[ I found this one much easier than it looks.  I was expecting it to be counter-intuitive, and for there to be some cunningly hidden route.  But it is fairly straight forward.]]></description>
				<guid isPermaLink="true">http://www.welovepuzzles.com/jforum/posts/list/53.page#4592</guid>
				<link>http://www.welovepuzzles.com/jforum/posts/list/53.page#4592</link>
				<pubDate><![CDATA[Sat, 21 Apr 2007 13:09:47]]> GMT</pubDate>
			</item>
			<item>
				<title>Re: #134 - The Restaurant King (blue dice)</title>
				<description><![CDATA[ <p><cite>martynpie wrote:</cite></p>
		<blockquote><p><b>Spoiler:</b> (highlight to read)</p>
		<div id="spoiler">
			<p>It's actually a very simple implementation of the chinese postman problem. Usually the network is more limited though.</p>
		</div></blockquote>

<p><b>Spoiler:</b> (highlight to read)</p>
		<div id="spoiler">
			<p>Chinese postman? I thought it was Primm's Algorithm myself, but then again it's been ages since I learnt it. Chinese postamn is all routes, not shortest distance...</p>
		</div>]]></description>
				<guid isPermaLink="true">http://www.welovepuzzles.com/jforum/posts/list/53.page#5157</guid>
				<link>http://www.welovepuzzles.com/jforum/posts/list/53.page#5157</link>
				<pubDate><![CDATA[Tue, 1 May 2007 10:46:39]]> GMT</pubDate>
			</item>
	</channel>
</rss>