Timeline for Is this "Gear Turning" puzzle on Puzzlopia always solvable?
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 8:22 | history | edited | CommunityBot |
Commonmark migration
|
|
| Dec 7, 2016 at 16:45 | comment | added | Jonathan Allan | (For some reason I never noticed a notification of your comment, sorry.) Yes, I meant B,D,G could be in any state and one in three of all states were solvable. The updated explanation seems good to me! | |
| Nov 22, 2016 at 2:19 | comment | added | justhalf | @JonathanAllan: You made a good point. So because B, D, and G are not part of the solvability requirement, then it can be any state, is that what you mean? | |
| Nov 22, 2016 at 2:17 | comment | added | justhalf | @HenningMakholm: Oops, yes. I didn't consider that aspect carefully (due to the illusion that "oh, only one variable needs to be fixed"). I have revised the claim. Thanks for the comment! | |
| Nov 22, 2016 at 2:13 | history | edited | justhalf | CC BY-SA 3.0 |
Incorporate the changes suggested by commenters.
|
| Nov 22, 2016 at 2:06 | comment | added | justhalf | Wow, I didn't know this answer attracts so much traction. I'll update the answer as your good and constructive comments suggested. | |
| Nov 22, 2016 at 1:26 | vote | accept | greenturtle3141 | ||
| Nov 21, 2016 at 14:01 | comment | added | hmakholm left over Monica | So "almost always solvable" means "solvable with probability 1/3 if states are chosen randomly"? | |
| Nov 21, 2016 at 11:38 | comment | added | Matsmath | I suggest you to write an executive summary in the beginning of your post, stating when (if and only statement) the configuration is solvable. Then the interested reader can go on and start reading the details. Now the answer is hidden deep down amongst the lines of the reasoning (=proof of the claim). | |
| Nov 21, 2016 at 11:35 | comment | added | Tokkot | When you say "Notice that rotating A+D+F+I once results in rotating all gears once. So we can safely assume that I=0 and later rotate all gears once to compensate for this." it is odd, because in the puzzle I see, you can only rotate all "gears" (unless you lock something). | |
| Nov 21, 2016 at 11:09 | comment | added | Jonathan Allan |
So one in three configurations are solvable, and we can rotate B, D, and G independently? (oh, by the way your count_zero could be replaced with arr.count(0))
|
|
| Nov 21, 2016 at 10:13 | history | edited | justhalf | CC BY-SA 3.0 |
Add code
|
| Nov 21, 2016 at 9:52 | history | edited | justhalf | CC BY-SA 3.0 |
Add proof for maximal rotations required for any puzzle
|
| Nov 21, 2016 at 9:12 | history | answered | justhalf | CC BY-SA 3.0 |