Talk:A* search algorithm: Difference between revisions
Content added Content deleted
(added a "break" line.) |
No edit summary |
||
Line 28: | Line 28: | ||
For me, it doesn't make me no never-mind no-how, but it took a wee bit of fixin' for my |
For me, it doesn't make me no never-mind no-how, but it took a wee bit of fixin' for my |
||
<br>programming example (not yet posted) to match the existing displayed grids. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 16:42, 29 January 2017 (UTC) |
<br>programming example (not yet posted) to match the existing displayed grids. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 16:42, 29 January 2017 (UTC) |
||
==A more interesting example== |
|||
<br> |
|||
A barrier is created by setting a square's value effectively to infinity. How this is achieved by the algorithm should be implementation dependant. Some languages support the concept intrinsically, certainly 100 should not be a magic number. Would it not be more interesting if the squares had values other than 1 or infinity. Say randomly assigned? |
|||
</br> |