Timeline for Moving matchsticks
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 29, 2017 at 6:45 | vote | accept | IQ WANTER | ||
| Dec 28, 2017 at 23:44 | comment | added | Bass | Assuming there really is no clever "other solution", I'd like to suggest a slight modification: remove the middle stick in the vertical line of 5 sticks, and transform the problem into this famous one. Notice the lack of sore sticks, how the starting position is 4-way symmetric and the answer is not, and how all the squares in the starting position are non-adjacent, and the answer has squares crammed in as tight as possible. | |
| Dec 28, 2017 at 22:02 | comment | added | ekhumoro | It also means there is no unique solution. The sore-stick solution can be formed in 16 different ways. | |
| Dec 28, 2017 at 17:12 | comment | added | Bass | The obvious solution has 17 squares and one extra match sticking out like a sore.. stick. This is, in general, an uncool thing: all the matches should be meaningful parts of the solution. I hope there is a less obvious solution that makes use of all the matches. | |
| Dec 28, 2017 at 17:09 | answer | added | user43429 | timeline score: 15 | |
| Dec 28, 2017 at 17:07 | comment | added | Quintec | Mostly likely move... Remove would be impossible? @Seyed | |
| Dec 28, 2017 at 17:06 | comment | added | Seyed | $Move$ 3 matchsticks or $Remove$? | |
| Dec 28, 2017 at 17:04 | history | asked | IQ WANTER | CC BY-SA 3.0 |