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?)


4816 too high
4266 too high
