Timeline for Making backtracking Knight's Tours solution more efficient
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 10, 2018 at 7:17 | comment | added | dEmigOd | Running in a clockwise manner never ends. But anti-clockwise, is extremely fast for N=8 | |
| S Jun 11, 2015 at 12:37 | history | suggested | Quill | CC BY-SA 3.0 |
fixed code snippets
|
| Jun 11, 2015 at 12:05 | review | Suggested edits | |||
| S Jun 11, 2015 at 12:37 | |||||
| Jun 11, 2015 at 11:40 | review | Late answers | |||
| Jun 11, 2015 at 12:05 | |||||
| Jun 11, 2015 at 11:25 | review | First posts | |||
| Jun 11, 2015 at 12:44 | |||||
| Jun 11, 2015 at 11:24 | history | answered | Skandh Pathak | CC BY-SA 3.0 |