forked from KenMercusLai/checkio
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Unfair Dice.py
737 lines (632 loc) · 25.8 KB
/
Unfair Dice.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
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
import copy
class Problem(object):
def __init__(self, solver=None):
self._solver = solver or BacktrackingSolver()
self._constraints = []
self._variables = {}
def reset(self):
del self._constraints[:]
self._variables.clear()
def setSolver(self, solver):
self._solver = solver
def getSolver(self):
return self._solver
def addVariable(self, variable, domain):
if variable in self._variables:
raise ValueError, "Tried to insert duplicated variable %s" % \
repr(variable)
if type(domain) in (list, tuple):
domain = Domain(domain)
elif isinstance(domain, Domain):
domain = copy.copy(domain)
else:
raise TypeError, "Domains must be instances of subclasses of "\
"the Domain class"
if not domain:
raise ValueError, "Domain is empty"
self._variables[variable] = domain
def addVariables(self, variables, domain):
for variable in variables:
self.addVariable(variable, domain)
def addConstraint(self, constraint, variables=None):
if not isinstance(constraint, Constraint):
if callable(constraint):
constraint = FunctionConstraint(constraint)
else:
raise ValueError, "Constraints must be instances of "\
"subclasses of the Constraint class"
self._constraints.append((constraint, variables))
def getSolution(self):
domains, constraints, vconstraints = self._getArgs()
if not domains:
return None
return self._solver.getSolution(domains, constraints, vconstraints)
def getSolutions(self):
domains, constraints, vconstraints = self._getArgs()
if not domains:
return []
return self._solver.getSolutions(domains, constraints, vconstraints)
def getSolutionIter(self):
domains, constraints, vconstraints = self._getArgs()
if not domains:
return iter(())
return self._solver.getSolutionIter(domains, constraints,
vconstraints)
def _getArgs(self):
domains = self._variables.copy()
allvariables = domains.keys()
constraints = []
for constraint, variables in self._constraints:
if not variables:
variables = allvariables
constraints.append((constraint, variables))
vconstraints = {}
for variable in domains:
vconstraints[variable] = []
for constraint, variables in constraints:
for variable in variables:
vconstraints[variable].append((constraint, variables))
for constraint, variables in constraints[:]:
constraint.preProcess(variables, domains,
constraints, vconstraints)
for domain in domains.values():
domain.resetState()
if not domain:
return None, None, None
#doArc8(getArcs(domains, constraints), domains, {})
return domains, constraints, vconstraints
def getArcs(domains, constraints):
arcs = {}
for x in constraints:
constraint, variables = x
if len(variables) == 2:
variable1, variable2 = variables
arcs.setdefault(variable1, {})\
.setdefault(variable2, [])\
.append(x)
arcs.setdefault(variable2, {})\
.setdefault(variable1, [])\
.append(x)
return arcs
def doArc8(arcs, domains, assignments):
check = dict.fromkeys(domains, True)
while check:
variable, _ = check.popitem()
if variable not in arcs or variable in assignments:
continue
domain = domains[variable]
arcsvariable = arcs[variable]
for othervariable in arcsvariable:
arcconstraints = arcsvariable[othervariable]
if othervariable in assignments:
otherdomain = [assignments[othervariable]]
else:
otherdomain = domains[othervariable]
if domain:
changed = False
for value in domain[:]:
assignments[variable] = value
if otherdomain:
for othervalue in otherdomain:
assignments[othervariable] = othervalue
for constraint, variables in arcconstraints:
if not constraint(variables, domains,
assignments, True):
break
else:
# All constraints passed. Value is safe.
break
else:
# All othervalues failed. Kill value.
domain.hideValue(value)
changed = True
del assignments[othervariable]
del assignments[variable]
# if changed:
# check.update(dict.fromkeys(arcsvariable))
if not domain:
return False
return True
class Solver(object):
def getSolution(self, domains, constraints, vconstraints):
raise NotImplementedError, \
"%s is an abstract class" % self.__class__.__name__
def getSolutions(self, domains, constraints, vconstraints):
raise NotImplementedError, \
"%s provides only a single solution" % self.__class__.__name__
def getSolutionIter(self, domains, constraints, vconstraints):
raise NotImplementedError, \
"%s doesn't provide iteration" % self.__class__.__name__
class BacktrackingSolver(Solver):
def __init__(self, forwardcheck=True):
self._forwardcheck = forwardcheck
def getSolutionIter(self, domains, constraints, vconstraints):
forwardcheck = self._forwardcheck
assignments = {}
queue = []
while True:
# Mix the Degree and Minimum Remaing Values (MRV) heuristics
lst = [(-len(vconstraints[variable]),
len(domains[variable]), variable) for variable in domains]
lst.sort()
for item in lst:
if item[-1] not in assignments:
# Found unassigned variable
variable = item[-1]
values = domains[variable][:]
if forwardcheck:
pushdomains = [domains[x] for x in domains
if x not in assignments and
x != variable]
else:
pushdomains = None
break
else:
# No unassigned variables. We've got a solution. Go back
# to last variable, if there's one.
yield assignments.copy()
if not queue:
return
variable, values, pushdomains = queue.pop()
if pushdomains:
for domain in pushdomains:
domain.popState()
while True:
# We have a variable. Do we have any values left?
if not values:
# No. Go back to last variable, if there's one.
del assignments[variable]
while queue:
variable, values, pushdomains = queue.pop()
if pushdomains:
for domain in pushdomains:
domain.popState()
if values:
break
del assignments[variable]
else:
return
# Got a value. Check it.
assignments[variable] = values.pop()
if pushdomains:
for domain in pushdomains:
domain.pushState()
for constraint, variables in vconstraints[variable]:
if not constraint(variables, domains, assignments,
pushdomains):
# Value is not good.
break
else:
break
if pushdomains:
for domain in pushdomains:
domain.popState()
# Push state before looking for next variable.
queue.append((variable, values, pushdomains))
raise RuntimeError, "Can't happen"
def getSolution(self, domains, constraints, vconstraints):
iter = self.getSolutionIter(domains, constraints, vconstraints)
try:
return iter.next()
except StopIteration:
return None
def getSolutions(self, domains, constraints, vconstraints):
return list(self.getSolutionIter(domains, constraints, vconstraints))
class Variable(object):
def __init__(self, name):
"""
@param name: Generic variable name for problem-specific purposes
@type name: string
"""
self.name = name
def __repr__(self):
return self.name
Unassigned = Variable("Unassigned")
class Domain(list):
def __init__(self, set):
list.__init__(self, set)
self._hidden = []
self._states = []
def resetState(self):
self.extend(self._hidden)
del self._hidden[:]
del self._states[:]
def pushState(self):
self._states.append(len(self))
def popState(self):
diff = self._states.pop() - len(self)
if diff:
self.extend(self._hidden[-diff:])
del self._hidden[-diff:]
def hideValue(self, value):
list.remove(self, value)
self._hidden.append(value)
class Constraint(object):
def __call__(self, variables, domains, assignments, forwardcheck=False):
return True
def preProcess(self, variables, domains, constraints, vconstraints):
if len(variables) == 1:
variable = variables[0]
domain = domains[variable]
for value in domain[:]:
if not self(variables, domains, {variable: value}):
domain.remove(value)
constraints.remove((self, variables))
vconstraints[variable].remove((self, variables))
def forwardCheck(self, variables, domains, assignments,
_unassigned=Unassigned):
unassignedvariable = _unassigned
for variable in variables:
if variable not in assignments:
if unassignedvariable is _unassigned:
unassignedvariable = variable
else:
break
else:
if unassignedvariable is not _unassigned:
# Remove from the unassigned variable domain's all
# values which break our variable's constraints.
domain = domains[unassignedvariable]
if domain:
for value in domain[:]:
assignments[unassignedvariable] = value
if not self(variables, domains, assignments):
domain.hideValue(value)
del assignments[unassignedvariable]
if not domain:
return False
return True
class FunctionConstraint(Constraint):
def __init__(self, func, assigned=True):
self._func = func
self._assigned = assigned
def __call__(self, variables, domains, assignments, forwardcheck=False,
_unassigned=Unassigned):
parms = [assignments.get(x, _unassigned) for x in variables]
missing = parms.count(_unassigned)
if missing:
return ((self._assigned or self._func(*parms)) and
(not forwardcheck or missing != 1 or
self.forwardCheck(variables, domains, assignments)))
return self._func(*parms)
class AllDifferentConstraint(Constraint):
def __call__(self, variables, domains, assignments, forwardcheck=False,
_unassigned=Unassigned):
seen = {}
for variable in variables:
value = assignments.get(variable, _unassigned)
if value is not _unassigned:
if value in seen:
return False
seen[value] = True
if forwardcheck:
for variable in variables:
if variable not in assignments:
domain = domains[variable]
for value in seen:
if value in domain:
domain.hideValue(value)
if not domain:
return False
return True
class AllEqualConstraint(Constraint):
def __call__(self, variables, domains, assignments, forwardcheck=False,
_unassigned=Unassigned):
singlevalue = _unassigned
for variable in variables:
value = assignments.get(variable, _unassigned)
if singlevalue is _unassigned:
singlevalue = value
elif value is not _unassigned and value != singlevalue:
return False
if forwardcheck and singlevalue is not _unassigned:
for variable in variables:
if variable not in assignments:
domain = domains[variable]
if singlevalue not in domain:
return False
for value in domain[:]:
if value != singlevalue:
domain.hideValue(value)
return True
class MaxSumConstraint(Constraint):
def __init__(self, maxsum, multipliers=None):
self._maxsum = maxsum
self._multipliers = multipliers
def preProcess(self, variables, domains, constraints, vconstraints):
Constraint.preProcess(self, variables, domains,
constraints, vconstraints)
multipliers = self._multipliers
maxsum = self._maxsum
if multipliers:
for variable, multiplier in zip(variables, multipliers):
domain = domains[variable]
for value in domain[:]:
if value * multiplier > maxsum:
domain.remove(value)
else:
for variable in variables:
domain = domains[variable]
for value in domain[:]:
if value > maxsum:
domain.remove(value)
def __call__(self, variables, domains, assignments, forwardcheck=False):
multipliers = self._multipliers
maxsum = self._maxsum
sum = 0
if multipliers:
for variable, multiplier in zip(variables, multipliers):
if variable in assignments:
sum += assignments[variable] * multiplier
if type(sum) is float:
sum = round(sum, 10)
if sum > maxsum:
return False
if forwardcheck:
for variable, multiplier in zip(variables, multipliers):
if variable not in assignments:
domain = domains[variable]
for value in domain[:]:
if sum + value * multiplier > maxsum:
domain.hideValue(value)
if not domain:
return False
else:
for variable in variables:
if variable in assignments:
sum += assignments[variable]
if type(sum) is float:
sum = round(sum, 10)
if sum > maxsum:
return False
if forwardcheck:
for variable in variables:
if variable not in assignments:
domain = domains[variable]
for value in domain[:]:
if sum + value > maxsum:
domain.hideValue(value)
if not domain:
return False
return True
class ExactSumConstraint(Constraint):
def __init__(self, exactsum, multipliers=None):
self._exactsum = exactsum
self._multipliers = multipliers
def preProcess(self, variables, domains, constraints, vconstraints):
Constraint.preProcess(self, variables, domains,
constraints, vconstraints)
multipliers = self._multipliers
exactsum = self._exactsum
if multipliers:
for variable, multiplier in zip(variables, multipliers):
domain = domains[variable]
for value in domain[:]:
if value * multiplier > exactsum:
domain.remove(value)
else:
for variable in variables:
domain = domains[variable]
for value in domain[:]:
if value > exactsum:
domain.remove(value)
def __call__(self, variables, domains, assignments, forwardcheck=False):
multipliers = self._multipliers
exactsum = self._exactsum
sum = 0
missing = False
if multipliers:
for variable, multiplier in zip(variables, multipliers):
if variable in assignments:
sum += assignments[variable] * multiplier
else:
missing = True
if type(sum) is float:
sum = round(sum, 10)
if sum > exactsum:
return False
if forwardcheck and missing:
for variable, multiplier in zip(variables, multipliers):
if variable not in assignments:
domain = domains[variable]
for value in domain[:]:
if sum + value * multiplier > exactsum:
domain.hideValue(value)
if not domain:
return False
else:
for variable in variables:
if variable in assignments:
sum += assignments[variable]
else:
missing = True
if type(sum) is float:
sum = round(sum, 10)
if sum > exactsum:
return False
if forwardcheck and missing:
for variable in variables:
if variable not in assignments:
domain = domains[variable]
for value in domain[:]:
if sum + value > exactsum:
domain.hideValue(value)
if not domain:
return False
if missing:
return sum <= exactsum
else:
return sum == exactsum
class MinSumConstraint(Constraint):
def __init__(self, minsum, multipliers=None):
self._minsum = minsum
self._multipliers = multipliers
def __call__(self, variables, domains, assignments, forwardcheck=False):
for variable in variables:
if variable not in assignments:
return True
else:
multipliers = self._multipliers
minsum = self._minsum
sum = 0
if multipliers:
for variable, multiplier in zip(variables, multipliers):
sum += assignments[variable] * multiplier
else:
for variable in variables:
sum += assignments[variable]
if type(sum) is float:
sum = round(sum, 10)
return sum >= minsum
class InSetConstraint(Constraint):
def __init__(self, set):
self._set = set
def __call__(self, variables, domains, assignments, forwardcheck=False):
# preProcess() will remove it.
raise RuntimeError, "Can't happen"
def preProcess(self, variables, domains, constraints, vconstraints):
set = self._set
for variable in variables:
domain = domains[variable]
for value in domain[:]:
if value not in set:
domain.remove(value)
vconstraints[variable].remove((self, variables))
constraints.remove((self, variables))
class NotInSetConstraint(Constraint):
def __init__(self, set):
self._set = set
def __call__(self, variables, domains, assignments, forwardcheck=False):
# preProcess() will remove it.
raise RuntimeError, "Can't happen"
def preProcess(self, variables, domains, constraints, vconstraints):
set = self._set
for variable in variables:
domain = domains[variable]
for value in domain[:]:
if value in set:
domain.remove(value)
vconstraints[variable].remove((self, variables))
constraints.remove((self, variables))
class SomeInSetConstraint(Constraint):
def __init__(self, set, n=1, exact=False):
self._set = set
self._n = n
self._exact = exact
def __call__(self, variables, domains, assignments, forwardcheck=False):
set = self._set
missing = 0
found = 0
for variable in variables:
if variable in assignments:
found += assignments[variable] in set
else:
missing += 1
if missing:
if self._exact:
if not (found <= self._n <= missing + found):
return False
else:
if self._n > missing + found:
return False
if forwardcheck and self._n - found == missing:
# All unassigned variables must be assigned to
# values in the set.
for variable in variables:
if variable not in assignments:
domain = domains[variable]
for value in domain[:]:
if value not in set:
domain.hideValue(value)
if not domain:
return False
else:
if self._exact:
if found != self._n:
return False
else:
if found < self._n:
return False
return True
class SomeNotInSetConstraint(Constraint):
def __init__(self, set, n=1, exact=False):
self._set = set
self._n = n
self._exact = exact
def __call__(self, variables, domains, assignments, forwardcheck=False):
set = self._set
missing = 0
found = 0
for variable in variables:
if variable in assignments:
found += assignments[variable] not in set
else:
missing += 1
if missing:
if self._exact:
if not (found <= self._n <= missing + found):
return False
else:
if self._n > missing + found:
return False
if forwardcheck and self._n - found == missing:
# All unassigned variables must be assigned to
# values not in the set.
for variable in variables:
if variable not in assignments:
domain = domains[variable]
for value in domain[:]:
if value in set:
domain.hideValue(value)
if not domain:
return False
else:
if self._exact:
if found != self._n:
return False
else:
if found < self._n:
return False
return True
def winning_die(enemy_die):
if sorted(enemy_die) == range(1, len(enemy_die) + 1):
return []
problem = Problem()
ElementCount = len(enemy_die)
median = sorted(enemy_die)[ElementCount / 2]
problem.addVariables(range(0, ElementCount / 3),
range(1, median + 1))
problem.addVariables(range(ElementCount / 3, ElementCount * 2 / 3),
range(max(enemy_die) + 1, median - 1, -1))
problem.addVariables(range(ElementCount * 2 / 3, ElementCount),
range(max(enemy_die) + 1, 0, -1))
problem.addConstraint(ExactSumConstraint(sum(enemy_die)),
range(len(enemy_die)))
from itertools import product
def func(*args):
if sum([1 if i[0] > i[1] else -1 if i[0] < i[1] else 0
for i in product(args, enemy_die)]) > 0:
return True
return False
problem.addConstraint(func, range(len(enemy_die)))
solution = problem.getSolution()
if solution:
return sorted(solution.values())
else:
return []
if __name__ == '__main__':
# These are only used for self-checking and not necessary for auto-testing
def check_solution(func, enemy):
player = func(enemy)
total = 0
for p in player:
for e in enemy:
if p > e:
total += 1
elif p < e:
total -= 1
return total > 0
assert check_solution(winning_die, [3, 3, 3, 3, 6, 6]), "Threes and Sixes"
assert check_solution(winning_die, [4, 4, 4, 4, 4, 4]), "All Fours"
assert check_solution(winning_die, [1, 1, 1, 4]), "Unities and Four"
assert winning_die([1, 2, 3, 4, 5, 6]) == [], "All in row -- No die"