我正在嘗試編寫一個(gè)腳本，用非常規(guī)骰子模擬骰子游戲。游戲的目標(biāo)是根據(jù)重復(fù)實(shí)驗(yàn)來(lái)確定哪個(gè)骰子更好，其中較大的數(shù)字/滾動(dòng)獲勝。這是我到目前為止的工作示例：from random import randint, seedfrom datetime import datetimeimport itertools as itseed(datetime.now())def find_the_best_dice(dices):assert all(len(dice) == 6 for dice in dices)for dice1, dice2 in it.combinations(dices, 2):    num_rounds = 100    num_dice1_wins = 0    num_dice2_wins = 0    for _ in range(num_rounds):       dice1_result = dice1[randint(0, 5)]       dice2_result = dice2[randint(0, 5)]       if dice1_result > dice2_result:          num_dice1_wins += 1       elif dice2_result > dice1_result:          num_dice2_wins += 1     return ("index of winning dice or -1 if tie")find_the_best_dice(dices=[[1, 1, 6, 6, 8, 8], [2, 2, 4, 4, 9, 9], [3, 3, 5, 5, 7, 7]])我面臨的問(wèn)題是不知道如何存儲(chǔ)超過(guò) 2 個(gè)骰子的獲勝次數(shù)。