I made a Brain-Flak Quine!

@MartinEnder Addition and subtraction

:D

Oh and also I proved that the top two swap was optimal but I lost the proof

how did you go about doing that? brute force?

@MartinEnder Mostly, I also used a couple of constraints to narrow the field.

judging by their length, it should then also be possible to prove NOT, OR and square to be optimal?

Yeah I think those are good contenders

what am I missing for how OR works? why <{}> not discard the bottom value irretrievably?

oh nvm

I think I can make a proof of optimality of the square (if it is in fact optimal).

Duplicating a stack under various conditions would make a useful set of programs. a) one stack is empty, the other is only positive, copy goes on other stack, b) one stack is empty, the other is arbitrary, copy goes on other stack, c) the second stack isn't empty and the copy should go on top of the original, d) reverse the original stack in the process, e) reverse the copy, f) reverse both (and various combinations of those)

@MartinEnder I'm not sure I understand

I guess "program" is the wrong word here, since most of these are no-op as programs. they'd be useful snippets though

Oh ok

I think I have some of the programs you want

brain-flak.tryitonline.net/…

replace n with the depth of the copy and it should copy it in place

brain-flak.tryitonline.net/…

Here is one that reverses with depth n

@MartinEnder Is that what you were looking for?

wow that's quite long, but yeah that's sort of what I was looking for

(with n == [])

Yeah it is actually a really hard thing to do in brain-Flak. There is almost certainly a better way but I haven't found it yet.