Cool puzzle, finally pass all the tests with BFS.
I used A* which is a generalised Dijkstra. No problem, even in a slow language like Python.
BFS is sufficient to pass all tests.Basically, here's what I did:Look for closest '?' and proceed in that manner.If 'C' is found try to go to 'C' (in case there's no path, go to the '?')Once you've reached 'C' use BFS to reach 'T' fastest
I did this and did not pass all the tests because I did not always reveal the shortest path before I reached the control room (i.e. there were still question marks). Yet when I submitted I still got 100%. Lucky me.
Maybe I passed all tests because my order of directions