• Create Account

### #ActualAshaman73

Posted 27 September 2012 - 02:28 AM

You can split node "D" into "D from A", "D from B" and "D from C", because those seem to actually be different states. Then Dijkstra will work again.

Was my first thought too, but then you need to split E and after that, the following nodes ...
This is the killer argument:

In other words, any weight along the path doesn't just depend on where you were previously, but where you were before that too. It can even extend farther back several levels like going uphill 3 times in a row is a real doozy and you must pay an extra penalty for that too.

### #1Ashaman73

Posted 27 September 2012 - 02:27 AM

In other words, any weight along the path doesn't just depend on where you were previously, but where you were before that too. It can even extend farther back several levels like going uphill 3 times in a row is a real doozy and you must pay an extra penalty for that too.

PARTNERS