This challenge is for the largest finite number you can get BrainFuck programs of given lengths to contain in memory.
We must use one of the BF versions that uses big integers for the cells rather than byte values as not to be capped at 255. Do not use negative positions and values in memory. Do not use the BF instruction to input memory, also the output instruction is not needed.
Challenge:
Write Brainfuck programs with lengths from 0 to 50. Your score is the sum of each programs maximum value in memory.
As they may well be trivial feel free to omit the programs listed below and start from a length of 21, I'll use the following for the smaller sizes:
Length, Score, Program
0, 0
1, 1, +
2, 2, ++
3, 3, +++
Pattern Continues
10, 10, ++++++++++
11, 11, +++++++++++
12, 12, ++++++++++++
13, 16, ++++[->++++<]
14, 20, +++++[->++++<]
15, 25, +++++[->+++++<]
16, 30, ++++++[->+++++<]
17, 36, ++++++[->++++++<]
18, 42, +++++++[->++++++<]
19, 49, +++++++[->+++++++<]
20, 56, ++++++++[->+++++++<]
Total Score: 352
Related but different:
See the comments below for more info.
The combined results so far, being the sum of the best of each size:
length: 50
by l4m2
(262) - 2
length: 49
by l4m2
(212) - 2
length: 48
based on code by l4m2, by alan2here
(172) - 2
length: 39 to 47
based on code by l4m2, by alan2here
Σ (n = 4 to 12) of (fn(0) | f(x) := (4x+2 - 4) / 3)
length: 38
based on code by l4m2, by alan2here
(4^1366 - 4) / 3
length: up to 37 by alan2here
x |
x > 6 ^ 20
x > n
x ≈ n
n = 3,657,880,038,459,860
cells which can take on any integer value without overflowing
, though it's impossible to actually get above 255 anyway. This extension seems like a more interesting question (that bans negative positions as well. I don't think eiher should be closed \$\endgroup\$ – Jo King♦ Nov 15 '18 at 22:22