Talk:A* search algorithm: Difference between revisions
no edit summary
No edit summary |
No edit summary |
||
Line 31:
==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?--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 10:33, 30 January 2017 (UTC)
</br>▼
==Related Tasks==
How is this algorithm related to solving a Hidato Puzzle? or the others for that matter. Does anyone intend to produce a solution using this algorithm?--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 10:33, 30 January 2017 (UTC)
| |||