#Score: 37 43
Score:
#Score: 37 43
Score: 37 43
#Score: 3737 43
>+>--<>---<>----<><+>-+>-,-<>>,+-><--->+-,<><>+<-<>>-[>-<+><+>->+-<+-<+>+<[->+<+--<+>>>+><,+>>>++<><<<+<[>->++<-]]><><+-+>+<<+<><+++<[[<[-><<+>-<>--<++>>-<-]>++>],>,]<,]<+-><. EDIT: Now my program allows some square brackets. Not going to win any prizes with it, but that's what I get for making some weighted RNGs do the busy work for me.
N = 0 => 223158 N = 1 => 223158 N = 2 => 224158 N = 3 => 224187 N = 4 => 224129 N = 5 => 225100 N = 6 => 226158 N = 7 => 22413 N = 8 => 2241 N = 9 => 224211 N = 10 => 228129 N = 11 => 2291 N = 12 => 22457 N = 13 => 224255 N = 14 => 224Mismatched Braces N = 15 => 22459 N = 16 => 23211 N = 17 => 23311 N = 18 => 23211 N = 19 => 223117 N = 20 => 23411 N = 21 => 224117 N = 22 => 224166 N = 23 => 224Mismatched Braces N = 24 => 235206 N = 25 => 237206 N = 26 => 224206 N = 27 => 238147 N = 28 => 236147 N = 29 => 224158 N = 30 => 224148 N = 31 => 224188 N = 32 => 24151 N = 33 => 22317 N = 34 => 22384 N = 35 => 22384 N = 36 => 23984 N = 37 => 241158 N = 38 => 239158 N = 39 => 24194 N = 40 => 22346 N = 41 => 24094 N = 42 => 22494 N = 43 => 24194 N = 44 => 24217 N = 45 => 224196 N = 46 => 224Mismatched Braces N = 47 => 243149 N = 48 => 223No Termination N = 49 => 245No Termination N = 50 => 243Mismatched Braces N = 51 => 223Mismatched Braces N = 52 => 24645 N = 53 => 22477 N = 54 => 24745 N = 55 => 22377 N = 56 => 22350 N = 57 => 244209 N = 58 => 22450 N = 59 => 245251 N = 60 => 223249 N = 61 => 24999 N = 62 => 22499 N = 63 => 250117 N = 64 => 22389 N = 65 => 247207 N = 66 => 22289 N = 67 => 224115 N = 68 => 224115 N = 69 => 248115 N = 70 => 22395 N = 71 => 252Mismatched Braces N = 72 => 224Mismatched Braces N = 73 => 253104 N = 74 => 223Mismatched Braces N = 75 => 223No Termination N = 76 => 251No Termination N = 77 => 224No Termination N = 78 => 224No Termination N = 79 => 224Left Overflow N = 80 => 03 N = 81 => 2542 N = 82 => 254No Termination N = 83 => 223Mismatched Braces N = 84 => 1No Termination N = 85 => 224133 N = 86 => 255133 N = 87 => 20 N = 88 => 224Mismatched Braces N = 89 => 224158 N = 90 => 10 N = 91 => 2234 N = 92 => 223Mismatched Braces N = 93 => 60 N = 94 => 224158 N = 95 => 224Mismatched Braces N = 96 => 2240 N = 97 => 9157 N = 98 => 4159 N = 99 => None 0, 1, 2, 3, 4,6 11,9 13,222 17,223 45,224 46,225 50,226 51,228 57,229 59,232 77,233 84,234 89,235 94,236 95,237 99,238 100,239 104,240 115, 241 117,242 129,243 133,244 147,245 148,246 149,247 157,248 158,249 159,250 166,251 187,252 188,253 196,254 206, 207, 209, 211, 249, 251, 255 I am 90% 100% certain this solution is not optimal, but proving that may be exceedingly difficult. There are a few things that are clear. Having no . symbols until the last character seems to be the way to go, and square brackets ([]) seem to be rather useless, and square brackets (. I did a little bit of thinking here, which I'd like to outline:[]) seem to be rather useless
#Score: 37
>+>--<>---<>----<><+>---<>-><--->+-,<><>+<-<>--<+><+>->+-<-<+>->+<+--<+>->++<---><<+>-<>--<++>---><. N = 0 => 223 N = 1 => 223 N = 2 => 224 N = 3 => 224 N = 4 => 224 N = 5 => 225 N = 6 => 226 N = 7 => 224 N = 8 => 224 N = 9 => 224 N = 10 => 228 N = 11 => 229 N = 12 => 224 N = 13 => 224 N = 14 => 224 N = 15 => 224 N = 16 => 232 N = 17 => 233 N = 18 => 232 N = 19 => 223 N = 20 => 234 N = 21 => 224 N = 22 => 224 N = 23 => 224 N = 24 => 235 N = 25 => 237 N = 26 => 224 N = 27 => 238 N = 28 => 236 N = 29 => 224 N = 30 => 224 N = 31 => 224 N = 32 => 241 N = 33 => 223 N = 34 => 223 N = 35 => 223 N = 36 => 239 N = 37 => 241 N = 38 => 239 N = 39 => 241 N = 40 => 223 N = 41 => 240 N = 42 => 224 N = 43 => 241 N = 44 => 242 N = 45 => 224 N = 46 => 224 N = 47 => 243 N = 48 => 223 N = 49 => 245 N = 50 => 243 N = 51 => 223 N = 52 => 246 N = 53 => 224 N = 54 => 247 N = 55 => 223 N = 56 => 223 N = 57 => 244 N = 58 => 224 N = 59 => 245 N = 60 => 223 N = 61 => 249 N = 62 => 224 N = 63 => 250 N = 64 => 223 N = 65 => 247 N = 66 => 222 N = 67 => 224 N = 68 => 224 N = 69 => 248 N = 70 => 223 N = 71 => 252 N = 72 => 224 N = 73 => 253 N = 74 => 223 N = 75 => 223 N = 76 => 251 N = 77 => 224 N = 78 => 224 N = 79 => 224 N = 80 => 0 N = 81 => 254 N = 82 => 254 N = 83 => 223 N = 84 => 1 N = 85 => 224 N = 86 => 255 N = 87 => 2 N = 88 => 224 N = 89 => 224 N = 90 => 1 N = 91 => 223 N = 92 => 223 N = 93 => 6 N = 94 => 224 N = 95 => 224 N = 96 => 224 N = 97 => 9 N = 98 => 4 N = 99 => None 0,1,2,4,6,9,222,223,224,225,226,228,229,232,233,234,235,236,237,238,239,240, 241,242,243,244,245,246,247,248,249,250,251,252,253,254,255 I am 90% 100% certain this solution is not optimal, but proving that may be exceedingly difficult. There are a few things that are clear. Having no . symbols until the last character seems to be the way to go, and square brackets ([]) seem to be rather useless. I did a little bit of thinking here, which I'd like to outline:
#Score: 37 43
+>-,->,+-><->-[>---+-+<[--->>+><,+>>>++<><<<+<[>--]]><><+-+>+<<+<><+++<[[<[---->-<-]>++>],>,]<,]<+-. EDIT: Now my program allows some square brackets. Not going to win any prizes with it, but that's what I get for making some weighted RNGs do the busy work for me.
N = 0 => 158 N = 1 => 158 N = 2 => 158 N = 3 => 187 N = 4 => 129 N = 5 => 100 N = 6 => 158 N = 7 => 13 N = 8 => 1 N = 9 => 211 N = 10 => 129 N = 11 => 1 N = 12 => 57 N = 13 => 255 N = 14 => Mismatched Braces N = 15 => 59 N = 16 => 11 N = 17 => 11 N = 18 => 11 N = 19 => 117 N = 20 => 11 N = 21 => 117 N = 22 => 166 N = 23 => Mismatched Braces N = 24 => 206 N = 25 => 206 N = 26 => 206 N = 27 => 147 N = 28 => 147 N = 29 => 158 N = 30 => 148 N = 31 => 188 N = 32 => 51 N = 33 => 17 N = 34 => 84 N = 35 => 84 N = 36 => 84 N = 37 => 158 N = 38 => 158 N = 39 => 94 N = 40 => 46 N = 41 => 94 N = 42 => 94 N = 43 => 94 N = 44 => 17 N = 45 => 196 N = 46 => Mismatched Braces N = 47 => 149 N = 48 => No Termination N = 49 => No Termination N = 50 => Mismatched Braces N = 51 => Mismatched Braces N = 52 => 45 N = 53 => 77 N = 54 => 45 N = 55 => 77 N = 56 => 50 N = 57 => 209 N = 58 => 50 N = 59 => 251 N = 60 => 249 N = 61 => 99 N = 62 => 99 N = 63 => 117 N = 64 => 89 N = 65 => 207 N = 66 => 89 N = 67 => 115 N = 68 => 115 N = 69 => 115 N = 70 => 95 N = 71 => Mismatched Braces N = 72 => Mismatched Braces N = 73 => 104 N = 74 => Mismatched Braces N = 75 => No Termination N = 76 => No Termination N = 77 => No Termination N = 78 => No Termination N = 79 => Left Overflow N = 80 => 3 N = 81 => 2 N = 82 => No Termination N = 83 => Mismatched Braces N = 84 => No Termination N = 85 => 133 N = 86 => 133 N = 87 => 0 N = 88 => Mismatched Braces N = 89 => 158 N = 90 => 0 N = 91 => 4 N = 92 => Mismatched Braces N = 93 => 0 N = 94 => 158 N = 95 => Mismatched Braces N = 96 => 0 N = 97 => 157 N = 98 => 159 N = 99 => None 0, 1, 2, 3, 4, 11, 13, 17, 45, 46, 50, 51, 57, 59, 77, 84, 89, 94, 95, 99, 100, 104, 115, 117, 129, 133, 147, 148, 149, 157, 158, 159, 166, 187, 188, 196, 206, 207, 209, 211, 249, 251, 255 I am 90% 100% certain this solution is not optimal, but proving that may be exceedingly difficult. There are a few things that are clear. Having no . symbols until the last character seems to be the way to go, and square brackets (. I did a little bit of thinking here, which I'd like to outline:[]) seem to be rather useless
I am 90%90% 100% certain this solution is not optimal, but proving that may be exceedingly difficult, but proving that may be exceedingly difficult. There are a few things that are clear. Having no . symbols until the last character seems to be the way to go, and square brackets ([]) seem to be rather useless. I did a little bit of thinking here, which I'd like to outline:
This begs the question, how quickly, and in what matter, does the ratio descend? For L = 100, and at 10^9 checks/second, it would take several orders of magnitude longer than the lifetime of the universe to bruteforce an optimal solution. Is there an elegant way to go about this? I very much doubt that it is down to 37% forI very much doubt that it is down to 37% for L = 100.
The ratio actually increases, up to L = 100L=100. View other answers to confirm.
I'd love to hear your evaluations of the above. I could becould be was atrociously wrong, after all.
I am 90% certain this solution is not optimal, but proving that may be exceedingly difficult. There are a few things that are clear. Having no . symbols until the last character seems to be the way to go, and square brackets ([]) seem to be rather useless. I did a little bit of thinking here, which I'd like to outline:
This begs the question, how quickly, and in what matter, does the ratio descend? For L = 100, and at 10^9 checks/second, it would take several orders of magnitude longer than the lifetime of the universe to bruteforce an optimal solution. Is there an elegant way to go about this? I very much doubt that it is down to 37% for L = 100.
I'd love to hear your evaluations of the above. I could be atrociously wrong, after all.
I am 90% 100% certain this solution is not optimal, but proving that may be exceedingly difficult. There are a few things that are clear. Having no . symbols until the last character seems to be the way to go, and square brackets ([]) seem to be rather useless. I did a little bit of thinking here, which I'd like to outline:
This begs the question, how quickly, and in what matter, does the ratio descend? For L = 100, and at 10^9 checks/second, it would take several orders of magnitude longer than the lifetime of the universe to bruteforce an optimal solution. Is there an elegant way to go about this? I very much doubt that it is down to 37% for L = 100.
The ratio actually increases, up to L=100. View other answers to confirm.
I'd love to hear your evaluations of the above. I could be was atrociously wrong, after all.
Loading
Loading