Timeline for Does a systematic way to solve a magic square made up of domino pieces exist?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 27, 2020 at 6:25 | comment | added | Bass | @ChrisSteinbeckBell there are still some "moving parts", do we have to use each of the four tiles at least once? Or maybe we should use each exactly twice? The way I would approach this is to start with some common sum. This gives the total number of dots in the pattern, which helps with choosing a possible tile combination. As an oversimplified example, if I chose "1" as the common sum, my tiles could only be 4 x 0-0 and 4 x 0-1, and from those tiles it's easy to check if a magic square can be made. | |
| Oct 27, 2020 at 2:21 | comment | added | Chris Steinbeck Bell | If we assume that some pieces may be used more than once can this problem be solved. Can you include an answer given this scenario? and what sort of logic should be used to reach an answer by following that condition?. Can you help me with that?. | |
| Oct 27, 2020 at 2:20 | comment | added | Chris Steinbeck Bell | Sorry!, I have to mention that the paragraph included below the question is my interpretation of what is the intended way to approach this question based on other problems, but it is not specifically indicated. There isn't any condition indicating that some pieces cannot be used more than once.Yes I agree there's an unusual definition of a magic square. If you read my question, I know there's a method to fill out a 3 times 3 magic square but there isn't one for a 4 times 4 square which I could remember (maybe there is) but given this conditions I don't think it will be applicable. | |
| Oct 26, 2020 at 16:13 | history | edited | Bass | CC BY-SA 4.0 |
edited body
|
| Oct 26, 2020 at 16:08 | history | answered | Bass | CC BY-SA 4.0 |
