User:PkmnQ/Golf/Code

See User:PkmnQ/Golf.

1+

Truth-machine

.1#[#"":#]

Looping counter

11+11##11+""*+""*+;\"#11+"""**+;11#

Kolakoski sequence

(|1\":##[#1](.|11+\":##[#11+]()))

A trivial golf of the the 35-byter on the Kolakoski sequence page.

A+B

..+:11+"""**+;

1+ has numeric I/O. 'Nuff said.

23

Hello, world!

17,13,72,101,108,108,111,44,32,119,111,114,108,100,33,10

Looping counter

30,7,16,10,27,0,0,16,42,27,6

96

Hello, world!

72,10:1,[@8,
^@1,44,32,@9,@1,@4,|@8,@0,33,@"

Truth-machine

48?|+[)"]

Looping counter

42:[,.10"@]

A+B

10,?@?&@,48[a:,`,&b[~|^,];a:,\@-+];b_10"

96 has decimal output with the $ command...but the number is given a trailing space.

Quine

,52 ,52 ,91 ,34 ,97 ,43 ,35 ,45 ,43 ,58 ,36 ,98 ,93 ,59 ,64 ,97 ,64 ,34 ,98 ,b44["a+#-+:$b];@a@"bb

bitch

Hello, world!

#72/^45/^9//^3/^67/^12/^87/^24/^29/^30/^8/^69/^43/

I have one idea I want to try, but I have to find an implementation that uses unbounded integers first.

Truth-machine

\>|48/&1;<

No comment.

BLC8

Truth-machine

11 55 55 60 82 08 20 82 08 36 46 81 6E 76 60 C0

(breakdown to be added later)

Looping counter

14 68 19 76 10 59 C1 B3 A0 59 78 20 C2 CF 83 70 0A 2A

(breakdown to be added later) The reason why I use 0A 2A here instead of 2A 0A is because I was fiddling around with the program while trying to figure out why it didn't work. Eventually I found out it was a \r\n vs. \n issue. I had a version with 2A 0A that was the exact same length, but I couldn't be bothered to reconstruct it.

Brain-Flak

Truth-machine

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

Looping counter

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

A+B

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

This program is yucky. It is probably possible to save bytes with better stack management (I think this program uses the second stack more than it really needs to). I just haven't fully learned the ways of Brain-Flak yet.

brainfuck

Looping counter

++++++++++[>--[>+<++++++]>-[.<<]>>[>>]<<]

While I was looking at the program after pasting it in, I realized I could shave off a bit:

++++++++++[>>--[<+>++++++]<-[.<]>[>]<]

Here, tape cells are adjacent rather than spaced 2 apart. Not sure how I didn't notice this earlier. Now it's shorter than the program on the Looping counter page (38 < 39).

Kolakoski sequence

-[>+<-----]>--.+.[.<-[>-<-----]>++[[>]+[<]>-]>[>]+[<]-[>+<-----]>---.<-[>-<-----]>++[[>]++[<]>-]>[>]++[<]-[>+<-----]>---]

The main thing making this program long is the fact that the main section is repeated twice, with small modifications to make one append 1's and the other to append 2's.

Quine

See original golf page for link. This program was made in ~2021-2022 as part of a larger list of quines I used to maintain, so it's very much ungolfed. The main part of the length comes from the fact that the data is stored as literal ASCII values. It also seems I was afraid of falling off the left edge of the tape, as it outputs some unnecessary >'s at the beginning.