Dijkstra's Algorithm Exercise: Find the Solution!

[evinda]

Hi! (Smile)

Could you give me a difficult exercise that is related to the Dijkstra's algorithm? (Blush)

 

[I like Serena]

Hi! (Smile)

Could you give me a difficult exercise that is related to the Dijkstra's algorithm? (Blush)

Hey! (Blush)

Grandpa starts at the right top and wants to reach his parking spot on the left top.

Each step costs 1 point.
Eating candy restores 3 points.
Running into a monster costs 5 points.
Moving through the spot with the coffin takes 2 points.
And if grandpa tries to move through the spot with the jelly, it takes him 10 points to get through the sticky goo.

How should we apply an algorithm to find the least costly route? (Wondering)

 

[shamieh]

Hey! (Blush)
Grandpa starts at the right top and wants to reach his parking spot on the left top.

Each step costs 1 point.
Eating candy restores 3 points.
Running into a monster costs 5 points.
Moving through the spot with the coffin takes 2 points.
And if grandpa tries to move through the spot with the jelly, it takes him 10 points to get through the sticky goo.

How should we apply an algorithm to find the least costly route? (Wondering)

Does it cost points to visit a spot you'e previously visited. So if you go from $a$ to $b$ to $c$ that would be $-3$ but if you went back to $b$ from $c$ would that cost another point? ($-4$) or no?

 

[I like Serena]

Does it cost points to visit a spot you'e previously visited. So if you go from $a$ to $b$ to $c$ that would be $-3$ but if you went back to $b$ from $c$ would that cost another point? ($-4$) or no?

Riding from $a$ to $b$ to $c$ would be $-2$, since it's 2 steps.
Riding back from $c$ to $b$ will tire grandpa more, so it will indeed cost another point ($-3$). (Mmm)