<?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/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: Analysis of Strategies for the n-Door Monty Hall Problem</title>
	<atom:link href="http://someoneandanyone.wordpress.com/2008/05/21/analysis-of-strategies-for-the-n-door-monty-hall-problem/feed/" rel="self" type="application/rss+xml" />
	<link>http://someoneandanyone.wordpress.com/2008/05/21/analysis-of-strategies-for-the-n-door-monty-hall-problem/</link>
	<description>"I walk slowly, like one who comes from so far away he doesn't expect to arrive."</description>
	<lastBuildDate>Mon, 27 Oct 2008 18:20:20 +0000</lastBuildDate>
	<generator>http://wordpress.com/</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Charles</title>
		<link>http://someoneandanyone.wordpress.com/2008/05/21/analysis-of-strategies-for-the-n-door-monty-hall-problem/#comment-180</link>
		<dc:creator>Charles</dc:creator>
		<pubDate>Thu, 28 Aug 2008 00:27:37 +0000</pubDate>
		<guid isPermaLink="false">http://someoneandanyone.wordpress.com/?p=29#comment-180</guid>
		<description>I believe that if you want to maximize the probability of your current choice being C, you must switch at every stage, i.e., if you believed that the game was going to end at a random time.

Also, I believe the path you follow while switching doors matters, and that your analysis of strategy four is imprecise (though you are correct that by the last door, it is inferior to strategy two).

Intuitively, strategy two is the best if you know the game will proceed until the last door: you choose a random door with P of C 1/n. While losing doors are revealed, this probability will never change so long as it is your choice. P of C for the other closed doors will rise each time a losing door is opened. When you make the switch to the final door, it has P of C (n-1)/n ... but only if you stayed with your initial door for the rest of the game. Do you see why this casts some doubt on your analysis of strategy four?</description>
		<content:encoded><![CDATA[<p>I believe that if you want to maximize the probability of your current choice being C, you must switch at every stage, i.e., if you believed that the game was going to end at a random time.</p>
<p>Also, I believe the path you follow while switching doors matters, and that your analysis of strategy four is imprecise (though you are correct that by the last door, it is inferior to strategy two).</p>
<p>Intuitively, strategy two is the best if you know the game will proceed until the last door: you choose a random door with P of C 1/n. While losing doors are revealed, this probability will never change so long as it is your choice. P of C for the other closed doors will rise each time a losing door is opened. When you make the switch to the final door, it has P of C (n-1)/n &#8230; but only if you stayed with your initial door for the rest of the game. Do you see why this casts some doubt on your analysis of strategy four?</p>
]]></content:encoded>
	</item>
</channel>
</rss>
