Python Coin Toss Simulation of Binomial Theorem

python_binomial_cointoss.py

# python 3.6

### 10 heads in a row, 10 tails in a row
from collections import Counter
from itertools import groupby

print(1 / (.50 ** 11))
# 1024 tosses to get 1 string of heads or tails consecutive

outcomes = ''
for toss in range(1024):
    toss_outcome = np.random.random()
    if toss_outcome < .50:
        outcomes += 'H'
    if toss_outcome > .50:
        outcomes += 'T'
        
Counter(outcomes)

outcome_tracker = []

for key, group in groupby(outcomes):
    outcome_tracker.append( (key, len(list(group))) )   
    
sorted(outcome_tracker, key=lambda x: x[1], reverse=True)[:10]

all_tails = [x[1] for x in 
             sorted(outcome_tracker, key=lambda x: x[1], reverse=True) if x[0] == 'H']

Counter(all_tails).most_common(10)