The Third Stack

« first day (569 days earlier) ← previous day next day → last day (673 days later) »

DJMcMayhem

20:06

@cairdcoinheringaahing BFMC: Count from input to 0

caird coinheringaahing

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

DJMcMayhem

@cairdcoinheringaahing Yes, and idc

← 3 messages moved from The Nineteenth Byte

caird coinheringaahing

@DJMcMayhem 14 bytes

DJMcMayhem

@cairdcoinheringaahing Can you make it inclusive?

I can do inclusive in 12

caird coinheringaahing

@DJMcMayhem 20 bytes

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

Heeby Jeeby Man

20:14

({}<>)

@DJMcMayhem 12 bytes

DJMcMayhem

(...) 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

Heeby Jeeby Man

Yeah I missed the rest of the convo :P

DJMcMayhem

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

caird coinheringaahing

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

DJMcMayhem

Would you like a hint?

caird coinheringaahing

20:20

Why not?

12 bytes

DJMcMayhem

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

Bonus points for being stack clean

caird coinheringaahing

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

DJMcMayhem

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

caird coinheringaahing

22 bytes

I can't seem to beat 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 :/

caird coinheringaahing

20:58

@DJMcMayhem Are you still here?

DJMcMayhem

Yesh

caird coinheringaahing

@DJMcMayhem 10 bytes

DJMcMayhem

Haha, that's cool

@cairdcoinheringaahing Have you tried multiplication?

caird coinheringaahing

Nope, should I do that next?

DJMcMayhem

Yes

caird coinheringaahing

21:12

@DJMcMayhem 64 bytes, stack clean

Only works with positive integers

DJMcMayhem

Nice

caird coinheringaahing

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

DJMcMayhem

Generally, yes

caird coinheringaahing

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

DJMcMayhem

No? Positive only is 36

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

caird coinheringaahing

21:17

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?

DJMcMayhem

@cairdcoinheringaahing Lol

Is it readable now?

caird coinheringaahing

As readable as BrainFlak can be :P

Does ({}) actually do anything?

DJMcMayhem

Yes.

It has no effect, but it evaluates to the TOS

It's super useful

caird coinheringaahing

How so?

DJMcMayhem

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

caird coinheringaahing

21:31

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

DJMcMayhem

Or (({})[()])

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

caird coinheringaahing

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

DJMcMayhem

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

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

caird coinheringaahing

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

DJMcMayhem

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

caird coinheringaahing

21:35

That is genuis

DJMcMayhem

Yeah, it totally blew my mind too

caird coinheringaahing

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

DJMcMayhem

@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:

caird coinheringaahing

@DJMcMayhem It's been a long day :P

H.PWiz

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

DJMcMayhem

21:48

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

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

H.PWiz

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

DJMcMayhem

Oh yeah, I see

« first day (569 days earlier) ← previous day next day → last day (673 days later) »

all rooms

Transcript for

Jan14

Jan '1815

Jan19

A chat room for discussing the Brain-Flak programming language...

brain-flak confusing-languages scary-pencils what-does-my-code-do?

join this room
about this room

00:00

06:00

12:00

18:00

all times are UTC