-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathminimal.py
163 lines (132 loc) · 3.33 KB
/
minimal.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
from mwmatching import maxWeightMatching
import copy
import math
K = 40
rond = 0
EXPONENT = 1.01
elos = [1825,1697,1684,1681,1644,1600,1598,1583,1561,1559,1539,1535,1532,1400]
names = "Johansson Björkdahl Silins Stolov Pettersson Aikio Israel Persson Liljeström Lehvonen Andersson Åberg Antonsson Strömbäck".split(' ')
def scoringProbability(diff): return 1 / (1 + 10 ** (diff / 400))
def updateElo(pa,pb) :
diff = pb.elo - pa.elo
amount = pa.res[rond] / 2 - scoringProbability(diff)
aold = pa.elo
bold = pb.elo
pa.elo += K * amount
pb.elo += -K * amount
print (pa.name, aold, '->',pa.elo, pb.name, bold, '->',pb.elo, diff, K * amount)
class Player:
def __init__(self,id,elo,name):
self.id = id
self.elo = elo
self.name = name
self.opp = []
self.col = []
self.res = []
def __str__(self):
return f"{self.id:2} {self.elo:.1f} {self.opp} {''.join(self.col)} {self.res} {self.name}"
def balans(self):
res = 0
for c in self.col:
if c=='w': res += 1
if c=='b': res -= 1
return res
def ok(pa,pb):
if pa.id in pb.opp: return False
return abs(pa.balans() + pb.balans()) < 2
def unscramble (solution): # [5,3,4,1,2,0] => [[0,5],[1,3],[2,4]]
#solution = _.clone solution
result = []
for i in range(len(solution)):
if solution[i] != -1:
j = solution[i]
result.append([i,j]) #[@players[i].id,@players[j].id]
solution[j] = -1
solution[i] = -1
return result
def otherResult(res): return 2 - res
def otherColor(col): return 'w' if col == 'b' else 'b'
def assignColors (a,b):
b0 = a.balans()
b1 = b.balans()
if b0 < b1: x = 0
elif b0 > b1: x = 1
else:
if a.id < b.id: x = 0
else: x = 1
a.col += 'wb'[x]
b.col += 'bw'[x]
def compare(pa,pb):
a = pa.name[0]
b = pb.name[0]
if a > b: return 0
if a == b: return 1
if a < b: return 2
def exec():
def solutionCost(pair):
[a, b] = pair
pa = players[a]
pb = players[b]
da = pa.elo
db = pb.elo
diff = abs(da - db)
return diff ** EXPONENT
def solutionCosts(pairs):
return sum(solutionCost(pair) for pair in pairs)
global rond
edges = []
n = len(elos)
for a in range(n):
pa = players[a]
for b in range(a+1,n):
pb = players[b]
if ok(pa,pb):
cost = abs(pa.elo - pb.elo) ** 1.01
edges.append([a,b,9999-cost])
for [a,b,c] in edges:
print(a,b,f"{9999-c:.1f}")
solution = maxWeightMatching(edges, maxcardinality=False)
print('solution',solution)
pairs = unscramble(solution)
print('solutionCosts',solutionCosts(pairs))
for i in range(len(pairs)):
[a,b] = pairs[i]
pa = players[a]
pb = players[b]
pa.opp.append(pb.id)
pb.opp.append(pa.id)
result = compare(pa,pb)
pa.res.append(result)
pb.res.append(2 - result)
if rond == 0:
col1 = "bw"[i%2]
col0 = otherColor(col1)
pa.col += col0
pb.col += col1
if col1=='w' : pairs[i].reverse()
else:
assignColors(pa,pb)
if pa.col[rond]=='b':
pairs[i].reverse()
[a,b] = pairs[i]
pa = players[a]
pb = players[b]
updateElo(pa,pb)
print('Standings')
for [a,b] in pairs:
pa = players[a]
pb = players[b]
print(pa.elo,pa.name,pb.elo,pb.name)
temp = copy.deepcopy(players)
# temp = players.copy()
temp.sort(key=lambda p: -p.elo)
for p in temp:
print(p)
print("")
rond += 1
# elos = [1000 + random()*1000 for i in range(n)]
players = []
for i in range(len(elos)):
players.append(Player(i+1, elos[i], names[i]))
for i in range(7):
exec()