问题:我需要掷 3 个骰子。如果两个(或三个)骰子返回相同的数字,则停止。如果 3 个骰子都是唯一的(例如 2、4 和 6),则再次掷骰子。执行此操作,直到掷出双倍/三倍,或 7 次,以先到者为准。
注意:我是 python 新手。
这是我到目前为止所拥有的,但这实际上是生成了 216 种可能的组合:
import itertools
all_possible = list(itertools.permutations([1,2,3,4,5,6],3))
input = raw_input()
print all_possible
这会产生这种类型的输出:
[(1, 2, 3), (1, 2, 4), (1, 2, 5), (1, 2, 6), (1, 3, 2), (1, 3, 4), (1, 3, 5), (1, 3, 6), (1, 4, 2), (1, 4, 3), (1, 4, 5), (1, 4, 6), (1, 5, 2), (1, 5, 3), (1, 5, 4), (1, 5, 6), (1, 6, 2), (1, 6, 3), (1, 6, 4), (1, 6, 5), (2, 1, 3), (2, 1, 4), (2, 1, 5), (2, 1, 6), (2, 3, 1), (2, 3, 4), (2, 3, 5), (2, 3, 6), (2, 4, 1), (2, 4, 3), (2, 4, 5), (2, 4, 6), (2, 5, 1), (2, 5, 3), (2, 5, 4), (2, 5, 6), (2, 6, 1), (2, 6, 3), (2, 6, 4), (2, 6, 5), (3, 1, 2), (3, 1, 4), (3, 1, 5), (3, 1, 6), (3, 2, 1), (3, 2, 4), (3, 2, 5), (3, 2, 6), (3, 4, 1), (3, 4, 2), (3, 4, 5), (3, 4, 6), (3, 5, 1), (3, 5, 2), (3, 5, 4), (3, 5, 6), (3, 6, 1), (3, 6, 2), (3, 6, 4), (3, 6, 5), (4, 1, 2), (4, 1, 3), (4, 1, 5), (4, 1, 6), (4, 2, 1), (4, 2, 3), (4, 2, 5), (4, 2, 6), (4, 3, 1), (4, 3, 2), (4, 3, 5), (4, 3, 6), (4, 5, 1), (4, 5, 2), (4, 5, 3), (4, 5, 6), (4, 6, 1), (4, 6, 2), (4, 6, 3), (4, 6, 5), (5, 1, 2), (5, 1, 3), (5, 1, 4), (5, 1, 6), (5, 2, 1), (5, 2, 3), (5, 2, 4), (5, 2, 6), (5, 3, 1), (5, 3, 2), (5, 3, 4), (5, 3, 6), (5, 4, 1), (5, 4, 2), (5, 4, 3), (5, 4, 6), (5, 6, 1), (5, 6, 2), (5, 6, 3), (5, 6, 4), (6, 1, 2), (6, 1, 3), (6, 1, 4), (6, 1, 5), (6, 2, 1), (6, 2, 3), (6, 2, 4), (6, 2, 5), (6, 3, 1), (6, 3, 2), (6, 3, 4), (6, 3, 5), (6, 4, 1), (6, 4, 2), (6, 4, 3), (6, 4, 5), (6, 5, 1), (6, 5, 2), (6, 5, 3), (6, 5, 4)]
这也不是很好,因为它只产生没有双倍或三倍 - 据我所知,一切都只是独特的组合。
----------更新----------- 好的--我拿了这个并通过从数组中剥离每个值并将它们求和来稍微扩展它(可能至少可能的有效方式)。它可以工作,如果在休息之前生成了多个集合,它们都会打印出来。我现在要做的是总结。所以:
def gen_random_termagants():
for _ in range(7):
# instead of three separate variables, we use a list here
# the nice thing is, that you can freely vary the number of
# 'parallel' dice rolls this way
dice = [random.randint(1, 6) for _ in range(3)]
# this is more general and will break as soon as there are
# duplicate (die) values in the list (meaning, break, if not all elements
# are different)
first_die = dice[0]
second_die = dice[1]
third_die = dice[2]
total_term = first_die + second_die + third_die
print "Total: %s" % total_term
if len(dice) > len(set(dice)):
break
这是输出示例:
How many tervigons? ::>3
Let's calculate some termagants based on 3 tervigons...
You'll get a minimum of 9 termagants per turn.
You'll get a maximum of 54 termagants per turn.
minimums: 5 turns [45] :: 6 turns [54] :: 7 turns [63]
averages: 5 turns [157] :: 6 turns [189] :: 7 turns [220]
maximums: 5 turns [270] :: 6 turns [324] :: 7 turns [378]
Total: 9
Total: 8
所以在这个例子中,我希望它返回 17(即 9 + 8)。