RE : Monty Hall Problem with 32 lines of Etoys

Hi,

Very interesting this problem and Matkus is specialist for very nice and short programms.

It give me the idea to learn more Kedama solving it with Kedama. This is done, see

http://superswikifr.ofset.org:8000/super/uploads/montyKeddama.011.pr

The text in the project is in french but it is just explaining the problem.

Use the 'init' button to create the turtles. Then 'jouer' (play) as often as you want.
Each time 2000 turtles are playing. Green dots winning with change .Blue dots winning without change. The density of dots is an estination of the probabilities.

The 3 doors are just positions right of a turtle. Winning position is marked by a yellow patch.

You can hide turtles  to see the patch using the button 'cache'. and show them using 'montre'.

Regards


-------- Message d'origine--------
De: [hidden email] de la part de Markus Gaelli
Date: jeu. 04/05/2006 10:50
À: Squeakland
Objet : [Squeakland] Monty Hall Problem with 32 lines of Etoys
 
http://www.squeakland.org/project.jsp?http://www.emergent.de/pub/ 
smalltalk/squeak/projects/MontyHall.pr

Have fun,

Markus
_______________________________________________
Squeakland mailing list
[hidden email]
http://squeakland.org/mailman/listinfo/squeakland


_______________________________________________
Squeakland mailing list
[hidden email]
http://squeakland.org/mailman/listinfo/squeakland