Timeline for C++ A Star Algorithm [path takes wrong route] using <deque> & unique_ptr
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 20, 2016 at 9:47 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| May 20, 2016 at 15:48 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jan 21, 2016 at 18:31 | comment | added | amitp |
@RNewell122 normally in A* the accumulated cost “g” does not look at the heuristic at all; only the “f” includes the heuristic. I have some A* code here that may be a useful reference. (My cost_so_far is your accumulated cost; my priority is your f value)
|
|
| Jan 21, 2016 at 18:08 | comment | added | RNewell122 | @amitp ahh found out it actually doesn't take into account the shorter costs, it just uses the heuristic. | |
| Jan 21, 2016 at 17:56 | comment | added | RNewell122 | @amitp i think that would be the admissibility, it begins to overestimate the cost towards the end ? | |
| Jan 18, 2016 at 13:57 | answer | added | RNewell122 | timeline score: 1 | |
| Jan 12, 2016 at 20:05 | history | tweeted | twitter.com/StackGameDev/status/687002524465917953 | ||
| Jan 12, 2016 at 18:56 | comment | added | amitp |
I agree with @KevinvanderVelden — verify the costs of the path either by stepping through with a debugger or printing them out at the end. Where do you actually check mIsWoods, mIsWater? (Also, astar_checklists seems like it'll make your A* slower than something like Dijkstra's Algorithm, but that's a separate issue)
|
|
| Jan 12, 2016 at 13:45 | history | edited | Vaillancourt♦ | CC BY-SA 3.0 |
Formatted the post, and the tags
|
| Jan 12, 2016 at 11:26 | comment | added | Elva | Aah, did you verify (by stepping through it) that the costs are actually being accumulated? | |
| Jan 12, 2016 at 11:14 | comment | added | RNewell122 | The red path accumulated cost should = 11, and the green path should = 10, because it adds the cost of water nodes and wood nodes, water being 3 and wood being 2. | |
| Jan 12, 2016 at 9:19 | comment | added | Elva | Why is the red path invalid? It's the same length as the green path. | |
| Jan 12, 2016 at 9:07 | review | First posts | |||
| Jan 12, 2016 at 13:45 | |||||
| Jan 12, 2016 at 9:04 | history | asked | RNewell122 | CC BY-SA 3.0 |