It's been a decade since I have written a BF program, but if I'm not mistaken, the winning strand in the gif example has quite a bit of dead code, for example here:
[[]+<-,<<.><+>+,]
This entire loop must always be skipped, because if entered, the inner [] loop will also enter, and run indefinitely.
It would be cool to run it through more iterations, to get to the local minimum of length, rather than just a correct program.
[[]+<-,<<.><+>+,]
This entire loop must always be skipped, because if entered, the inner [] loop will also enter, and run indefinitely.
It would be cool to run it through more iterations, to get to the local minimum of length, rather than just a correct program.