Timeline for Minimum number of moves algorithm in Java
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 13, 2016 at 11:57 | comment | added | Francisco | Yeah, will do. Thank you very much for the help! :) | |
| Jan 13, 2016 at 11:42 | comment | added | Mayuso | BFS is also nice. You can try both and keep the one that fits your needs better. | |
| Jan 13, 2016 at 11:40 | history | edited | Mayuso | CC BY-SA 3.0 |
Fixer grammar
|
| Jan 13, 2016 at 11:34 | vote | accept | Francisco | ||
| Jan 13, 2016 at 11:34 | comment | added | Francisco | Hey! Thanks a lot for your answer! I ended up using BFS because i wasn't so sure about the heuristic to use in this case, but i'm definetly going to try it with A* now. Thanks! | |
| Jan 13, 2016 at 8:03 | history | answered | Mayuso | CC BY-SA 3.0 |