Timeline for Pathfinding results in false path costs that are too high
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 30, 2013 at 18:12 | vote | accept | user2144536 | ||
| Jun 30, 2013 at 18:12 | comment | added | user2144536 | Thanks! I just added a check to see if curVal is less than the value being checked and it works! | |
| Jun 27, 2013 at 23:15 | comment | added | Adam | If you want to do a depth first search you need to use iterative deepening to get the shortest path. en.wikipedia.org/wiki/IDA%2A | |
| Jun 27, 2013 at 19:52 | comment | added | zacharmarz | Yes. That's Dijkstra :) | |
| Jun 27, 2013 at 19:45 | comment | added | UnderscoreZero | Another thing you can do is upon entering a tile that has been visited previously, check if the number on that tile is lower than your current move distance, you can throw out the current move as there is already a shorter path to the node. | |
| Jun 27, 2013 at 18:53 | history | answered | zacharmarz | CC BY-SA 3.0 |