12 lines
298 B
Plaintext
12 lines
298 B
Plaintext
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?)
|
|
|