Timeline for Inexact cover, or cover with gaps
Current License: CC BY-SA 4.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 28, 2023 at 4:08 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Feb 28, 2023 at 3:08 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Oct 31, 2022 at 1:06 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jul 3, 2022 at 1:02 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Mar 5, 2022 at 0:07 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Nov 5, 2021 at 0:02 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jul 7, 2021 at 23:04 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Mar 9, 2021 at 23:03 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Nov 9, 2020 at 23:00 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jul 12, 2020 at 21:06 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jun 12, 2020 at 19:30 | answer | added | mafu | timeline score: 1 | |
| Aug 21, 2018 at 21:29 | comment | added | Andrew Savinykh | @D.W. I tried it for 6 by 6 sqaure with 7 default tetromino, fixed to a particular orientation, that is not flips or rotates - to make it easier. This gives 8 gaps. So each feasible solution gives me (8! = 40320) duplicates. Getting that many solutions and then trying to eliminate duplicates feel sub-optimal. It feels like a better level is either changing the model or adjusting the algorythm. As for NP-hard - yes, I realize that. But I'm using smaller board than in original research and I have better than Pentium III used in the original research (we all do now). | |
| Aug 21, 2018 at 21:23 | comment | added | D.W.♦ | You say the resulting algorithm might be slow, because there are so many cases to explore. I have two responses. (1) Have you tried it? Have you tried running Knuth's algorithm on the resulting exact cover instance? It would be interesting to know if it works or not. (2) The problem is NP-hard. I don't find it too surprising that it may be slow. It's possible there might not be any good solution. Still fair to ask whether one can do better, but just preparing you for the possibility that there might not be a better solution. | |
| Aug 21, 2018 at 20:13 | history | edited | Andrew Savinykh | CC BY-SA 4.0 |
deleted 1 character in body
|
| Aug 21, 2018 at 20:08 | history | asked | Andrew Savinykh | CC BY-SA 4.0 |