forked from frootbirb/districter_iterative
-
Notifications
You must be signed in to change notification settings - Fork 0
/
logic_iterative.py
183 lines (148 loc) · 6.7 KB
/
logic_iterative.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
from shutil import get_terminal_size as term_size
from itertools import chain
from typing import Callable, Iterable
from data_structs import State, Unit, Group
# --- Solver -----------------------------------------------------------------------------------------------------------
def sorter(state: State, group: Group, unit: Unit) -> tuple:
return (
# Prioritize unplaced units
unit in state.unplacedUnits,
# Prioritize shorter distance
-group.distanceSum.get(unit, float("inf")),
# Prioritize units that bring this group as close as possible to the average
-abs(state.avgGroupMetric - unit.metric - group.metric),
)
def getPlaceableUnitsFor(state: State, group: Group) -> Iterable[Unit]:
if group.empty:
return state.unplacedUnits
elif unplacedAdjacent := group.adj & state.unplacedUnits:
return unplacedAdjacent
else:
return chain(
(unit for unit in group.adj if state.getGroupFor(unit).canLose(unit)),
(unit for unit in state.unplacedUnits if all(u not in unit.distances for u in group.units)),
)
def getNext(state: State) -> Iterable[tuple[Unit | None, Group]]:
for group in sorted(
state.groups,
key=lambda group: (
# Prioritize groups that have at least one adjacent empty unit, are empty, or have no adjacent units at all
-(state.hasAnyUnplacedAdjacent(group) or group.empty or not group.adj),
group.metric,
),
):
for unit in sorted(
getPlaceableUnitsFor(state, group), key=lambda unit: sorter(state, group, unit), reverse=True
):
yield unit, group
return None, state.groups[0]
def doStep(
state: State, previousMoves: list[tuple[Unit, int, int]], doPrint: bool = False
) -> tuple[State, None, None, None] | tuple[State, Unit, int, int]:
for unit, group in getNext(state):
if not unit:
break
elif (unit, (prevPlacement := state.placements[unit]), group.index) in previousMoves:
break
if doPrint:
if prevPlacement == 0:
print(f"{group.index}: Adding {unit}")
else:
print(f"{group.index}: Stealing {unit} from {prevPlacement}")
state.addToGroup(unit, group)
if doPrint:
print(Log.getPlacementStr(state))
# If half the units are placed, we can start checking for enclosures
if len(state.unplacedUnits) * 2 < len(state.placements):
for disconnectedCount in state.generateDisconnectedGroups(group):
if doPrint:
unplacedCount = len(disconnectedCount)
longEnough = term_size().columns > unplacedCount * 4 + 12
print(f"{group.index}: enclosed {disconnectedCount if longEnough else f'{unplacedCount} units'}")
for unplaced in disconnectedCount:
state.addToGroup(unplaced, group)
if doPrint:
Log.state(state)
return state, unit, group.index, prevPlacement
return state, None, None, None
def solve(
numGroup: int,
metricID: str | int = 0,
scale: str | int = 0,
callback: Callable[[str, int], None] | None = None,
doPrint: bool = False,
) -> State:
# Start the solver!
state: State = State(numGroup=numGroup, metricID=metricID, scale=scale, callback=callback)
previousMoves: list[tuple[Unit, int, int]] = []
while state.unplacedUnits or any(group.metric < state.avgGroupMetric - state.deviation for group in state.groups):
state, unit, placement, prevPlacement = doStep(state, previousMoves, doPrint)
if not unit or not placement or prevPlacement == None:
break
previousMoves.append((unit, placement, prevPlacement))
if len(previousMoves) > 5:
previousMoves.pop(0)
return state
# --- Printing methods -------------------------------------------------------------------------------------------------
class Log:
@staticmethod
def percent(state: State, val: float) -> str:
return f"{100 * val / state.sumUnitMetrics:.2f}%"
@staticmethod
def numWithPercent(state: State, val: float) -> str:
return f"{val:,.2f} ({Log.percent(state, val)})"
@staticmethod
def joinedUnits(units: Iterable[Unit]) -> str:
return "|".join(sorted(unit.code for unit in units))
@staticmethod
def getStatStr(state: State) -> str:
return (
f"--------------- + {'Complete' if state.unplacedUnits else 'Failure'} + ---------------\n"
f"Created {len(state.groups)} groups of {state.scale} with criteria {state.metricID}\n"
+ (
f"Final spread: "
f"{Log.numWithPercent(state, (largest := max(state.groups).metric) - (smallest := min(state.groups).metric))}, "
f"from {Log.numWithPercent(state, smallest)} to {Log.numWithPercent(state, largest)}\n"
if len(state.groups) > 1
else ""
)
+ f"Acceptable sizes: {Log.numWithPercent(state, state.avgGroupMetric - state.deviation)} "
f"to {Log.numWithPercent(state, state.avgGroupMetric + state.deviation)}"
)
@staticmethod
def getPlacementStr(state: State) -> str:
results = []
for group in sorted(state.groups, reverse=True):
results.append(
(
f"Group {group.index}",
Log.percent(state, group.metric),
Log.joinedUnits(group.units),
f"{(count := len(group.units))} units ({100 * (count / len(state.placements)):.2f}% of total)",
)
)
if (count := len(state.unplacedUnits)) > 0:
results.append(
(
"Unplaced",
Log.percent(state, sum(unit.metric for unit in state.unplacedUnits)),
Log.joinedUnits(state.unplacedUnits),
f"{count} units ({100 * (count / len(state.placements)):.2f}% of total)",
)
)
length = len(max(results, key=lambda item: len(item[0]))[0])
max_unit_space = term_size().columns - (length + 12)
return "\n".join(
f" {name:{str(length)}} ({pct:6}): {units if len(units) < max_unit_space else summary}"
for (name, pct, units, summary) in results
)
@staticmethod
def state(state: State):
print(Log.getStatStr(state))
print(Log.getPlacementStr(state))
print()
if __name__ == "__main__":
state = solve(5, "Area (mi2)", scale=0)
Log.state(state)
for g in state.groups:
print(Log.joinedUnits(getPlaceableUnitsFor(state, g)))