Timeline for Making backtracking Knight's Tours solution more efficient
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 17, 2014 at 6:10 | comment | added | DanSchneiderNA | Update: I checked online on ways to check for least possible combinations. As far as I can tell, all of the solutions show for ways that do not involve backtracking. I may not be understanding the solution, but I am very confused as to what they are doing. I am very confused overall. | |
| Oct 16, 2014 at 21:49 | comment | added | DanSchneiderNA | I agree switching to something other than backtracking would be faster, but it is required in the assignment to use backtracking. If I initialize border cells to -2, would I eliminate bound checking by testing if the current cell was -2? I'm a little confused on how padding the border would make the solution any faster. I will check into some heuristics to possibly add to my solution. | |
| Oct 16, 2014 at 17:16 | history | answered | vnp | CC BY-SA 3.0 |