from deuces.deuces import Card, Deck
from convenience import who_wins

p1 = [Card.new('As'), Card.new('Ac')]
p2 = [Card.new('Ad'), Card.new('Kd')]
win_record = []

for i in range(100000):
    deck = Deck()
    b = []
    while len(b) < 5:
        c = deck.draw()
        if c in p1 or c in p2:
            continue
        b.append(c)
    win_record.append(who_wins(b, p1, p2, printout = False))

Card.print_pretty_cards(p1)
print win_record.count(1) / float(len(win_record))
Card.print_pretty_cards(p2)
print win_record.count(2) / float(len(win_record))

@@ -62,16 +62,46 @@
 who_wins
+, pr%0Afrom copy import deepcopy
 %0A%0Ap1 = %5B
@@ -170,16 +170,72 @@
 ('Kd')%5D%0A
+%0Adef find_pcts(p1, p2, start_b = %5B%5D, iter = 10000):%0A    
 win_reco
@@ -242,17 +242,20 @@
 rd = %5B%5D%0A
-%0A
+    
 for i in
@@ -265,17 +265,19 @@
 nge(
-100000):%0A
+iter):%0A    
     
@@ -294,16 +294,20 @@
 k()%0A
+    
     b = 
 %5B%5D%0A 
@@ -302,19 +302,38 @@
     b = 
-%5B%5D%0A
+deepcopy(start_b)%0A    
     whil
@@ -354,16 +354,20 @@
         
+    
 c = deck
@@ -382,16 +382,20 @@
         
+    
 if c in 
@@ -401,18 +401,16 @@
  p1 
-or c in p2
++ p2 + b
 :%0A  
@@ -419,16 +419,20 @@
         
+    
 continue
@@ -440,16 +440,20 @@
         
+    
 b.append
@@ -456,16 +456,20 @@
 pend(c)%0A
+    
     win_
@@ -525,42 +525,78 @@
 e))%0A
-%0ACard.print_pretty_cards(p1)%0Aprint
+    return %5Bwin_record.count(1) / float(len(win_record)), %0A           
  win
@@ -601,33 +601,33 @@
 in_record.count(
-1
+2
 ) / float(len(wi
@@ -637,16 +637,23 @@
 ecord))%0A
+    %5D%0A%0A
 Card.pri
@@ -673,58 +673,59 @@
 ds(p
-2)%0Aprint win_record.count(2) / float(len(win_record)
+1)%0ACard.print_pretty_cards(p2)%0Aprint find_pcts(p1, p2
 )%0A

Make find_pcts() function that can repetitively run.