我正在尝试学习Python库itertools
,我认为一个很好的测试是模拟骰子。使用product
生成所有可能的卷并使用collections
库计算可能的方法数量很容易。我正试图解决像Monopoly这样的游戏中遇到的问题:当双打滚动时,你再次滚动,你的最终总数是两个滚动的总和。
以下是我解决问题的开始尝试:两个计数器,一个用于双打,另一个用于双打。我不确定是否有一种很好的方法来组合它们,或者两个计数器是否是最好的方法。
我正在寻找一种灵活的解决方法(通过枚举)使用itertools和集合来解决骰子掷骰问题。
import numpy as np
from collections import Counter
from itertools import *
die_n = 2
max_num = 6
die = np.arange(1,max_num+1)
C0,C1 = Counter(), Counter()
for roll in product(die,repeat=die_n):
if len(set(roll)) > 1: C0[sum(roll)] += 1
else: C1[sum(roll)] += 1
答案 0 :(得分:1)
为了简单起见,在此留出numpy
:
首先,生成所有卷筒,无论是单卷还是双卷:
from itertools import product
from collections import Counter
def enumerate_rolls(die_n=2, max_num=6):
for roll in product(range(1, max_num + 1), repeat=die_n):
if len(set(roll)) != 1:
yield roll
else:
for second_roll in product(range(1, max_num + 1), repeat=die_n):
yield roll + second_roll
现在进行一些测试:
print(len(list(enumerate_rolls()))) # 36 + 6 * 36 - 6 = 246
A = list(enumerate_rolls(5, 4))
print(len(A)) # 4 ** 5 + 4 * 4 ** 5 - 4 = 5116
print(A[1020:1030]) # some double rolls (of five dice each!) and some single rolls
结果:
246
5116
[(1, 1, 1, 1, 1, 4, 4, 4, 4, 1), (1, 1, 1, 1, 1, 4, 4, 4, 4, 2), (1, 1, 1, 1, 1, 4, 4, 4, 4, 3), (1, 1, 1, 1, 1, 4, 4, 4, 4, 4), (1, 1, 1, 1, 2), (1, 1, 1, 1, 3), (1, 1, 1, 1, 4), (1, 1, 1, 2, 1), (1, 1, 1, 2, 2), (1, 1, 1, 2, 3)]
要获得总计,请使用特殊的Counter
功能:
def total_counts(die_n=2, max_num=6):
return Counter(map(sum, enumerate_rolls(die_n, max_num)))
print(total_counts())
print(total_counts(5, 4))
结果:
Counter({11: 18, 13: 18, 14: 18, 15: 18, 12: 17, 16: 17, 9: 16, 10: 16, 17: 16, 18: 14, 8: 13, 7: 12, 19: 12, 20: 9, 6: 8, 5: 6, 21: 6, 22: 4, 4: 3, 3: 2, 23: 2, 24: 1})
Counter({16: 205, 17: 205, 18: 205, 19: 205, 21: 205, 22: 205, 23: 205, 24: 205, 26: 205, 27: 205, 28: 205, 29: 205, 25: 204, 20: 203, 30: 203, 15: 202, 14: 200, 31: 200, 13: 190, 32: 190, 12: 170, 33: 170, 11: 140, 34: 140, 35: 102, 10: 101, 9: 65, 36: 65, 8: 35, 37: 35, 7: 15, 38: 15, 6: 5, 39: 5, 40: 1})
注意:此时,无法计算总计的概率。您必须知道它是双卷还是整卷才能正确称重。