Timeline for How can we formulate an anti-knight Sudoku as an exact cover problem?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 30, 2021 at 17:45 | history | edited | Mingwei Samuel | CC BY-SA 4.0 |
added 200 characters in body
|
| Jun 28, 2021 at 8:44 | comment | added | Pseudonym♦ | Just as an addendum, if you're using the DLX algorithm as your solver, Knuth's paper explains how to support "optional" rules using the example of the N-Queens problem. So you could extend that to antiknight/antiking/antiortho sudoku very easily. | |
| Jun 28, 2021 at 7:45 | history | edited | Mingwei Samuel | CC BY-SA 4.0 |
added 7 characters in body
|
| Jun 28, 2021 at 7:42 | review | First posts | |||
| Jul 12, 2021 at 7:36 | |||||
| Jun 28, 2021 at 7:36 | history | answered | Mingwei Samuel | CC BY-SA 4.0 |