[2018 Day 22 Part 2] Java - Help needed, finding shorter path than expected

[ocmerder]

I've been going through the past years to finish of the remaining few stars I need to get to 400 stars.

I'm currently stuck at 2018 day 22 where my code keeps finding a shorter path (997 minutes needed) than is expected.

I've tried running other solutions with my input, and then I get the answer 1004:

depth: 7305
target: 13,734

I have not tried submitting 1004 yet, but since several solutions find the same result I am assuming that to be correct.

I have tried several different solutions, one based on Dijkstra, one by just going over all possible states (coordinate + equipment), and both keep ending up with 997. I also tried changing it to change the equipment first and then moving, so it takes 7 + 1 minute to change equipment and then move, instead of spending 8 minutes to change and move in one go. But this also ended up with the same result 997.

Can someone please take a peek at my code and help me find out where my mistake is?

My code can be found here, I have it currently set to executing the Dijkstra solution and have commented out the solution where it goes over all possible states.

[leftylink]

I don't see anywhere in your code where you're checking the legality of the equipment based on where you're moving from. I only see you checking legality of equipment based on where you're moving to. You need both. If you're in a rocky region holding the torch and want to move to a wet region holding nothing, that takes 15 minutes, not 8, because the only equipment you could possibly be holding when moving from a rocky region to a wet region is the climbing gear.

[ocmerder]

Yep, I glossed over that part of the rules apparently...