advent-of-code/2019/18/notes

15 lines
327 B
Plaintext
Raw Permalink Normal View History

2019-12-18 16:32:23 +01:00
priority:
(closest) actually dead end with keys -> (closest) key for reachable door
alphabetical as tiebreaker
for scan: set of visited positions
tasks:
//scan entire map -> create dependencies (Map<Key, Set<Key>>)
dead end detection -> also done?
//implement pathfinding (maybe dijkstra-like?)
2019-12-18 21:03:14 +01:00
4816 too high
4266 too high