Ttykuu

Just wondering if there is a way to run the piece of code below more efficiently. I just started to get acquainted with parallel program and think this might be an answer? But I have no idea how to do it using imap or processes...any help?

This is what the function is doing: it gets two arrays of tuples with 5 items each - hand = [H1,H2,H3,H4,H5] and board = [B1,B2,B3,B4,B5]

What I need to do is check all arrays formed by 2 items from hand and 3 items from board, like combination = [Hn,Hm,Bi,Bj,Bk] (100 combinations in total)

Then I need to compare each one of the combinations against a dictionary to get the combination rank, and then return the best array (best rank) and the rank itself:

def check_hand(hand, board, dictionary_A, dictionary_B):

 best_hand = []
 first_int = True

 for h1 in range (0, 4):
 for h2 in range (h1+1, 5):
 for b1 in range (0, 3):
 for b2 in range (b1+1, 4):
 for b3 in range (b2+1, 5):
 hand_check = []
 hand_check.append(mao[m1])
 hand_check.append(mao[m2])
 hand_check.append(board[b1])
 hand_check.append(board[b2])
 hand_check.append(board[b3])
 hand_check = sort(hand_check) //Custom sort for my array of objects
 hand_ranks = "".join([str(hand_check[0].rank),str(hand_check[1].rank),str(hand_check[2].rank),str(hand_check[3].rank),str(hand_check[4].rank)])

 if (hand_check[0].suit == hand_check[1].suit and hand_check[1].suit == hand_check[2].suit and hand_check[2].suit == hand_check[3].suit and hand_check[3].suit == hand_check[4].suit):
 control = [dictionary_A[hand_ranks][0],dictionary_A[hand_ranks][1]]
 else:
 control = [dictionary_B[hand_ranks][0],dictionary_B[hand_ranks][1]]

 if first_int:
 best_hand = hand_check
 rank = control
 first_int = False
 elif (int(control[0]) > int(rank[0])):
 rank = control
 best_hand = hand_check 
 elif (int(control[0]) == int(rank[0])):
 if (int(control[1]) > int(rank[1])): 
 rank = control
 best_hand = hand_check 

 return best_hand, rank[0]

I need to run this check for 2 million different hands and interact over 1000 times for every hand (Ideally I would run it for at least 100000 times for every hand, for a more statistically accurate result).
Any ideas on how to make it more efficient?