@cairdcoinheringaahing BFMC: Count from input to 0

Input will always be positive? And should we move to the Third Stack?

@cairdcoinheringaahing Yes, and idc

← 3 messages moved from The Nineteenth Byte

@DJMcMayhem 14 bytes

@cairdcoinheringaahing Can you make it inclusive?

I can do inclusive in 12

@DJMcMayhem 20 bytes

Q: How do you move a value from one stack to the other?

({}<>)

@DJMcMayhem 12 bytes

(...) will push on to whichever stack is active when it finished (when you encounter the first ')' char), so ({}<>) what you want

Well I know you can do it :P

Yeah I missed the rest of the convo :P

@cairdcoinheringaahing If you like, I'd be happy to give you some slowly increasing complexity BFMCs to help you learn

That'd be good. I'm very close to 12 bytes though :P

Would you like a hint?

Why not?

12 bytes

@cairdcoinheringaahing CMC: Given a single integer 'a' in [0, 1], output !a

Bonus points for being stack clean

The obvious approach is 0**a, but that's going to be long

That might be obvious for any other language where you don't need to manually implement exponentiation with simple loops and incrementing :P

22 bytes

I have 8 bytes for non-stack clean

10 bytes from stack clean

Both of which seem to beat the example program

Wait, just realised why no-one's talking, new main challenge :/

@DJMcMayhem Are you still here?

Yesh

@DJMcMayhem 10 bytes

Haha, that's cool

@cairdcoinheringaahing Have you tried multiplication?

Nope, should I do that next?

Yes

@DJMcMayhem 64 bytes, stack clean

Only works with positive integers

Nice

Are the example programs in the wiki supposed to be the shortest found solutions?

Generally, yes

Huh, cause that's two I've beaten now. Weird

No? Positive only is 36

The 78 byte on the wiki works with negatives and 0 too

Oh yeah, copied the wrong one :P

@DJMcMayhem "readable version" Sure, looks around "readable", yeah I totally know what's going on there shifty look :P

Also, is there any documentation on the CLFs?

@cairdcoinheringaahing Lol

Is it readable now?

As readable as BrainFlak can be :P

Does ({}) actually do anything?

Yes.

It has no effect, but it evaluates to the TOS

It's super useful

How so?

For example, ({({})({}[()])})

Sum of all numbers between 0 and n? (just a guess)

Or (({})[()])

@cairdcoinheringaahing nope. n**2 believe it or not

@DJMcMayhem o.O How on earth does that work?

That was my reaction too. It's tri(n) + tri(n-1) "tri" meaning triangular number

@cairdcoinheringaahing Sum of 0 to n is just ({({}[()])()}{})

@DJMcMayhem o.O Hold on, I need to figure out the algebra of that, be back in a second

There's a really cool visual proof of it too :)

That is genuis

Yeah, it totally blew my mind too

@DJMcMayhem I have to go and sleep, but it was fun to get started with BrainFlak. Bye o/

@cairdcoinheringaahing @HeebyJeebyMan Ugly MS paint visual proof ^^

@cairdcoinheringaahing Sleep? But it isn't even 3 in the afternoon!

JK, I'll cya later :)

How brain-flak's square program works:

@DJMcMayhem It's been a long day :P

@DJMcMayhem Interesting. I derived the same program from the sum of odd numbers up to n

But it's actually the sum of odd numbers up to 2n

For 3, it's sum(1, 3, 5)

Yeah. 2x-1 where x goes up to n

Oh yeah, I see