Timeline for 8puzzle solver using A*
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 10, 2016 at 14:29 | history | bounty awarded | CommunityBot | ||
| Nov 8, 2016 at 15:25 | history | edited | Emily L. | CC BY-SA 3.0 |
Adding A* explanation
|
| Nov 8, 2016 at 15:15 | history | edited | Emily L. | CC BY-SA 3.0 |
Adding A* explanation
|
| Nov 6, 2016 at 20:09 | comment | added | Emily L. | @jmstfv by moves taken to reach that particular position it is meant the depth of the search tree at the current node. Look at how you calculate the moves variable, it is the current amount of dequeued nodes this far. And there is your problem. | |
| Nov 6, 2016 at 18:29 | comment | added | Emily L. | @jmstfv see edit | |
| Nov 6, 2016 at 18:29 | history | edited | Emily L. | CC BY-SA 3.0 |
added 550 characters in body
|
| Nov 6, 2016 at 11:02 | comment | added | user118482 |
Not sure if I understood you properly. SearchNode class calculates priority in the following way: this.priority = moves + current.manhattan(); which is the number of moves taken to reach that particular position + heuristic value.
|
|
| Nov 6, 2016 at 10:50 | history | answered | Emily L. | CC BY-SA 3.0 |