Timeline for Why is 'Manhattan distance' a better heuristic for 15 puzzle than 'number of tiles misplaced'?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 18, 2017 at 21:51 | comment | added | Mo Azim | Thanks for the warm welcome. You are right. Rather than the algorithm's implementation, I was hoping to draw parallels with BFS in the way the search tree expands. If you can re-word it better in an answer, I will happily change it. | |
| Oct 17, 2017 at 8:08 | comment | added | David Richerby | I'm not sure it's really helpful to think of A* as being based on BFS. In one sense, it's true that BFS, DFS, UCS and A* are "the same" algorithm, except that BFS uses a queue to store the unexplored nodes, DFS uses a stack, UCS uses a priority queue based on cost and A* uses a priority queue based on cost plus heuristic. But the choice of data structure is more than just an implementation detail and they all behave rather differently in many situations. | |
| Oct 17, 2017 at 8:04 | history | edited | David Richerby | CC BY-SA 3.0 |
Formatting
|
| Oct 16, 2017 at 22:38 | review | Late answers | |||
| Oct 17, 2017 at 8:08 | |||||
| Oct 16, 2017 at 22:22 | review | First posts | |||
| Oct 17, 2017 at 0:17 | |||||
| Oct 16, 2017 at 22:18 | history | answered | Mo Azim | CC BY-SA 3.0 |