Talk:A* search algorithm: Difference between revisions
Content added Content deleted
(→Path cost ambiguity: new section) |
|||
| Line 52: | Line 52: | ||
== Extra credit == |
== Extra credit == |
||
While it is perfectly possible to solve an 8-puzzle with A*, and it is commonly used/taught, the fact that it is completely impractical for a 15-puzzle gives me serious doubts. Perhaps something more like the javascript demo, showing nodes actually examined would be better. |
While it is perfectly possible to solve an 8-puzzle with A*, and it is commonly used/taught, the fact that it is completely impractical for a 15-puzzle gives me serious doubts. Perhaps something more like the javascript demo, showing nodes actually examined would be better. |
||
== Path cost ambiguity == |
|||
After implementing this task and comparing my result to other results, I have noticed that some implementations give a path cost of 12 (which would suggest moving into the start square) while other implementations give a path cost of 11 (which would suggest not moving into that start square). |
|||
This seems like a minor issue, but we should probably think a little about what we want here. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 16:06, 17 January 2022 (UTC) |
|||