The Third Stack

« first day (124 days earlier) ← previous day next day → last day (1118 days later) »

Wheat Wizard

00:26

I have an idea

wait a second

({}[()]){(<({}<{}>)>)}{}

thats my best

oh wait I need to modify that

sorry that doesn't work

it destorys the one under it

I think your answer is the best

13 hours later…

Riley

13:46

Darn. I have a modulo solution that is only 2 bytes more than Dennis's and I feel like it has somewhere that it can be improved.
({}<(({}))>)
{({}[()]<

({}[()]<(({}))>)
{(<({}<{}>)>)}{}

>)}{}([{}]{})

MegaTom

@Riley take the <> from the first line

a mod b == (a+b) mod b

brain-flak.tryitonline.net/…

Riley

14:09

@MegaTom Nice, thanks. That ties his solution.

We're getting close

1 hour later…

MegaTom

15:14

what is the shortest known code for more than or equal to zero?

I got "([({}<(())>)]){(((){}({}<([{}]())>))[({}[{}])])}{}{}" but I think it can be shorter.

2 hours later…

DJMcMayhem

16:57

In other words, TOS > -1? Do we have a generic "greater/less than" snippet?

MegaTom

A generic snippet will almost certainly be an extension to a "lest than 0" or something like that.

just add ([{}]{}) to the start.

My shortest grater than or equal to 0 yet: brain-flak.tryitonline.net/…

DJMcMayhem

Wow, 0 bytes! :P

MegaTom

Fixed the link above.

MegaTom

17:27

nevermind... bad code

MegaTom

17:40

This is correct: brain-flak.tryitonline.net/…

Wheat Wizard

How does it work?

Ok I figured it out

MegaTom

It works by magic!

6 hours later…

MegaTom

23:25

A: Code Golf Golf Golf

Brain-Flak, 1626 1938 bytes (<()>)<>((()()()()()){}){({}[()]<((((((()()()()()){})){}{}()){}){})((()()()()()){}){({}[()]<(((((()()){}){}){}){})>)}{}((((((()()()()()){})){}{}()){}){})((()()()()()){})>)}{}((((()()){}){}){}()){({}[()]<({}<>)<>>)}{}{}{}(((((()()()()()){})){}{}()){})((((((()()()()()){...