Monty Hall problem: Difference between revisions

m
(Nimrod -> Nim)
Line 3,345:
=={{header|X++}}==
{{output?|X++}}
<lang x++>//Evidence of the Monty Hall solution in Dynamics AX (by Wessel du Plooy - HiGH Software).
 
int changeWins = 0;
Line 3,379:
pause;
</lang>
 
Output:
<pre>Switching wins 21699 times.
Staying wins 11069 times.</pre>
 
=={{header|XPL0}}==
Anonymous user