Search Results

The documentation of what you are doing is also very well-documented, but the [>+<-] pattern is very common in Brainfuck so it would be enough to document "Move value at cell 2 to cell 1". … See also my brainfuck questions …

Number printing I like that you are using your own modulo calculations instead of copying the classical Brainfuck code to print a number. …

Simplifications Thanks to implementing some analysis of while loops in my Brainduck project (which I worked on thanks to reviewing "Hello, Brainfuck"), I managed to find a bunch of loops that were always … Resulting code Non-minimized version of the resulting code, without the additional flexibility-reducing simplifications, 631 Brainfuck instructions in the source code, 152267 being performed at run-time …

I am trying to brute force code Brainfuck code to get the desired output. For this, I need my code to be as fast as possible. I am sorry, but those two statements are impossible to combine. … The shortest program known at the moment to produce "Hello, World" in Brainfuck is 78 bytes, and something that your brute force approach would not be able to produce in a realistic period of time. …

I am unfortunately only experienced with using a Brainfuck interpreter that supports higher values. … (Considering it's Brainfuck, it shouldn't make sense...) Do my "comments" make sense? Surprisingly much sense, yes. …

It is much more effective in Brainfuck to count down to zero rather than count up to \$x\$. … For 8-bit Brainfuck interpreters 200_success mentioned that your code supported 8-bit Brainfuck interpreters as well, thanks to your if (x == 256) check. …

Unfortunately I do not know how to properly time Brainfuck executions (yet). The most reasonable way to time Brainfuck executions is to count the number of instructions being performed at runtime. … I added a feature to my Brainfuck Interpreter to allow me to easily count this. …