Timeline for Lights out, 7-segment version
Current License: CC BY-SA 3.0
26 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 7, 2017 at 0:45 | answer | added | fireflame241 | timeline score: 2 | |
| Jun 6, 2017 at 14:08 | answer | added | user202729 | timeline score: 2 | |
| Jun 6, 2017 at 9:30 | comment | added | Neil | You can also use the XOR space explorer to find out how many segment sets can be generated from a given set of digits. | |
| Jun 6, 2017 at 8:47 | comment | added | kyrill | @Challenger5 Did it display incorrectly in your browser? If so, which browser and system do you use? I'm using FF on Fedora and it looked OK, but then someone edited the Unicode part of my task description, saying he "fixed alignment". After that edit, the alignment was wrong in my browser. Alas, I guess we're not ready for Unicode yet... Or maybe I just don't know how to use it properly :-] | |
| Jun 6, 2017 at 8:44 | history | edited | kyrill | CC BY-SA 3.0 |
removed unicode
|
| Jun 6, 2017 at 2:39 | answer | added | fireflame241 | timeline score: 4 | |
| Jun 5, 2017 at 21:09 | history | edited | mbomb007 | CC BY-SA 3.0 |
fixed alignment
|
| Jun 5, 2017 at 20:10 | history | edited | kyrill | CC BY-SA 3.0 |
added 10 characters in body
|
| Jun 5, 2017 at 7:57 | comment | added | Neil |
@GregMartin 2 isn't always necessary, because you can replace it with either 0468, 1358, or 1369, depending on whether you want a 0, 8 or 9 in your answer, but there's no way to eliminate 7 at all, and I think you have to have at least one of 1 and 3.
|
|
| Jun 5, 2017 at 0:25 | comment | added | Greg Martin | @Neil: I see why 2 is necessary (it's the only way to get at the lower-right vertical segment); why is 7 necessary? | |
| Jun 5, 2017 at 0:22 | comment | added | Greg Martin |
Proof that a solution always exists: it suffices to find solutions for each individual segment. Solutions for the horizontal segments, from top to bottom, are 17, 08, and 1479. Solutions for the upper vertical segments, left to right, are 39 and 59. Solutions for the lower vertical segments, left to right, are 56 and 2389.
|
|
| Jun 5, 2017 at 0:15 | answer | added | Neil | timeline score: 2 | |
| Jun 4, 2017 at 22:13 | comment | added | Esolanging Fruit | Looks like somebody likes Unicode :) | |
| Jun 4, 2017 at 19:38 | comment | added | Neil |
There are 1024 possible digit sets and 128 possible segment sets, so that makes 8 digit set solutions for each segment set. These can be obtained by a combination of set differences with three sets such as the following: 02468, 12358, 12369. This means that it's possible to avoid considering up to three digits (although 7 is always necessary) when determining an answer.
|
|
| Jun 4, 2017 at 19:11 | history | tweeted | twitter.com/StackCodeGolf/status/871444433786597377 | ||
| Jun 4, 2017 at 17:39 | answer | added | Arnauld | timeline score: 2 | |
| Jun 4, 2017 at 17:23 | history | edited | kyrill | CC BY-SA 3.0 |
added 148 characters in body
|
| Jun 4, 2017 at 17:18 | history | edited | kyrill | CC BY-SA 3.0 |
edited body
|
| Jun 4, 2017 at 17:17 | comment | added | Arnauld | Nice challenge, BTW. :-) | |
| Jun 4, 2017 at 17:14 | history | edited | kyrill | CC BY-SA 3.0 |
added alternative input
|
| Jun 4, 2017 at 17:10 | history | edited | kyrill | CC BY-SA 3.0 |
added information
|
| Jun 4, 2017 at 17:09 | comment | added | kyrill | @Arnauld Yes, that's correct. | |
| Jun 4, 2017 at 17:01 | comment | added | Arnauld |
"Some combinations have several non-repetitive solutions" Also, any permutation of a solution is another solution, right? (like 301 for H).
|
|
| Jun 4, 2017 at 17:00 | comment | added | Level River St | Also, what formats are allowed for input? Will the segment numbers be given in order? What do we do if there is no solution? | |
| Jun 4, 2017 at 16:58 | comment | added | Level River St | This needs more specification. Which segments are included in each digit (for example, does 9 include the bottom segment?) Please draw all digits and indicate the numbers of the segments included in each. | |
| Jun 4, 2017 at 16:48 | history | asked | kyrill | CC BY-SA 3.0 |