Anonymous user
Talk:A* search algorithm: Difference between revisions
m
→moving into a barrier position: added comment about A* evaluating every possible move (path).
m (→moving into a barrier position: added another question.) |
m (→moving into a barrier position: added comment about A* evaluating every possible move (path).) |
||
Line 14:
:: So if a "move into" a barrier is never shown (because there is always a lower cost solution), why have a cost (for moving into a barrier) at all? -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 18:48, 29 January 2017 (UTC)
:: Also (above), you mentioned that: ''A* doesn't evaluate every possible move''. <br><br>However, in the Wikipedia article (link), it states: <br><br>''A* is an informed search algorithm, or a best-first search, meaning that <u>it solves problems by searching among all possible paths to the solution (goal)</u> for the one that incurs the smallest cost (least distance travelled'' (sic), ''shortest time, etc.), and among these paths it first considers the ones that appear to lead most quickly to the solution.'' ... (underscoring and italics added by me). -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 18:59, 29 January 2017 (UTC)
== grid orientation ==
| |||