AYTOcode.py

import itertools
import pickle #using Python 3.6.3
#---------------------
# Are You The One? Code
# Calculates the likelihoods of each couple being a perfect match (assuming all matches are equally likely)
# Each week, update the weeks choices and number of matches (as well as the allWeeks list!).
# Each week, update the truth booth information
#--------------------


# Specifies whether the matches should be loaded from the match file
# For the first few times you run, make sure this is set to False.
# Then you can change it to True in order to run faster.
load_from_file = False #keep as True if you have the latest allmatches.p file!

# guys and girls in alphabetical order
guys = ["Andrew", "Brett", "Cam", "Daniel", "Kwasi", "Lewis", "Moe", "Shamoy", "Tevin", "Tomas", "Zak"]
girls = ["Asia", "Bria", "Cali", "Jasmine", "Kayla", "Kenya", "Lauren", "Maria", "Morgan", "Nutsa", "Samantha"]

# (guesses, number of matches)
# Corresponds to the guys list. ie: in week1, "Francesca" was therfore with "Asaf"
week1 = (["Lauren", "Cali", "Kayla", "Nutsa", "Asia", "Samantha", "Jasmine", "Maria", "Kenya", "Morgan", "Bria"], 3)
week2 = (["Morgan", "Asia", "Kayla", "Nutsa", "Lauren", "Jasmine", "Bria", "Maria", "Kenya", "Cali", "Samantha"], 3)
week3 = (["Lauren", "Cali", "Kayla", "Samantha", "Jasmine", "Asia", "Nutsa", "Maria", "Kenya", "Bria", "Morgan"], 3)
week4 = (["Nutsa", "Kayla", "Asia", "Lauren", "Bria", "Kenya", "Samantha", "Maria", "Jasmine", "Cali", "Morgan"], 2)

#currentWeek stores the current weeks guesses, but before any Beams have been lit
# This is used for blackout odds and beaem probabilities.
# Don't worry about it if you just want to see the wiki table
# Use Instruction: if it is currently Week 4, put the current guesses in currentWeek (before the number of Beams have been revealed and run the code without including Week4 in the AllWeeks list
# Ignore these probabilities once you've added the week's beam results to the allWeeks list.
currentWeek = ["Nutsa", "Kayla", "Asia", "Lauren", "Jasmine", "Kenya", "Samantha", "Maria", "Bria", "Cali", "Morgan"]

#UPDATE THIS EVERY WEEK
# list of every weeks guesses
allWeeks = [week1, week2, week3, week4]

# the matches that got denied in the truth booth ("guy name", "girl name")
truthBooth_denied = [("Tomas", "Maria"), ("Andrew", "Asia"), ("Brett", "Kenya")]

# the matches that were confirmed in the truth booth
truthBooth_confirmed = [("Shamoy", "Maria")]

# returns the number of matches in common between two match lists
def correlation(list1, list2):
    total = 0
    for i in range(len(list1)):
        if list1[i] == list2[i]:
            total = total + 1
    return total

# returns whether a matchlist breaks a rule
def isImpossible(matchlist):
    for match in truthBooth_denied:
        if (matchlist[guys.index(match[0])] == match[1]):
            return True
    for match in truthBooth_confirmed:
        if (matchlist[guys.index(match[0])] != match[1]):
            return True
    for week in allWeeks:
        if correlation(matchlist, week[0]) != week[1]:
            return True        
    return False           

#list of possible matches
possible = []

if load_from_file: #load matches if previously stored
    iterable = pickle.load( open("allmatches.p", "rb") )
else: #generate all possible matches
    iterable = itertools.permutations(girls,len(girls))
for matching in iterable:
    # skip match lists that break a rule
    if isImpossible(matching):
        continue
    else:
        possible.append(matching)
        
print("There are " + str(len(possible)) + " possible matchings!")

def printRemaining():
    for matching in possible:
        printString = ""
        for i in range(len(matching)):
            printString = printString + ("("+guys[i]+", " + matching[i]+ ")")
        print(printString)
        print("")

#Determine how many couples are the same between 2 matchings
#Oops, just realized this is the same function as 'correlation'
def couplesInCommon(matching1, matching2):
    count = 0
    for i in range(0, len(matching1)):
        if matching2[i] == matching1[i]:
            count = count + 1
    return count

def makePercent(n):
    return (float(n) / len(possible))*100

#Determine the odds of a blackout
# What percent of remaining possible matchings contain 0 of this week's couples?
beamDistribution = [0] * (len(girls)+1)
for matching in possible:
    commonCount = couplesInCommon(matching, currentWeek)
    beamDistribution[commonCount] = beamDistribution[commonCount] + 1

mostLikelyBeamCount = 0
maxBeamCount = 0
highestBeamIndex = 0
lowestBeamIndex = 0
for i in range(0, len(beamDistribution)):
    beamCount = beamDistribution[i]
    if beamCount != 0:
        highestBeamIndex = i
    if beamCount > maxBeamCount:
        maxBeamCount = beamCount
        mostLikelyBeamCount = i
for i in range(0, len(beamDistribution)-1):
    beamCount = beamDistribution[i]
    if beamCount != 0:
        lowestBeamIndex = i
        break

#excludes truth booth perfect matches
blackOutPercent = makePercent(beamDistribution[len(truthBooth_confirmed)])


#Beam Distribution Percentages
distString = ''
for i in range(0, len(beamDistribution)):
    distString = distString + ', '+ str(makePercent(beamDistribution[i]))[:str(makePercent(beamDistribution[i])).index('.')]+'%'

#Print tweet format
print('Beam Probabilities: [' + distString[2:] + ']')
print('Most likely Beam Count: ' + str(mostLikelyBeamCount))
#print('Max Beam Count: ' + str(highestBeamIndex))
print('Blackout Odds: ' + str(blackOutPercent)+'%')
print('#AYTO  @AREUTHE1')

print('')
    
# initialize dictionary
match_dictionary = {}
for guy in guys:
    match_dictionary[guy] = [0] * len(girls)

# fill in dictionary
for matching in possible:
    for guy in guys:
        match_dictionary[guy][girls.index(matching[guys.index(guy)])] += float(1)/len(possible)

#determine best matching
def determineBestMatching():
    best_match_score = 0
    best_matching = []
    for matching in possible:
        score = 0
        for guy in guys:
            score += match_dictionary[guy][girls.index(matching[guys.index(guy)])]
        #print("score " + str(score))
        if score > best_match_score:
            best_match_score = score
            best_matching = matching
    print("Best score " + str(best_match_score))

    best_string = ""
    for i in range(len(best_matching)):
        best_string += '''||style="background:#CFCFCF"|''' + """'''"""+ guys[i] + ", " +best_matching[i]+"""'''"""
    return best_string

def printBestMatching():
    best_string = determineBestMatching()
    print('''{| class="wikitable"''')
    print("|-")
    print(best_string[1:])
    print("""|}""")

#print all remaining scores
def printAllScores():
    for matching in possible:
        score = 0
        for guy in guys:
            score += match_dictionary[guy][girls.index(matching[guys.index(guy)])]
        print("Score " + str(score))
        printString = ""
        for i in range(len(matching)):
            printString = printString + ("("+guys[i]+", " + matching[i]+ ")")
        print(printString)
        print("")

# prints the percent of possible matchings that contain each couple
def printAll():
    for key in sorted(match_dictionary.keys()):
        print(key.upper())
        matchPercents = ""
        for i in range(len(match_dictionary[key])):
            matchPercents += " " + str(girls[i]) + " " + "%.1f%%" % (100*match_dictionary[key][i])
        print(matchPercents)

#prints the top match for each guy
def printMaxGuys():
    for key in sorted(match_dictionary.keys()):
        print(key.upper())
        matchPercents = ""
        maxPercent = 0
        maxIndex = 0
        for i in range(len(match_dictionary[key])):
            percent = match_dictionary[key][i]
            if percent > maxPercent:
                maxPercent = percent
                maxIndex = i
        
        matchPercents += " " + str(girls[maxIndex]) + " " + "%.1f%%" % (100*match_dictionary[key][maxIndex])
        print(matchPercents)

#prints the top match for each girl
def printMaxGirls():
    for i in range(len(guys)):
        print(girls[i].upper())
        maxPercent = 0
        maxIndex = 0
        matchPercents = ""
        for key in sorted(match_dictionary.keys()):
            percent = match_dictionary[key][i]
            if percent > maxPercent:
                maxPercent = percent
                maxIndex = key

        matchPercents += " " + str(maxIndex) + " " + "%.1f%%" % (100*match_dictionary[maxIndex][i])
        print(matchPercents)


# prints the table in wikitable format
def printTable():
    #Key/table colors
    colorKey = "#CFCFCF"
    color0 = "#F9F9F9" # 0
    color1 = "#FF9999" # 0->9
    color2 = "#FF6666" # 10->24
    color3 = "#FF3333" # 24->49
    color4 = "#E60000" # 50->74
    color5 = "#990000" # 75-99
    color6 = "#00CC00" # 100 from Truth Booth
    colWidth = "60px" #specifies the width of each column in the table

    #print Hide Begin
    print('{{Hidden begin |showhide=left')
    print('| titlestyle = background:pink;')
    print('| title = Match Percentage Table}}')
    
    #print key
    print('{| class="wikitable"')
    print('|-')
    print("""| style="background:"""+colorKey+""""|'''Key'''||style="background:"""+color0+""""|'''0%'''|| style="background:"""+color1+""""|'''0-9%'''|| style="background:"""+color2+""""|'''10-24%'''|| style="background:"""+color3+""""|'''25-49%'''|| style="background:"""+color4+""""|'''50-74%'''||style="background:"""+color5+""""|'''75-99%'''||style="background:"""+color6+""""|'''100%'''
|}""")
    
    print('{| class="wikitable" style="text-align:right"')
    print("|-")
    #table header
    print('! !! style="width:'+ colWidth+ '"|' + girls[0] + '!! style="width:'+colWidth+'"|' + girls[1] + '!! style="width:'+colWidth+'"|' + girls[2] + '!! style="width:'+colWidth+'"|' + girls[3] + '!! style="width:'+colWidth+'"|' + girls[4] + '!! style="width:'+colWidth+'"|' + girls[5] + '!! style="width:'+colWidth+'"|' + girls[6] + '!! style="width:'+colWidth+'"|' + girls[7] + '!! style="width:'+colWidth+'"|' + girls[8] + '!! style="width:'+colWidth+'"|' + girls[9] + '!! style="width:'+colWidth+'"|' + girls[10])
    # table cells
    for key in sorted(match_dictionary.keys()):
        print("|-")
        matchPercents = "| <b>" + str(key) + "</b>"
        for i in range(len(match_dictionary[key])):
            if int(round(100*match_dictionary[key][i])) == 0:
                matchPercents += '||style="background:' + color0 +'"| <b>' + "%.0f%%" % (100*match_dictionary[key][i]) + "</b>"
            elif 10 > int(round(100*match_dictionary[key][i])) > 0:
                matchPercents += '||style="background:' + color1 + '"| <b>' + "%.0f%%" % (100*match_dictionary[key][i]) + "</b>"
            elif 25 > int(round(100*match_dictionary[key][i])) >= 10:
                matchPercents += '||style="background:' + color2 + '"| <b>' + "%.0f%%" % (100*match_dictionary[key][i]) + "</b>"
            elif 50 > int(round(100*match_dictionary[key][i])) >= 25:
                matchPercents += '||style="background:' + color3 + '"| <b>' + "%.0f%%" % (100*match_dictionary[key][i]) + "</b>"
            elif 75 > int(round(100*match_dictionary[key][i])) >= 50:
                matchPercents += '||style="background:' + color4 + '"| <b>' + "%.0f%%" % (100*match_dictionary[key][i]) + "</b>"
            elif 100> int(round(100*match_dictionary[key][i])) >= 75:
                matchPercents += '||style="background:' + color5 + '"| <b>' + "%.0f%%" % (100*match_dictionary[key][i]) + "</b>"
            elif int(round(100*match_dictionary[key][i])) == 100:
                matchPercents += '||style="background:' + color6 + '"| <b>' + "%.0f%%" % (100*match_dictionary[key][i]) + "</b>"
            else:
                matchPercents += "|| " + "%.0f%%" % (100*match_dictionary[key][i])
        print(matchPercents)
    print("|}")

    #print Hide End
    print('{{Hidden end}}')


printTable()


if not load_from_file: #save matches into a file
    pickle.dump(possible, open("allmatches.p", "wb"))