Timeline for Is there a known most efficient version of A* search algorithm?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 14, 2012 at 19:41 | vote | accept | Dollarslice | ||
| Jan 1, 2012 at 23:02 | history | edited | David Gouveia | CC BY-SA 3.0 |
deleted 12 characters in body
|
| Jan 1, 2012 at 23:01 | comment | added | Jonathan Dickinson | +1 for 'close enough'. People get too paranoid about getting the absolute perfect path. In fact, using a less-than-perfect path makes AI (especially) unpredictable. OT: You have been posting some really awesome answers! Keep it up! | |
| Jan 1, 2012 at 22:28 | history | edited | David Gouveia | CC BY-SA 3.0 |
added 5 characters in body
|
| Jan 1, 2012 at 22:23 | comment | added | David Gouveia | Went ahead and added a bit more information now since I recall a few of these optimizations from the books. | |
| Jan 1, 2012 at 22:19 | history | edited | David Gouveia | CC BY-SA 3.0 |
added 1633 characters in body
|
| Jan 1, 2012 at 22:12 | comment | added | Kylotan | +1 for the comment on specific scenarios. Different branching factors, memory allocation costs, heuristic qualities, and other factors will all affect how well it runs. | |
| Jan 1, 2012 at 21:53 | history | answered | David Gouveia | CC BY-SA 3.0 |