« first day (4611 days earlier)      last day (526 days later) » 

00:00
@lyxal see also Banana-golf
neither of those claim to win golf now do they
@lyxal i believe banana-golf was originally meant to be a serious contender
@noodleman yeah but it doesn't literally claim to "Win Golf" quite like "Win Golf" does :p
@lyxal mine does
I mean, the tagline is even "Win Golf is a language made by SnakeyKing and is created to help people win coding golfs."
00:03
it's surely the only language with a builtin to output "Banana! Num num num num num!"
@noodleman false
@lyxal MetaGolfScript or whathaveyou probably does too
also false
well i'm stumped
00:07
Vyxal 3 :p
output_banana_num_num_num_num_num!
#q prints Banana! Num num num num num! to stdout
genius reference
in Vyxal, 1 min ago, by Vyxal Bot
Lyxal pushed a commit to Vyxal/version-3 in Vyxal/Vyxal: apologies in advance
actually added it just now
CMC: given n>0, print Banana! Num num num num num! with n nums (including the first capitalized one)
00:11
@thejonymyster Ruby, 30 bytes: ->n{"Banana! Num#{" num"*n}!"}
oops bug
Ruby, 34 bytes: ->n{"Banana! Num#{" num"*(n-1)}!"} hotfix
damn, 4 bytes shorter than identical approach in js
n=>`Banana! Num${' num'.repeat(n-1)}!`
(idk how chat formatting works, no attempt was made to circumvent it)
there's a challenge about escaping code for chat
its kind of a meme lol
oh that works ok
needs the !
00:14
@ATaco must have trailing exclamation point
very formal
i'm a formal kinda guy :p
Oh HEC
@noodleman no, you're noodle man
i will end you
nice
the equivalent ruby is a couple bytes longer
input in decimal, unary is actually not much shorter, if at all, for this challenge
incredible
speaking of those backtics...
oops
lol
00:24
ts is definitely one of the funnier code golf langs
indeed
i'm actually in the process of writing a programming language in TypeScript's type system
@thejonymyster not ts, but ts's type system
do keep us posted
@noodleman right sorry i keep forgetting since its such a ridiculous thing to say
might as well be "typescript's type script"
the ts of ts
well ts is just a wrapper around javascript with a funky type system on top
00:26
right
i wish more people would try golfing in it, it's pretty fun once you figure out a couple tricks
i might make a tutorial at some point
@thejonymyster a surprisingly painful jelly, 21 bytes: ’“ num”ẋ“¡ƙ¶×ỵJÞʠ»;”!
it's much more approachable for a lot of problems than say brainfuck
jelly cannot into strings
love that sentence
@noodleman or even APL to a lot of people including me, honestly
00:28
@UnrelatedString hehe
honestly ts type system is kinda free upvotes :p
you don't have to golf well for it to be impressive
i've gotten pretty good at golfing it but just getting a working submission is enough for a lot of people, especially since it can be hard to tell when a solution is golfable or not from an "outsiders perspective"
Unlike jelly, vyxal can into strings
wow no #q even
that's vyxal 3
this is vyxal 2
whos on vyxal 1st
00:33
probably nobody
@thejonymyster Well yeah because a) that's in version 3, b) it's temporarily removed because it gave a compiler error (too powerful) and c) #q is a fixed string
@thejonymyster maybe like one or two answers on the site
no, probably nobody's on vyxal zeroeth!
did vyxal have a 0.x?
@noodleman might be one
@noodleman all the way to 0.9.x
i was going into the who's on first schtick but yes
speaking from that outsider perspective when i hear type system golfing i assume, like, you need to create multiple custom slightly different types of peano numbers to be able to title case a string
00:36
actually Ts types has a builtin for capitalize lol
lmaooooooooooooo
i have no idea why they added it but yeah
@lyxal god, I wish Jelly had good string handling
Jelling
00:38
bing jelling
(ok i'm pretty sure my joke was so dumb it didn't register, i was going for that one john cena clip where he's eating ice cream)
@noodleman nah that was instant recognition
@lyxal I golféd a byte
and somehow it still vyncodes poorly
@lyxal now try adding a different byte to see if it'll vyncode better :p
the compressed strings contain infrequently used byte patterns so ofc it's gonna be same byte count or more :p
00:54
kinda wanna try it with japt's compression now
01:05
i remembered to escape the backslash this time lol
mmm unprintables :p
that's what japt gets for using iso-8859-1
oh here's a japt trick that just came to mind that's really weird and only comes in handy in certain situations (not this): japt transpiles code like mc to .m("c"), because it treats that string as a function, but you can abuse this to get 2-character strings for 1 byte less. x"ab" can be reduced to xbia which becomes x("a".i("b")) (i is for insert, default position 0)
now that's an FCCF gonna try my best to make this goofy acronym take off
Friday Courtroom Cancellation Fiasco?
yesterday, by The Empty String Photographer
FCCF (Fun Cursed Code Fact): In Python, you can type annotate a variable with any object, not just a type object, meaning a : 3 = 3 is valid Python code.
fire charizard chars fiend
First Come Cirst Ferved
01:20
frick crick crikey frick
are you the australian one in this chatroom? i don't remember
that would be me
there's also ATaco
and JoKing
you people say crikey right?
oops o/
that would be us
i undo my o/ for i have returned
fried chicken for christmas
wait wrong order
for christmas, chicken fried
01:38
@lyxal 13
wow I really don't know my own language
 
5 hours later…
06:43
CMC: Given an float, return the first integer multiple of it. 2.5 -> 5.
hypothetical golflang, literate mode: double while % 1
just to be clear, is the answer to 1/3 = 0.010101010101...01 not 1 but 10101010101...01?
(in binary)
uh do i have to handle float weirdness
ive never seen a float fail at adding before now
oh right
can we assume the input float is normal (not nan/inf/denormal)?
thats fair but what i meant is in my current sol, 2.5 works but 2.3 gives 9637 because apparently 16.1+2.3=18.400000000000002 and it all goes downhill from there
oh, that wouldn't work
06:56
evidently but
cmaaaaan
for posterity i was trying this f=(n,m=n)=>n%1?f(n+m,m):n which i like the shape of
that's what you get if you add two floats of different exponent
ah
oh ignore the log
managed to remove it in time lol i was trying to figure out what was going wrong
ok this should work then f=(n,m=1)=>n*m%1?f(n,m+1):n*m (seems to in my few tests)
 
3 hours later…
09:33
nice
0
A: Golf you a quine for great good!

thejonymysterHeadascii, 4182 bytes +OU++++++++OU+++++++OU+++++++++OU+OU+OU+OU+OU+OU+++++++++++++OU++++OU++++OU++++OU++++OU+++++++++++++OU++++OU++++OU+++++++++++++OU++OU+++OU+++++++++OU+++++++++++++++++++OU+++++OU++++OU++++OU++++++++++++++OU++++++++++OU+OU+OU+OU+OU+OU+OU++++++++++OU++++++OU++++OU+OU+OU+OU+++++...

I'm sooooo good at golfing guys check out this sweet sweet quine very #short
 
1 hour later…
11:01
can’t tell if it’s beautiful or horrific
i’m gonna go with both
11:13
@thejonymyster Indeed, ou.
11:38
OU moment
 
2 hours later…
13:12
Not sure that this is ever useful but desmos lets you differentiate with respect to pi — \frac{d}{d\pi} \pi^2 for example
0
A: Sandbox for Proposed Challenges

UndoneStudiosDigits of Infinity In this PDF, https://www.vixra.org outlines a way to find the last \$ n \$1 digits of infinity and a method to do so. Let us define the infinity sequence2, taking the function \$ f \$. \$ f_1 = 2^2 \$ \$ f_n = 2^{f_{n-1}}\$ Starting from \$ f_3 \$, the last \$ n - 2 \$ digits a...

@SandboxPosts what
 
1 hour later…
14:26
heyyy
welcome back!
:)
does anyone know the link to the question "scanner" thing? (i dont remember the name of it)
oh right the query
I remember someone sending a link for questions that don't have an answer in a speciifc language yet
15:17
hey @cairdcoinheringaahing, do mods have a method of figuring out a network user's chat account?
or chat parent, for that matter?
15:34
hehe i just realized im still ste as on strike on this site :P
@mathscat it used to be better, there was a long string of (OU)RPs i ended up golfing / correcting
0
Q: Sokobunny I (Sokoban, but the boxes are sentient)

ToAskOrNotToAskSokobunny 1 You love buns! You love them so much, that you chased one down a bunburrow. The burrows are like mazes, and YOU WANT TO CATCH THE FLUFFBALLS!!!! However, the buns are smart! You can't catch the bun by by chasing after it, as you wait out of politeness for the buns. Taken from the game...

16:03
@Ginger nvm, figured it out :D
16:25
@Bubbler That's very close to what it would be in FunStack, if FunStack supported floats: Last Double Mod 2 while
(the difference being that while returns a list of results and stops before the first one that fails the condition, so the stop condition has to be divisibility by 2 and then we take the last element of the result list)
oh i forgot about fun stack! ive been out a while, hows that going?
It's not :D I haven't been working on programming languages much lately
ok fair lol, hope whatever youre up to has been fulfilling nonetheless :P
:)
I've accepted that I have too many interests to do all of them all the time, and my interests go in irregular cycles. So I'll be back to language development at some point.
I think that's a healthy approach
Don't do things you find fun so excessively that they stop being fun
16:37
yea basically same deal here, im just now cycling around to cg again lol
 
1 hour later…
18:04
CMC give code to solve ibb.co/7WTp657
(I don't know got to paste an image here)
theres rydwolfs paste to upload but never worked for me
If anyone can paste it that would be great
oh wait it just worked
how
Can you paste my image?
18:21
Thanks!
@Simd Easiest way is to paste to discord then copy the link here
@mousetail oh wow
(or use the paste to upload script)
Now we just need code :)
18:48
@thejonymyster I wrote a more detailed explanation of how everything works: github.com/mousetail/penrose/blob/master/readme.md
19:19
@DialFrost hello hello
 
1 hour later…
20:27
@Seggan If you reinstalled it recently, Bbrk made a PR that improved compatibility IIRC
20:40
Ah
 
1 hour later…
21:43
Yeah, and it was literally just a single structuredClone call
22:18
@mousetail thank you! reading now
...im already confused by the first few sentences. How does this count as deconstructing into a smaller rhomb if the smaller rhombs dont even fully fit in the larger rhomb?
Yeah I definitely would appreciate a visualization of what the ABCDE pieces are but
22:33
0
Q: Find the smallest integer multiple of a Decimal

ATacoThe Challenge Given a rational number, determine the smallest number which is a positive integer multiple of it. Eg. Given: 1.25 x1: 1.25 x2: 2.5 x3: 3.75 x4: 5 Thus: Answer is 5 Clarifications Inputs will be a rational number in the range of (0,100] of which the Decimal Representat...

> (0,100]
Darn it, foiled my plan to answer with 0 :P
23:05
@Seggan D
yeah i can confirm that
23:25
@Simd looks like a good challenge for main
23:39
ooh just 4 upvotes away from being in the top 50 code golfers of all time

« first day (4611 days earlier)      last day (526 days later) »