<?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: Deal or No Deal Algorithm</title>
	<atom:link href="http://nslog.com/2005/12/20/deal_or_no_deal_algorithm/feed" rel="self" type="application/rss+xml" />
	<link>http://nslog.com/2005/12/20/deal_or_no_deal_algorithm</link>
	<description>The Weblog of Erik J. Barzeski</description>
	<lastBuildDate>Wed, 23 May 2012 23:05:21 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.2</generator>
	<item>
		<title>By: Ron</title>
		<link>http://nslog.com/2005/12/20/deal_or_no_deal_algorithm#comment-70294</link>
		<dc:creator>Ron</dc:creator>
		<pubDate>Sat, 28 Apr 2012 20:18:00 +0000</pubDate>
		<guid isPermaLink="false">http://nslog.com/2005/12/20/deal_or_no_deal_algorithm/#comment-70294</guid>
		<description>Ok the main problem is the speed of the cases being opened has nothing to do with it. The odds you had to choose a million dollar case were 1/26 the odds that you have that case if all other cases are removed are not constant. Just your odds of winning the million. If I had X-ray vision and could see into 22 out of 26 cases when I chose my initial case are my odds the same?
So why don&#039;t the odds for me winning change as I see the cases being revealed as not having the million dollars as the game progresses</description>
		<content:encoded><![CDATA[<p>Ok the main problem is the speed of the cases being opened has nothing to do with it. The odds you had to choose a million dollar case were 1/26 the odds that you have that case if all other cases are removed are not constant. Just your odds of winning the million. If I had X-ray vision and could see into 22 out of 26 cases when I chose my initial case are my odds the same?<br />
So why don't the odds for me winning change as I see the cases being revealed as not having the million dollars as the game progresses</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ron</title>
		<link>http://nslog.com/2005/12/20/deal_or_no_deal_algorithm#comment-70293</link>
		<dc:creator>Ron</dc:creator>
		<pubDate>Sat, 28 Apr 2012 19:53:25 +0000</pubDate>
		<guid isPermaLink="false">http://nslog.com/2005/12/20/deal_or_no_deal_algorithm/#comment-70293</guid>
		<description>No the Monty hall solution is biased because the host causes one of the three choices that he knows is a bad choice to be revealed, this fact means statistically you should switch.In deal or no deal the banker has no idea what case has the top prize nor does he influence the contestants choices of elimination. The actual fact in deal or no deal is the remaining cases cause the probability percentage to change two cases, is 50/50 it only remains 1/27 if you do not reveal the contents thus negating the game in entirety. The only way your brother is correct is when he refers to the initial odds of choosing the top prize. After that you are referring to the remaining odds of what may be In your case. Would he quote the same odds if you started the game with 27 cases but 23 of them were already open revealing the contents as not being one million dollars? Also there is a guy on here that watched 3 episodes and assume the banker knows what case the million is in, not true.</description>
		<content:encoded><![CDATA[<p>No the Monty hall solution is biased because the host causes one of the three choices that he knows is a bad choice to be revealed, this fact means statistically you should switch.In deal or no deal the banker has no idea what case has the top prize nor does he influence the contestants choices of elimination. The actual fact in deal or no deal is the remaining cases cause the probability percentage to change two cases, is 50/50 it only remains 1/27 if you do not reveal the contents thus negating the game in entirety. The only way your brother is correct is when he refers to the initial odds of choosing the top prize. After that you are referring to the remaining odds of what may be In your case. Would he quote the same odds if you started the game with 27 cases but 23 of them were already open revealing the contents as not being one million dollars? Also there is a guy on here that watched 3 episodes and assume the banker knows what case the million is in, not true.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ben</title>
		<link>http://nslog.com/2005/12/20/deal_or_no_deal_algorithm#comment-69172</link>
		<dc:creator>Ben</dc:creator>
		<pubDate>Fri, 10 Feb 2012 03:48:04 +0000</pubDate>
		<guid isPermaLink="false">http://nslog.com/2005/12/20/deal_or_no_deal_algorithm/#comment-69172</guid>
		<description>I don&#039;t really care about the whole DOND vs Monty Hall problem, but I do have a comment regarding the formula that governs the banker&#039;s offer. There is indeed an algorithm in play, and it is always the same for each episode. Also, it is strictly mathematical and not adjusted by the &quot;banker&quot; based on the contestant&#039;s prior choices.

Proof: Whenever there are 5 or fewer cases in play and the contestant makes a deal, the host asks the contestant to simulate what would have happened if they had kept going to the final 2 cases. Each time the contestant chooses a case, Howie says &quot;and your offer would have been $_____&quot;. The offer is immediately calculated and displayed, with no time to fudge the offer at all. There have been a few episodes where there are identical cases remaining, and the offers have all been identical.

Also, there were two episodes (one in season 2 and one in season 3) where there were indentical cases remaining, and the offer was identical in both cases.

To me, this proves that the banker&#039;s offer is a strict algorithm and is quickly calculated via computer and displayed on-screen following an imaginary &quot;phone call&quot; from the banker. In fact, the banker servers no purpose whatsoever, other than to serve as the &quot;bad guy&quot; to increase suspense and give the show more &quot;filler&quot; to take up 22 minutes per episode.

However, what exactly the algorithm is, I haven&#039;t been able to solve. When I do, I will post it here first.</description>
		<content:encoded><![CDATA[<p>I don't really care about the whole DOND vs Monty Hall problem, but I do have a comment regarding the formula that governs the banker's offer. There is indeed an algorithm in play, and it is always the same for each episode. Also, it is strictly mathematical and not adjusted by the "banker" based on the contestant's prior choices.</p>
<p>Proof: Whenever there are 5 or fewer cases in play and the contestant makes a deal, the host asks the contestant to simulate what would have happened if they had kept going to the final 2 cases. Each time the contestant chooses a case, Howie says "and your offer would have been $_____". The offer is immediately calculated and displayed, with no time to fudge the offer at all. There have been a few episodes where there are identical cases remaining, and the offers have all been identical.</p>
<p>Also, there were two episodes (one in season 2 and one in season 3) where there were indentical cases remaining, and the offer was identical in both cases.</p>
<p>To me, this proves that the banker's offer is a strict algorithm and is quickly calculated via computer and displayed on-screen following an imaginary "phone call" from the banker. In fact, the banker servers no purpose whatsoever, other than to serve as the "bad guy" to increase suspense and give the show more "filler" to take up 22 minutes per episode.</p>
<p>However, what exactly the algorithm is, I haven't been able to solve. When I do, I will post it here first.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: big bro</title>
		<link>http://nslog.com/2005/12/20/deal_or_no_deal_algorithm#comment-69040</link>
		<dc:creator>big bro</dc:creator>
		<pubDate>Mon, 16 Jan 2012 08:12:44 +0000</pubDate>
		<guid isPermaLink="false">http://nslog.com/2005/12/20/deal_or_no_deal_algorithm/#comment-69040</guid>
		<description>great blog I&#039;m a  gigantic Big Brother fanatic</description>
		<content:encoded><![CDATA[<p>great blog I'm a  gigantic Big Brother fanatic</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Edmond Honda</title>
		<link>http://nslog.com/2005/12/20/deal_or_no_deal_algorithm#comment-68937</link>
		<dc:creator>Edmond Honda</dc:creator>
		<pubDate>Tue, 03 Jan 2012 20:14:38 +0000</pubDate>
		<guid isPermaLink="false">http://nslog.com/2005/12/20/deal_or_no_deal_algorithm/#comment-68937</guid>
		<description>[quote comment=&quot;68934&quot;]Whether or not that&#039;s how it works in any ordinary game Deal or No Deal is irrelevant.
The question he asked is one scenario of Deal or No Deal where all but four cases have been revealed to not have the million. In this scenario, it fits the Monty Hall problem. Yes, you are correct that Deal or No Deal itself does not guarantee you will keep the million in play, but in this one instance he creates in his question, it did play out to have the million left in a remaining suitcase. That is what matters here. In this one single scenario he created in his question, the Monty Hall problem exists, only because he has already guaranteed (to use your own word) 22 cases to be without the million.[/quote]
All I can say is that there is a flaw in your logic here. The odds just don&#039;t work that way. You seem to have decided that a situation looks like the Monty Hall situation, therefore it must be the same, and that just isn&#039;t correct.

I mishandled the html in a previous response, let me ask this again-

Let&#039;s say the contestant chose case #1, and has already opened cases 5 through 27.
 
Please tell me why you believe that case #2, #3, and #4 have better odds of containing the million than case #1.
 
Now let&#039;s suppose that the contestant chose initially chose case #4, and left #1-3 in play. Would case #4 magically be an inferior choice now, while #1 somehow has its chances improved?
 
The reality is that all four cases are the ones that the contestant has chosen to leave in play at this point in the game, and all four have equal chances to hold the million. The fact that one of them has been sitting in front of the contestant (instead of left on the stage) is irrelevant to the odds.</description>
		<content:encoded><![CDATA[<p class="quote_header"><a  href="http://nslog.com/2005/12/20/deal_or_no_deal_algorithm#comment-68934">James said</a> on January 3, 2012:</p>
<blockquote cite="http://nslog.com/2005/12/20/deal_or_no_deal_algorithm#comment-68934"><p>
Whether or not that's how it works in any ordinary game Deal or No Deal is irrelevant.<br />
The question he asked is one scenario of Deal or No Deal where all but four cases have been revealed to not have the million. In this scenario, it fits the Monty Hall problem. Yes, you are correct that Deal or No Deal itself does not guarantee you will keep the million in play, but in this one instance he creates in his question, it did play out to have the million left in a remaining suitcase. That is what matters here. In this one single scenario he created in his question, the Monty Hall problem exists, only because he has already guaranteed (to use your own word) 22 cases to be without the million.</p>
</blockquote>
<p>All I can say is that there is a flaw in your logic here. The odds just don't work that way. You seem to have decided that a situation looks like the Monty Hall situation, therefore it must be the same, and that just isn't correct.</p>
<p>I mishandled the html in a previous response, let me ask this again-</p>
<p>Let's say the contestant chose case #1, and has already opened cases 5 through 27.</p>
<p>Please tell me why you believe that case #2, #3, and #4 have better odds of containing the million than case #1.</p>
<p>Now let's suppose that the contestant chose initially chose case #4, and left #1-3 in play. Would case #4 magically be an inferior choice now, while #1 somehow has its chances improved?</p>
<p>The reality is that all four cases are the ones that the contestant has chosen to leave in play at this point in the game, and all four have equal chances to hold the million. The fact that one of them has been sitting in front of the contestant (instead of left on the stage) is irrelevant to the odds.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: David Gentile</title>
		<link>http://nslog.com/2005/12/20/deal_or_no_deal_algorithm#comment-68936</link>
		<dc:creator>David Gentile</dc:creator>
		<pubDate>Tue, 03 Jan 2012 17:49:40 +0000</pubDate>
		<guid isPermaLink="false">http://nslog.com/2005/12/20/deal_or_no_deal_algorithm/#comment-68936</guid>
		<description>Doing it with cards - borrowed from Wikipedia:

In Monty Haul: Use the red twos and the Ace of Spades, deal one card to the player. Look at the remaining two cards and discard a red two. Then record if the player would win by switching. They will win by switching anytime they were dealt a red 2 (2/3rds of the time). 

In Millionaire (lets go with 27 total cases), use all the red cards and the Ace of Spades. deal one card to the player. Now throw out all but the bottom 3 cards in the remaining deck. Is one of them the Ace of Spades? If not then the results of this experiment are discarded. This is one of the 23 of 27 scenarios where the Ace of Spades is already gone by this point. In the scenarios we do record about 1/4th of them will result in the player winning with his original choice. If the Ace was the top card in the original deck, he wins. If it was one of the bottom 3 cards it is a scenario we will count. If the Ace was anywhere else, we&#039;re not looking at this scenario. The Ace is on top in 1 of the 4 scenarios that matter to us, and we will win with our original choice in 1/4th of those scenarios.</description>
		<content:encoded><![CDATA[<p>Doing it with cards - borrowed from Wikipedia:</p>
<p>In Monty Haul: Use the red twos and the Ace of Spades, deal one card to the player. Look at the remaining two cards and discard a red two. Then record if the player would win by switching. They will win by switching anytime they were dealt a red 2 (2/3rds of the time). </p>
<p>In Millionaire (lets go with 27 total cases), use all the red cards and the Ace of Spades. deal one card to the player. Now throw out all but the bottom 3 cards in the remaining deck. Is one of them the Ace of Spades? If not then the results of this experiment are discarded. This is one of the 23 of 27 scenarios where the Ace of Spades is already gone by this point. In the scenarios we do record about 1/4th of them will result in the player winning with his original choice. If the Ace was the top card in the original deck, he wins. If it was one of the bottom 3 cards it is a scenario we will count. If the Ace was anywhere else, we're not looking at this scenario. The Ace is on top in 1 of the 4 scenarios that matter to us, and we will win with our original choice in 1/4th of those scenarios.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: David Gentile</title>
		<link>http://nslog.com/2005/12/20/deal_or_no_deal_algorithm#comment-68935</link>
		<dc:creator>David Gentile</dc:creator>
		<pubDate>Tue, 03 Jan 2012 16:35:28 +0000</pubDate>
		<guid isPermaLink="false">http://nslog.com/2005/12/20/deal_or_no_deal_algorithm/#comment-68935</guid>
		<description>James, there is still a nuance of difference here, and it is important. 

First, before we get to conditional probabilities, here are the initial straight probabilities:

In Monty Haul - the random variable at the start has three possible outcomes - car, goat 1, and goat 2. 

In Millionaire - the random variable at the start has 28 possibilities - the million, other#1, other#2, other#3 and then other#4 etc...

So there is a tree with 3 branches in the first case, and a tree with 28 branches in the second case. 

Now for the conditionals - In Monte Haul we are told (GIVEN) that we are on a branch where Monte will reveal a goat. Well, he reveals a goat ON ALL THREE BRANCHES. Saying that we will see a goat, eliminates none of the possible future worlds. Had we chosen differently, it would not have been otherwise, we still would have seen a goat.

But...in the other game saying that we get down to 4 cases tells us something different. It tells us that we are not in a world where we picked other cases #4-#28. Those branches are eliminated, we know we don’t go down those paths (or didn&#039;t go down those paths), so now we are looking at a tree with only 4 branches that we have not eliminated, and the chance that we are on the winning branch is 1 in 4. 

So, at the start there are 28 possible worlds. 24 of those possible worlds end up with the million being revealed before we get to the final 4. 3 of those worlds have the million in some remaining case, other than ours at the final 4, and 1 world has us winning. At the start 1 of the 28 possible worlds has us winning. By 4 cases, however, we know we are not in the other 24 worlds, and one of the 4 possible worlds is a winner for us. 

Again, in Monty Haul, there were three possible worlds at the start. After he reveals the goat, we still could be in any of the three possible worlds. Our chance of winning with our original choice is still 1 in 3.</description>
		<content:encoded><![CDATA[<p>James, there is still a nuance of difference here, and it is important. </p>
<p>First, before we get to conditional probabilities, here are the initial straight probabilities:</p>
<p>In Monty Haul - the random variable at the start has three possible outcomes - car, goat 1, and goat 2. </p>
<p>In Millionaire - the random variable at the start has 28 possibilities - the million, other#1, other#2, other#3 and then other#4 etc...</p>
<p>So there is a tree with 3 branches in the first case, and a tree with 28 branches in the second case. </p>
<p>Now for the conditionals - In Monte Haul we are told (GIVEN) that we are on a branch where Monte will reveal a goat. Well, he reveals a goat ON ALL THREE BRANCHES. Saying that we will see a goat, eliminates none of the possible future worlds. Had we chosen differently, it would not have been otherwise, we still would have seen a goat.</p>
<p>But...in the other game saying that we get down to 4 cases tells us something different. It tells us that we are not in a world where we picked other cases #4-#28. Those branches are eliminated, we know we don’t go down those paths (or didn't go down those paths), so now we are looking at a tree with only 4 branches that we have not eliminated, and the chance that we are on the winning branch is 1 in 4. </p>
<p>So, at the start there are 28 possible worlds. 24 of those possible worlds end up with the million being revealed before we get to the final 4. 3 of those worlds have the million in some remaining case, other than ours at the final 4, and 1 world has us winning. At the start 1 of the 28 possible worlds has us winning. By 4 cases, however, we know we are not in the other 24 worlds, and one of the 4 possible worlds is a winner for us. </p>
<p>Again, in Monty Haul, there were three possible worlds at the start. After he reveals the goat, we still could be in any of the three possible worlds. Our chance of winning with our original choice is still 1 in 3.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: James</title>
		<link>http://nslog.com/2005/12/20/deal_or_no_deal_algorithm#comment-68934</link>
		<dc:creator>James</dc:creator>
		<pubDate>Tue, 03 Jan 2012 16:12:38 +0000</pubDate>
		<guid isPermaLink="false">http://nslog.com/2005/12/20/deal_or_no_deal_algorithm/#comment-68934</guid>
		<description>Whether or not that&#039;s how it works in any ordinary game Deal or No Deal is irrelevant.
The question he asked is one scenario of Deal or No Deal where all but four cases have been revealed to not have the million. In this scenario, it fits the Monty Hall problem. Yes, you are correct that Deal or No Deal itself does not guarantee you will keep the million in play, but in this one instance he creates in his question, it did play out to have the million left in a remaining suitcase. That is what matters here. In this one single scenario he created in his question, the Monty Hall problem exists, only because he has already guaranteed (to use your own word) 22 cases to be without the million.</description>
		<content:encoded><![CDATA[<p>Whether or not that's how it works in any ordinary game Deal or No Deal is irrelevant.<br />
The question he asked is one scenario of Deal or No Deal where all but four cases have been revealed to not have the million. In this scenario, it fits the Monty Hall problem. Yes, you are correct that Deal or No Deal itself does not guarantee you will keep the million in play, but in this one instance he creates in his question, it did play out to have the million left in a remaining suitcase. That is what matters here. In this one single scenario he created in his question, the Monty Hall problem exists, only because he has already guaranteed (to use your own word) 22 cases to be without the million.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Edmond Honda</title>
		<link>http://nslog.com/2005/12/20/deal_or_no_deal_algorithm#comment-68933</link>
		<dc:creator>Edmond Honda</dc:creator>
		<pubDate>Tue, 03 Jan 2012 11:35:42 +0000</pubDate>
		<guid isPermaLink="false">http://nslog.com/2005/12/20/deal_or_no_deal_algorithm/#comment-68933</guid>
		<description>[quote comment=&quot;68930&quot;]Thank you for demonstrating your credibility by stating you are a statistician, that makes this discussion easier for both of us.
Take note that the original post stated: &quot;after the 22 other cases have been opened and none of them have the $1m in them&quot;
This correlates to the idea you stated: &quot;ALWAYS reveals a goat,&quot; because all 22 cases had the proverbial goat in them. Thus, Monty Hall&#039;s problem remains, just with 27 doors and the fact that you revealed the goats, not the host.
And with you being a statistician, you will already know that the Monty Hall analysis is correct that switching being the proper choice.[/quote]
In DoND, you do not always open 22 cases and reveal 22 losers.

If that was guaranteed to happen (by the host interfering and removing losing cases for you), then the Monty Hall situation applies and you would be increasing your odds by switching cases.

But it&#039;s not.</description>
		<content:encoded><![CDATA[<p class="quote_header"><a  href="http://nslog.com/2005/12/20/deal_or_no_deal_algorithm#comment-68930">James said</a> on January 2, 2012:</p>
<blockquote cite="http://nslog.com/2005/12/20/deal_or_no_deal_algorithm#comment-68930"><p>
Thank you for demonstrating your credibility by stating you are a statistician, that makes this discussion easier for both of us.<br />
Take note that the original post stated: "after the 22 other cases have been opened and none of them have the $1m in them"<br />
This correlates to the idea you stated: "ALWAYS reveals a goat," because all 22 cases had the proverbial goat in them. Thus, Monty Hall's problem remains, just with 27 doors and the fact that you revealed the goats, not the host.<br />
And with you being a statistician, you will already know that the Monty Hall analysis is correct that switching being the proper choice.</p>
</blockquote>
<p>In DoND, you do not always open 22 cases and reveal 22 losers.</p>
<p>If that was guaranteed to happen (by the host interfering and removing losing cases for you), then the Monty Hall situation applies and you would be increasing your odds by switching cases.</p>
<p>But it's not.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Edmond Honda</title>
		<link>http://nslog.com/2005/12/20/deal_or_no_deal_algorithm#comment-68932</link>
		<dc:creator>Edmond Honda</dc:creator>
		<pubDate>Tue, 03 Jan 2012 11:31:25 +0000</pubDate>
		<guid isPermaLink="false">http://nslog.com/2005/12/20/deal_or_no_deal_algorithm/#comment-68932</guid>
		<description>[quote comment=&quot;68926&quot;]Interestingly, the Monty Hall problem scenario DOES apply here, because we are under the assumption that upon reaching the four cases left, one of those remaining four is the million. Whether or not the &quot;game master&quot; was the one who removed them is irrelevant, all that matters is that the condition above exists..[/quote]
The Monty Hall scenario does not apply here. It is extremely relevant as to how this situation was reached.

In the Monty Hall scenario, the gameshow host always interferes with the game&#039;s odds, and always does so by removing a losing prize. The contestant will always find himself in a situation where the winning prize is still in play.

In DoND it&#039;s completely different. There is never any interference from outside. The contestant will very rarely find himself in a late-game situation where the million dollars is still in play - and if he does, it&#039;s because he&#039;s been very lucky already.

In Monty Hall, the winning prize is ALWAYS there, and the contestant will ALWAYS be in a situation where he can win it.

In DoND, the winning prize will often be eliminated early, and it&#039;s rare that the contestant will be in a situation where he can win it.

They&#039;re entirely different scenarios that you cannot use the same math for. One is a single-decision, rigged-gameplay show... the other is a step-by-step show with many decisions and a lot of luck involved. They aren&#039;t the same at all.

[quote]
I do agree that the instantaneous probability does change, clearly, because at that instant in time there is a 25% chance that the case has a million.
I do not agree that this instantaneous probability takes precedence or re-evaluates the original probability, which is that picking the first case was a 97% fail rate. Regardless of how many cases are left, that 97% remains, under the presumption that the game is still in continuation (e.g. if the million is revealed prior to the four cases being left, the game of finding the million is already over). This is true because a moment in time existed when the case had a 97% fail rate.
[quote]
Let&#039;s say the contestant chose case #1, and has already opened cases 5 through 27.

Please tell me why you believe that case #2, #3, and #4 have better odds of containing the million than case #1.

Now let&#039;s suppose that the contestant chose case #4, and left #1-3 in play. Would case #4 magically be an inferior choice now, while #1 somehow has its chances improved?

The reality is that all four cases are the ones that the contestant has chosen to leave in play at this point in the game, and all four have equal chances to hold the million. The fact that one of them has been sitting in front of the contestant is irrelevant to the odds.</description>
		<content:encoded><![CDATA[<p class="quote_header"><a  href="http://nslog.com/2005/12/20/deal_or_no_deal_algorithm#comment-68926">James said</a> on January 2, 2012:</p>
<blockquote cite="http://nslog.com/2005/12/20/deal_or_no_deal_algorithm#comment-68926"><p>
Interestingly, the Monty Hall problem scenario DOES apply here, because we are under the assumption that upon reaching the four cases left, one of those remaining four is the million. Whether or not the "game master" was the one who removed them is irrelevant, all that matters is that the condition above exists..</p>
</blockquote>
<p>The Monty Hall scenario does not apply here. It is extremely relevant as to how this situation was reached.</p>
<p>In the Monty Hall scenario, the gameshow host always interferes with the game's odds, and always does so by removing a losing prize. The contestant will always find himself in a situation where the winning prize is still in play.</p>
<p>In DoND it's completely different. There is never any interference from outside. The contestant will very rarely find himself in a late-game situation where the million dollars is still in play - and if he does, it's because he's been very lucky already.</p>
<p>In Monty Hall, the winning prize is ALWAYS there, and the contestant will ALWAYS be in a situation where he can win it.</p>
<p>In DoND, the winning prize will often be eliminated early, and it's rare that the contestant will be in a situation where he can win it.</p>
<p>They're entirely different scenarios that you cannot use the same math for. One is a single-decision, rigged-gameplay show... the other is a step-by-step show with many decisions and a lot of luck involved. They aren't the same at all.</p>
<blockquote>
<p>I do agree that the instantaneous probability does change, clearly, because at that instant in time there is a 25% chance that the case has a million.<br />
I do not agree that this instantaneous probability takes precedence or re-evaluates the original probability, which is that picking the first case was a 97% fail rate. Regardless of how many cases are left, that 97% remains, under the presumption that the game is still in continuation (e.g. if the million is revealed prior to the four cases being left, the game of finding the million is already over). This is true because a moment in time existed when the case had a 97% fail rate.</p>
<blockquote>
<p>Let's say the contestant chose case #1, and has already opened cases 5 through 27.</p>
<p>Please tell me why you believe that case #2, #3, and #4 have better odds of containing the million than case #1.</p>
<p>Now let's suppose that the contestant chose case #4, and left #1-3 in play. Would case #4 magically be an inferior choice now, while #1 somehow has its chances improved?</p>
<p>The reality is that all four cases are the ones that the contestant has chosen to leave in play at this point in the game, and all four have equal chances to hold the million. The fact that one of them has been sitting in front of the contestant is irrelevant to the odds.</p>
</blockquote></blockquote>]]></content:encoded>
	</item>
</channel>
</rss>

