Timeline for Generate all the free polyominoes who's width and height is no larger than 8
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 9 at 9:56 | comment | added | Shadowtrot | Yeah I realized that later, another case is where n=1 has only one unique solution but n=63 has at least 10. | |
| Sep 9 at 9:34 | history | edited | Shadowtrot | CC BY-SA 4.0 |
Removed false optimization "skip half of n", fixed asterisks becoming md italics.
|
| Sep 9 at 9:27 | history | edited | Shadowtrot | CC BY-SA 4.0 |
deleted 160 characters in body
|
| Sep 9 at 6:59 | comment | added | miracle173 | "All n=[33,63] pieces could be skipped ..." No, that is wrong. The grid-squares of a polyomino are connected. The inversion usually isn't. | |
| S Sep 8 at 19:51 | review | First answers | |||
| Sep 8 at 21:47 | |||||
| S Sep 8 at 19:51 | history | answered | Shadowtrot | CC BY-SA 4.0 |