2024(6): troubleshooting be whut

This commit is contained in:
2024-12-27 12:29:24 +01:00
parent efe6e5a0c3
commit e28df05c1e
2 changed files with 14 additions and 8 deletions

View File

@ -19,13 +19,14 @@ position; see Pigeonhole principle).
if __name__ == "__main__":
m = Map()
#m.load_map("testinput")
m.load_map("input")
m.load_map("testinput")
#m.load_map("input")
# Prepare forked map for speed
forked_map = m.copy()
#forked_map = Map()
#forked_map = m.copy()
forked_map = Map()
#forked_map.load_map("input")
forked_map.load_map("testinput")
begin_pos = m.pos
begin_direction = m.direction
@ -42,11 +43,14 @@ if __name__ == "__main__":
#forked_map = Map()
#forked_map.load_map("input")
#forked_map.map = m.map.copy()
print(f"Forking map, setting obstacle at {m.next_pos()}, resetting current {m.pos} to {m.map[m.pos]}")
forked_map.show()
forked_map.map[m.next_pos()] = Map.Tiles.OBSTACLE.value
forked_map.map[m.pos] = m.map[m.pos]
forked_map.pos = begin_pos
forked_map.direction = begin_direction
forked_map.trace = [begin_pos]
forked_map.show()
print(f"Forking at {forked_map.next_pos()}... ", end="")
try:
while forked_map.step():
@ -57,8 +61,8 @@ if __name__ == "__main__":
else:
print("no loop.")
i += 1
if i > 100:
break
#if i > 100:
# break
#m.show()
#print(len(m.trace), m.trace)
#print(len(set(m.trace)))