<?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"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Bar game: place the last coaster</title>
	<atom:link href="http://mindyourdecisions.com/blog/2010/03/17/bar-game-place-the-last-coaster/feed/" rel="self" type="application/rss+xml" />
	<link>http://mindyourdecisions.com/blog/2010/03/17/bar-game-place-the-last-coaster/</link>
	<description>Articles on game theory and personal finance</description>
	<lastBuildDate>Tue, 07 Sep 2010 05:43:49 -0400</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
	<item>
		<title>By: bill</title>
		<link>http://mindyourdecisions.com/blog/2010/03/17/bar-game-place-the-last-coaster/comment-page-1/#comment-6413</link>
		<dc:creator>bill</dc:creator>
		<pubDate>Wed, 17 Mar 2010 21:05:34 +0000</pubDate>
		<guid isPermaLink="false">http://mindyourdecisions.com/blog/?p=2132#comment-6413</guid>
		<description>This assumes there&#039;s always a matching spot.  Holes in the table, or an irregular outline, would make that difficult. From the comments, I gather that once you no longer mirror, the strategy isn&#039;t assured.</description>
		<content:encoded><![CDATA[<p>This assumes there&#8217;s always a matching spot.  Holes in the table, or an irregular outline, would make that difficult. From the comments, I gather that once you no longer mirror, the strategy isn&#8217;t assured.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Craig</title>
		<link>http://mindyourdecisions.com/blog/2010/03/17/bar-game-place-the-last-coaster/comment-page-1/#comment-6411</link>
		<dc:creator>Craig</dc:creator>
		<pubDate>Wed, 17 Mar 2010 14:46:32 +0000</pubDate>
		<guid isPermaLink="false">http://mindyourdecisions.com/blog/?p=2132#comment-6411</guid>
		<description>Presh:
Your solution is an &#039;involution&#039;.  I actually worked on a combinatorial game similar to this recently.  It&#039;s awesome to see this version of it!  What a great way to introduce laypeople to game theory, and especially to show them how combinatorialists arrive at solutions.

If you&#039;re interested in another form of the game check out F-Saturator, a game a few colleagues of mine worked on in the form of graphs.

http://scholar.google.com/scholar?cluster=5600507325285475104&amp;hl=en&amp;as_sdt=4000</description>
		<content:encoded><![CDATA[<p>Presh:<br />
Your solution is an &#8216;involution&#8217;.  I actually worked on a combinatorial game similar to this recently.  It&#8217;s awesome to see this version of it!  What a great way to introduce laypeople to game theory, and especially to show them how combinatorialists arrive at solutions.</p>
<p>If you&#8217;re interested in another form of the game check out F-Saturator, a game a few colleagues of mine worked on in the form of graphs.</p>
<p><a href="http://scholar.google.com/scholar?cluster=5600507325285475104&amp;hl=en&amp;as_sdt=4000" rel="nofollow">http://scholar.google.com/scholar?cluster=5600507325285475104&amp;hl=en&amp;as_sdt=4000</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Scott</title>
		<link>http://mindyourdecisions.com/blog/2010/03/17/bar-game-place-the-last-coaster/comment-page-1/#comment-6410</link>
		<dc:creator>Scott</dc:creator>
		<pubDate>Wed, 17 Mar 2010 13:20:35 +0000</pubDate>
		<guid isPermaLink="false">http://mindyourdecisions.com/blog/?p=2132#comment-6410</guid>
		<description>One thing that&#039;s unclear is whether or not you can move coasters that have already been placed.

I like the solution and how it works:

Assuming optimal placement (each coaster touches another coaster) we would end up with a rectangular array of coasters. Since you placed an &quot;anchor&quot; at the center of the table, the array of coasters will have an odd number of rows and columns. Since an odd number times an odd number is also an odd number, there would be an odd number of rectangles. Since you went first, you will go last due to that odd number.</description>
		<content:encoded><![CDATA[<p>One thing that&#8217;s unclear is whether or not you can move coasters that have already been placed.</p>
<p>I like the solution and how it works:</p>
<p>Assuming optimal placement (each coaster touches another coaster) we would end up with a rectangular array of coasters. Since you placed an &#8220;anchor&#8221; at the center of the table, the array of coasters will have an odd number of rows and columns. Since an odd number times an odd number is also an odd number, there would be an odd number of rectangles. Since you went first, you will go last due to that odd number.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Presh Talwalkar</title>
		<link>http://mindyourdecisions.com/blog/2010/03/17/bar-game-place-the-last-coaster/comment-page-1/#comment-6409</link>
		<dc:creator>Presh Talwalkar</dc:creator>
		<pubDate>Wed, 17 Mar 2010 06:39:58 +0000</pubDate>
		<guid isPermaLink="false">http://mindyourdecisions.com/blog/?p=2132#comment-6409</guid>
		<description>There is a winning strategy for the first player in a 2-person contest. Here is what to do:

Your first move is to place a coaster in the center of the table. Now, wherever your opponent places the coaster, you place yours symmetrically on the other side of the table. If they place a coaster in the southwest corner, you place yours in the analogous spot in the northeast corner. (If you imagine the center of the table as the origin, this is mathematically a reflection about the origin).

This strategy means you can always match your opponent&#039;s move. The game ends when your opponent runs out of open sports, which equivalently means you have placed the last coaster.</description>
		<content:encoded><![CDATA[<p>There is a winning strategy for the first player in a 2-person contest. Here is what to do:</p>
<p>Your first move is to place a coaster in the center of the table. Now, wherever your opponent places the coaster, you place yours symmetrically on the other side of the table. If they place a coaster in the southwest corner, you place yours in the analogous spot in the northeast corner. (If you imagine the center of the table as the origin, this is mathematically a reflection about the origin).</p>
<p>This strategy means you can always match your opponent&#8217;s move. The game ends when your opponent runs out of open sports, which equivalently means you have placed the last coaster.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
