モンティ・ホール問題のシミュレーション、ドアを変えたほうが当たる確率が高い

monty_hole.py

import random

doors = [True, False, False]

def get_false():
  s = []

  for i, d in enumerate(doors):
    if not d:
      s.append(i)

  return s

def get_true():
  s = []

  for i, d in enumerate(doors):
    if d:
      return i

cnt = 0

for i in range(0, 100000):
  random.shuffle(doors)
  s = random.randint(0, 2)

  while True:
    m = random.randint(0, 1)
    m = get_false()[m]

    if m != s:
      break

  for i in range(0, 3):
    if i != s and i != m:
      s = i
      break

  if s == get_true():
    cnt += 1

print(cnt)