Anonymous user
Talk:A* search algorithm: Difference between revisions
no edit summary
No edit summary |
No edit summary |
||
Line 9:
How would one show a path that ''moves into'' a barrier? -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 16:42, 29 January 2017 (UTC)
:While A* does not evaluate every possible move, it does internally check the cost of moving into a barrier square. For this reason, the cost of moving into a barrier square is required. However, there is always a lower cost alternative while still moving in the correct general direction (according to the heuristic), it should never actually be part of the maze solution.
:As you pointed out, the method for showing a path that moves into a barrier is left undefined. However, it should not be part of the a* solution so any method would be fine.--[[User:TimSC|TimSC]] ([[User talk:TimSC|talk]]) 16:58, 29 January 2017 (UTC)
| |||