Парадокс Монти Холла

import numpy as np
# generate random integer values
from random import seed
from random import randint
# seed random number generator
seed(1344)
x = np.zeros((1000,3,3)) # Make a 10 by 20 by 30 array
for i in range(1000):
    r = randint(0,2)
    x[i,r,0] = 1
for i in range(1000):
    r = randint(0,2)
    x[i,r,1] = 1

for i in range(1000):
    if x[i,0,0] == 1 and x[i,0,1] == 1:
        rr = randint(0,1) + 1
        x[i,rr,2] = 1
    if x[i,0,0] == 1 and x[i,1,1] == 1:
        x[i,2,2] = 1
    if x[i,0,0] == 1 and x[i,2,1] == 1:
        x[i,1,2] = 1

    if x[i,1,0] == 1 and x[i,0,1] == 1:
        x[i,2,2] = 1
    if x[i,1,0] == 1 and x[i,1,1] == 1:
        rr = randint(0,1)*2
        x[i,rr,2] = 1
    if x[i,1,0] == 1 and x[i,2,1] == 1:
        x[i,0,2] = 1

    if x[i,2,0] == 1 and x[i,0,1] == 1:
        x[i,1,2] = 1
    if x[i,2,0] == 1 and x[i,1,1] == 1:
        x[i,0,2] = 1
    if x[i,2,0] == 1 and x[i,2,1] == 1:
        rr = randint(0,1)
        x[i,rr,2] = 1

winbystay = 0
winbychange = 0

for i in range(1000):
    for ii in range(3):
        if x[i,ii,0] == 1 and x[i,ii,1] == 1:
            winbystay = winbystay + 1
        if x[i,ii,0] == 1 and x[i,ii,1] == 0 and x[i,ii,2] == 0:
            winbychange = winbychange + 1
print(winbystay)
print(winbychange)