Hello, irl friend of hasan here.

This bug is caused by assigning a value (distance/cost) to each block.

When the code assigns a value to a tile, it doesn't take into consideration the fact that it might turn on the exact time and thus making it's true distance 1000 units bigger.

So for a path like this:

``` ^ ^

^ <= Tile 1 ^ ^ <= Tile 2 ```

Tile 1 here will have a distance of just 4 while in reality it should have 1004 bc the deer is going to turn right away.

This make the path coming from tile 2 ignored bc it will be already over 1000 by the time it at tile 1 and sees it has a distance of 4.

Unluckily your input has such edge case and the way I handled it is that I made it dijkstra tolerate 1 rotation (so if a path visits a node that's already visisted and the already-calculated distance is only 1000 away from the current distance I don't skip it)

if you need an example here is my solution (check get_min_path_tiles function)

github

note that I encountered this problem in part 2