Timeline for 40 Numbers in 9 Bytes
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 10, 2015 at 16:13 | history | edited | Sp3000 | CC BY-SA 3.0 | added 268 characters in body |
| Jul 10, 2015 at 4:24 | comment | added | Sparr | +/- in the corners, another operator in the middle, and 4 digits. very small search space, easy to brute force. not a horrible idea, but unlikely to beat 23. | |
| Jul 9, 2015 at 18:37 | comment | added | Reto Koradi | Just a random thought: Have you tried allowing + and - in the corners/center? Since they are unary as well as binary operators, that should still result in all valid expressions. Unlikely that it will result in a better solution, but at least it expands the search space. Hmm, actually, it might be a problem because you could end up with sequences of operators. | |
| Jul 9, 2015 at 4:20 | comment | added | Sparr | @isaacg there are more 23-point solutions if you throw in some more operators, like &|^ | |
| Jul 9, 2015 at 3:32 | comment | added | izzyg | @Sp3000 I finished the brute forcing of this style of solution. There's 6+7*5%6%4, 6+7*4%6%5 and 6+8*4%6%5 (left to right, top to bottom), and nothing else. | |
| Jul 8, 2015 at 21:19 | history | rollback | randomra | Rollback to Revision 2 | |
| Jul 8, 2015 at 21:18 | comment | added | Sp3000 | @RetoKoradi The first part's what I did. The second... later :P | |
| Jul 8, 2015 at 21:01 | comment | added | Reto Koradi | Next task: Write a program that generates the program with the most unique values. Then golf that program. :) | |
| Jul 8, 2015 at 20:50 | history | rollback | Sp3000 | Rollback to Revision 1 | |
| Jul 8, 2015 at 20:50 | history | edited | Sp3000 | CC BY-SA 3.0 | added 1 character in body |
| Jul 8, 2015 at 20:28 | history | answered | Sp3000 | CC BY-SA 3.0 |