-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathhacken.py
281 lines (268 loc) · 6.73 KB
/
hacken.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
import sys
class Graph:
def __init__(self):
self.V = {}
self.E = {}
def addVertex(self, label):
self.V[str(label)] = {}
def addEdge(self, label, v1, v2):
v = [v1,v2]
#v.sort()
v = [str(n) for n in v]
self.E[label] = (v[0], v[1])
self.V[v[0]][label] = v[1]
self.V[v[1]][label] = v[0]
class Hackenbush:
def __init__(self):
self.Field = Graph()
self.Field.addVertex('0')
self.blues = 0
self.reds = 0
self.nodes = 0
self.verbose = True
self.debug = False
def toggleVerbose(self, set=None):
if set == None:
self.verbose = not self.verbose
elif set == True or set == False:
self.verbose = set
def toggleDebug(self, set=None):
if set == None:
self.debug = not self.debug
elif set == True or set == False:
self.debug = set
def printVerbose(self, long, short):
if self.verbose:
print long
elif short != None:
print short
def printDebug(self, *items):
out = [str(item) for item in items]
out = "".join(out)
if self.debug:
print out
def allEdges(self):
edges = [e for e in self.Field.E]
edges.sort()
return edges
def allNodes(self):
nodes = [v for v in self.Field.V]
nodes.sort()
return nodes
def lastBlue(self):
return "b" + str(self.blues)
def lastRed(self):
return "r" + str(self.reds)
def lastNode(self):
return self.nodes
def addNode(self):
self.nodes = self.nodes + 1
self.Field.addVertex(self.nodes)
def addBlue(self, v1=0, v2=0):
self.blues = self.blues + 1
index = self.lastBlue()
self.Field.addEdge(index, str(v1), str(v2))
def addRed(self, v1=0, v2=0):
self.reds = self.reds + 1
index = self.lastRed()
self.Field.addEdge(index, str(v1), str(v2))
def removeEdge(self, edge):
for v in self.Field.V:
if edge in self.Field.V[v]:
self.Field.V[v].pop(edge)
self.Field.E.pop(edge)
def removeVertex(self, v):
connections = self.Field.V.pop(v)
#print connections
# Remove all edges connected to vertex
for edge in connections:
self.removeEdge(edge)
# Find and remove all edges going to vertex (one-way)
delete = set()
for node in self.Field.V:
edges = dict(self.Field.V[node])
for edge in edges:
if v in self.Field.V[node][edge]:
self.Field.V[node].pop(edge)
self.printDebug("Connections: ", self.Field.V)
def displayFromVertex(self, vertex):
seen = set()
seenE = set()
last = ["0"]
sys.stdout.write("|\n|")
def recurse(next, level=0):
seen.add(next)
#print next + ":"+ str(self.Field.V[next])
edges = self.Field.V[next]
labels = [label for label in edges]
labels.sort()
#print labels
for label in labels:
v = edges[label]
if v not in seen or label not in seenE and not (int(v) == 0 and level > 0):
seen.add(v)
seenE.add(label)
if next != last[0]:
print
sys.stdout.write("|")
sys.stdout.write(" " * level)
if level == 0:
sys.stdout.write("____" + label + "____(" + v + ")")
else:
sys.stdout.write("\___" + label + "____(" + v + ")")
else:
sys.stdout.write("____" + label + "____(" + v + ")")
last[0] = v
recurse(v, level+1)
recurse(vertex)
print
sys.stdout.write("|\n|")
notseenE = set(self.Field.E).difference(seenE)
for e in notseenE:
self.removeEdge(e)
print
self.printDebug("Nodes: ", self.Field.V)
self.printDebug("Edges: ", self.Field.E)
self.printDebug()
def display(self):
print
self.displayFromVertex('0')
print
#print self.Field.E
#print self.Field.V
def setup(self):
self.printVerbose("Setup the playing field.", "Setup.")
entry = None
while entry != "f":
self.display()
print "Nodes: " + str(self.allNodes())
print
self.printVerbose("Add (n)ode or (b)lue edge or (r)ed edge? Or (s)how the playing field, (d)elete an edge or node, or (f)inish.", "(n)ode (b)lue (r)ed (s)how (d)elete (f)inish")
entry = raw_input()
if entry == 'n':
self.addNode()
self.printDebug(self.Field.V)
elif entry == 'b' or entry == 'r':
v1 = None
v2 = None
while v1 == None:
self.printVerbose("1st node to connect to:", "1st node:")
print self.allNodes()
v1 = raw_input()
if v1 not in self.allNodes():
v1 = None
while v2 == None:
self.printVerbose("2nd node to connect to:", "2nd node:")
print self.allNodes()
v2 = raw_input()
if v2 not in self.allNodes():
v2 = None
if entry == 'b':
self.addBlue(v1, v2)
else:
self.addRed(v1, v2)
print
#self.display()
elif entry == 's':
self.display()
elif entry == 'd':
select = None
while select == None:
self.printVerbose("Delete an (e)dge or (n)ode?", "(e)dge (n)ode")
select = raw_input()
if select == 'n':
v = None
while v == None:
print "Select a node."
print self.allNodes()
v = raw_input()
if v not in self.Field.V:
v = None
self.removeVertex(v)
elif select == 'e':
e = None
while e == None:
print "Select an edge."
print self.allEdges()
e = raw_input()
if e not in self.Field.E:
e = None
self.removeEdge(e)
else:
select = None
elif entry != 'f':
entry = None
def play(self, first='blue'):
self.printVerbose("Play Hackenbush.", "Play.")
if self.allEdges() == []:
print "Nothing in play."
return
last = None
player = first
playerMoves = [v for v in self.allEdges() if v[0] == player[0]]
self.display()
while playerMoves != []:
next = " "
while next not in playerMoves:
self.printVerbose(player[0].upper() + player[1:] + "'s turn", None)
self.printVerbose("Remove which edge?", "Remove:")
print playerMoves
next = raw_input()
if next == 's':
self.display()
next = " "
self.removeEdge(next)
last = next
if player == 'blue':
player = 'red'
else:
player = 'blue'
self.display()
playerMoves = [v for v in self.allEdges() if v[0] == player[0]]
print
if last[0] == 'b':
print "Blue wins!"
else:
print "Red wins!"
def main():
test = Hackenbush()
player = 'blue'
if '-game1' in sys.argv:
test.addNode()
test.addBlue(0,1)
test.addNode()
test.addRed(1,2)
test.addNode()
test.addRed(2,3)
test.addNode()
test.addBlue(2,4)
test.addNode()
test.addRed(0, 5)
test.addNode()
test.addBlue(5,6)
test.addRed(0,2)
elif '-game2' in sys.argv:
test.addNode()
test.addRed(0,1)
test.addNode()
test.addRed(1,1)
test.addRed(1,2)
test.addBlue(1,2)
test.addBlue(2,0)
elif '-game3' in sys.argv:
test.addNode()
test.addNode()
test.addBlue(0,2)
test.addRed(2,1)
else:
test.setup()
if '-r' in sys.argv:
player = 'red'
if '-nv' in sys.argv:
test.toggleVerbose(False)
if '-d' in sys.argv:
test.toggleDebug(True)
if '-s' in sys.argv:
test.setup()
test.play(player)
main()