InstantForum.NET v2.9.0SQLServerCentralhttp://www.sqlservercentral.com/Forums/notifications@sqlservercentral.comWed, 19 Jun 2013 21:00:14 GMT20http://www.sqlservercentral.com/Forums/Topic781385-1371-1.aspxVery cool alternative. Thanks for sharing! :)Wed, 09 Sep 2009 16:07:36 GMTSean Smith-776614http://www.sqlservercentral.com/Forums/Topic781385-1371-1.aspxThat is an interesting puzzle. Here is another solution using a CTE instead of a loop.[code]-- Setupset nocount on-- Create a table to store the results.create table Doors( ID int , ChosenDoor int , WinningDoor int , WinLose as case when ChosenDoor = WinningDoor then 0 else 1 end -- Win = 1, Lose = 0);-- Use a CTE to generate 10,000 "contestants" and their chosen/winning doors.-- If the chosen door equals the winning door the contestant will switch when given the-- option and lose. Otherwise they will switch to the winning door and win.with Digits(i)as (select i from (select 1 union select 2 union select 3 union select 4 union select 5 union select 6 union select 7 union select 8 union select 9 union select 0) AS X(i))insert into Doors(ID, ChosenDoor, WinningDoor)select (D3.i * 1000 + D2.i * 100 + D1.i * 10 + D0.i) AS seq , abs(cast(cast(newid() as varbinary) as int)) % 3 + 1 ChosenDoor , abs(cast(cast(newid() as varbinary) as int)) % 3 + 1 WinningDoor from Digits as D0, Digits as D1, Digits as D2, Digits as D3-- Select the total number of winners (1) and losers (0).select WinLose , count(*) Totalfrom Doorsgroup by WinLose-- Clean-updrop table Doorsset nocount off[/code]Wed, 09 Sep 2009 15:53:35 GMTJason Whitneyhttp://www.sqlservercentral.com/Forums/Topic781385-1371-1.aspx(removed)Wed, 09 Sep 2009 13:05:20 GMTTPalmerihttp://www.sqlservercentral.com/Forums/Topic781385-1371-1.aspxComments posted to this topic are about the item [B]<A HREF="/scripts/Monty/68012/">Monty Hall Paradox</A>[/B]Wed, 02 Sep 2009 06:45:09 GMTSean Smith-776614