I have the same thing but for test ‘1’… It’s more likely that there’s some edge case in our code that our solution doesn’t handle, rather than a bug in the puzzle - but there’s no way to know what that edge case is…
I also had a problem with Validator 1.
It checks if you consider that you can’t reach a spot if number of moves is greater or equal to distance from the starting point of an orc to that spot.
For below input, your solution should answer with “IMPOSSIBLE”:
eulerscheZahl really helped me and gave me a clue to “look backwards for some routes”
You should keep in mind that you should always visit closes indexes in the beginning, in my case the order of indexes were mixed in linkedList so I was visiting not the closest index.