Timeline for Verifying the correctness of a Sudoku solution
Current License: CC BY-SA 3.0
14 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Nov 5, 2017 at 23:57 | history | edited | j.c. | CC BY-SA 3.0 |
fix image
|
Feb 19, 2016 at 13:39 | history | edited | Emil Jeřábek | CC BY-SA 3.0 |
fix MO 1.0 -> 2.0 transition problem
|
May 17, 2013 at 9:54 | comment | added | Ralph | @Emil: Thank you very much for writing down your original solution. I would like to accept both of your answers, but unfortunately, this isn't possible on MO. | |
May 17, 2013 at 9:49 | vote | accept | Ralph | ||
May 17, 2013 at 9:49 | |||||
May 4, 2013 at 2:46 | comment | added | Will Sawin | Doesn't this imply that we can check a system is optimal by just checking you can't remove any of the rows, columns, or blocks? That cuts down dramatically on the case work. | |
May 3, 2013 at 16:05 | comment | added | François Brunault | All the consequence relations coming from $\mathcal{D}$ are linear, in the sense that $x \in \operatorname{Vect}(D \backslash \{x\})$ for every $x \in D \in \mathcal{D}$ (here we view $r_i$, $c_j$, $b_k$ as formal linear combinations of Sudoku cells). I think we can deduce from this that the Steinitz exchange axiom holds, and thus $\models$ is indeed a matroid. | |
May 3, 2013 at 15:59 | history | edited | Emil Jeřábek | CC BY-SA 3.0 |
fix typos
|
May 3, 2013 at 14:51 | history | edited | Emil Jeřábek | CC BY-SA 3.0 |
describe the full closure operator; added 2 characters in body
|
May 2, 2013 at 17:01 | comment | added | Emil Jeřábek | @François: I don’t know. I find independence rather difficult to check by hand. | |
May 2, 2013 at 15:25 | comment | added | Ralph | Emil, thanks. I'll work through the details of your answer (and the other answers and comments) at the weekend and reply at the beginning of next week. | |
May 2, 2013 at 15:01 | history | edited | Emil Jeřábek | CC BY-SA 3.0 |
add picture; added 4 characters in body
|
May 2, 2013 at 14:28 | comment | added | François Brunault | Nice! It is not hard to see that any minimal complete set is a maximal independent set. Do you know whether the converse holds? | |
May 2, 2013 at 14:18 | history | edited | Emil Jeřábek | CC BY-SA 3.0 |
add sample grid
|
May 2, 2013 at 13:58 | history | answered | Emil Jeřábek | CC BY-SA 3.0 |