Timeline for Modeling tiling problems as SAT problems
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 26, 2017 at 14:29 | answer | added | SamM | timeline score: 1 | |
| Apr 26, 2017 at 2:38 | answer | added | Kyle Jones | timeline score: 2 | |
| Apr 15, 2017 at 12:35 | comment | added | Tyler Durden | @D.W. The question is not about a specific problem. It is about a concept. It doesn't matter what example of a tiling problem the answerer chooses. I just want to understand the application of SAT to tiling. If the answerer wants to include an example, then they are free to use any tiling problem they choose as the example problem. | |
| Apr 15, 2017 at 10:03 | comment | added | D.W.♦ | In addition to Raphael's comments, the definition of "tiling problem" could be made more precise. Can we use an unlimited number of copies of the shape? Is there just one shape or multiple? (I don't see what filling cells with numbers has to do with tiling.) It might help to know what the problem is before trying to find algorithms for it. | |
| Apr 15, 2017 at 8:23 | comment | added | Raphael | Where did you read this? What did the authors say to support their statement? | |
| Apr 15, 2017 at 8:23 | history | edited | Raphael |
edited tags
|
|
| Apr 15, 2017 at 2:13 | history | asked | Tyler Durden | CC BY-SA 3.0 |