python itertools.product,python itertools产品重复出现

I'm trying to make a python script to calculate some win/loss chances.

to do this i'm trying to get all possible combinations off wins and losses (K is the number of wins needed to win the game):

for combination in itertools.product(['W','L'], repeat=(K*2)-1):

if ((combination.count('L') < K) and (combination.count('W') == K)):

#calculate the chance of this situation happening

for some reason this works fine, until the repeat becomes to big (for instance if K=25)

Can someone give me some pointers on how to solve this?

解决方案

Of course it fails when the repeat becomes large. The loop

for combination in itertools.product(['W','L'], repeat=(K*2)-1):

iterates through 2**(K*2-1) elements, which becomes prohibitively large very quickly. For example, when K=3, the loop executes 32 times, but when K=25 it executes 562949953421312 times.

You should not exhaustively try to enumerate all possible combination. A little bit of mathematics can help you: see Binomial Distribution.

Here is how to use the Binomial Distribution to solve your problem: If chance to win a single game is p, then the chance to lose is 1-p. You want to know what is the probability of winning k out of n games. It is:

(n choose k) * p**k (1 - p)**(n - k)

Here (n choose k) is the number of combinations that have exactly k wins.

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值