Monty Hall Problem

最新推荐文章于 2023-02-14 11:49:01 发布

ywjun的学习笔记

最新推荐文章于 2023-02-14 11:49:01 发布

阅读量1.2k

点赞数

CC 4.0 BY-SA版权

分类专栏： Python 学习之Data analysis

本文链接：https://blog.youkuaiyun.com/ywjun0919/article/details/8675035

Python 学习之Data analysis 专栏收录该内容

8 篇文章

订阅专栏

本文通过Python模拟了著名的蒙提霍尔问题，探讨了在游戏节目中选择坚持最初选择、随机更换选择或是总是更换选择这三种策略下获胜的概率。实验结果显示，采取不同的策略将直接影响最终的胜率。

import sys
import random as rnd

#strategy=sys.argv[1]# must be 'stick','choose',or 'switch'

def Solve(strategy):
    wins = 0
    for trail in range(100):
    #The price is always in envelop 0... but we don't know that!
        envelopes = [0,1,2]
        first_chose = rnd.choice(envelopes)
        if first_chose == 0:
            envelopes = [0,rnd.choice([1,2])] #Randomly retain 1 or 2
        else:
            envelopes=[0,first_chose]# Retain winner and first choice

        if strategy == 'stick':
            second_choice = first_chose
        elif strategy == 'choose':
            second_choice= rnd.choice(envelopes)
        elif strategy == 'switch':
            envelopes.remove(first_chose)
            second_choice = envelopes[0]
        if second_choice ==0:
            wins += 1
    print strategy +':' + str( wins)
Solve('stick')
Solve('choose')
Solve('switch')