« first day (4185 days earlier)      last day (955 days later) » 

01:00
Sandbox posts last active a week ago: Next digit of rational number [codegolf] [string]
 
6 hours later…
07:23
@Neil week.golf/challenge.php?id=1, click the light bulb, click the language logo to switch to Python, then click "Solution №1", it will shrink, then click it again and it will show you the code
... I don't see a light bulb. I see a header, a title, a description, an area to test and submit a solution, a leaderboard, and a footer
@Neil It's only on last weeks challenges
???
I call this the pxeger theme
Based
Looks better than the green IMHO
07:31
Okay. userstyle:
#bulb_content, #time > div.vertical-align, #run, #delete_code, #reset_code{
  background-color: #fc774d !important;
}
#green {
  color: #fc774d !important;
}
Currently only works on that page, will try and make one that works globally
I've been trying to shorten my python solution there for days but I keep changing everything but miraculously ending up at exactly the same length
07:51
08:43
@pxeger yeah I couldn't be bothered to create an account
@Neil You can log in with your SO account
I don't know why you should have to tbh
^
It's as a userscript but you can copy the css in the middle if you want a userstyl
TY
Looks great on the graph page too
Went through all the pages, although I might've missed some
08:52
Dots are still green but that's not a big deal
Might be able to change that
The only thing I haven't figured out how to change is the upvote image, although that actually might be possible with some JS
You need .a_point{background-color for the dots
@emanresuA CSS hue filter?
Huh, that's a thing?
@mousetail Ah, missed that because I hadn't done anything so there was nothing
Also, does this person know that canvases exist? That's such an impractical way to do it lol
CSS filter is the way to go yes, but hue isn't the right one since the icon is white
08:55
I mean when it's green
@emanresuA You can't as easily add click and hover effects to canvases
I guess :P
I always use SVG for graphs
Divs works too but it's hard to get to behave consistently between browsers. Canvas looks bad when zoomed in or you need to write a lot of code to fix the resolution. Plus the click and hover effects thing
Good point :P
Anyone else agree that more than one language a month should be added to week.golf?
08:59
yes
add as many languages as you can
Updated the gist
^^
No, there will be too many languages too quickly
artificially limiting it may be fun but seems very pointless
@mousetail how is that a problem?
The site is most fun if there are multiple people competing in a single language
More languages=less people per langauge
People can use more than one language
If Zsh gets added, that doesn't mean I'll stop golfing in Python
09:01
Yes, but most people do only 2 or 3
I disagree - seeing everyone answering in a single language makes me feel like I've missed the opportunity to use that language
^^^, and we just want to golf in specific langs
Also ^^
Like I see all the answers in python and think "well, that's already been golfed to oblivion, no point trying that language"
I think they could use a few more languages, but if they hope to stay interesting long term limiting the number is key
09:03
Maybe 5 new languages a month?
Also:
in Vyxal, 7 hours ago, by emanresu A
Honestly I dislike the challenges.
in Vyxal, 7 hours ago, by emanresu A
They're all chameleon challenges and they'd recieve a bunch of downvotes here
in Vyxal, 7 hours ago, by lyxal
Also I bet SBCS languages will be scored as utf-8 instead of SBCS
in Vyxal, 7 hours ago, by emanresu A
Perhaps we should just leave this alone. I'm not sure this is a place we want to be.
@emanresuA This is the problem with "golfing servers" (also like code.golf and golf.shinh.org) as opposed to fora like ours. In order to work in the system, all programs have to use the same IO method, which means way too many bytes wasted on reading STDIN or whatever
it's just not fun
And so far they've all been bizarre two-in-one problems for no good reason
Ulam numbers alone would be fine, but then applying it n times is, IMO, a worthless addition
Agreed
in Vyxal, 7 hours ago, by Unrelated String
yeah honestly i would try not to do anything that prolongs the life of that site
@pxeger I think there's probably a way to do it well, although highly configurable I/O comes with the annoyance of having to configure it
Even if you don't want the site to live long you have to understand the author probably has different intentions
09:30
@pxeger Honestly, I don't even think I/O is the problem. The real problem is that the challenge writing isn't freely open to all
That's a really smart perspective that I never thought about
Writing a challenge is just as much, if not more, fun as answering one. Any site that prevents its users from doing that is fundamentally flawed
Also, tfw I use fricking root access and an operation's still not permitted???
also "operation not permitted" (EPERM) normally means a technical limitation, not exactly a permissions thing (which would be "permission denied" (EACCESS))
@Zionmyceliaadamancy Especially as it isn't hard to add some kind of wrapper when adding a language, so that I/O is done in that language's most natural way. It isn't perfect, but it works most of the time
10:18
Opinions on this as a 5-bit codepage:
abcdefghijklmnopqrstuvwxyz012.-'
10:30
I'd advise just assigning stuff as you go
Everything's gonna be either 10 or 15 bits, so I don't think I can really do that
Wait what
Is this for newspeak or something else?
only digraphs and trigraphs, no single glyphs
this is something else
I want to do a 10 bit language but can't be bothered to make a 1024 character codepage
You're gonna have to implement 1024 elements
and by splitting it into 5 bit chunks, you get 25% shorter "digraphs" (by using trigraphs instead of quadgraphs)
@emanresuA I think I'll manage :)
10:33
That's four times a SBCS golflang
And even those take months-years
Well we'll see
Good luck, and I'll see you in 2026.
hgl has well of 1024 elements already.
that's exactly what made me think 1024 was feasible
Yeah, but you have space for all of that
10:34
also things like MATL
actually I think MATL doesn't have quite that many but still
I mean obviously there's a bit of a difference because hgl has so much space that there's basically no filter. If something could possibly be helpful might as well add it.
Although something I realized more and more is that my time with hgl is a finite resource.
and now I think about it I'll probably have a few single-char elements (only 5 bits) so it might be only like 900
@WheatWizard Wait what?
but I won't need to finish all 1024 to get started
@emanresuA The time you can spend developing it is finite
@emanresuA It takes time to add things to hgl, so it's worth considering if adding certain things are worth my time.
Or rather it's worth trying to figure out what the most valuable holes are right now and work on filling those first.
10:51
@emanresuA the owner of week.golf has said that SBCS will be used for languages that have them
That's good
I keep thinking about various langs but all of them are based on pure functional programming and I need to write a runner for that anyway ;_;
Like what ideas?
Hello! Is there a reason most golfing languages (that I'm aware of) use single byte characters, instead of ones with a variable amount of bits? Some builtins are a lot more commons then others, so it would make sense to have those be shorter, and you can just split the final program to bytes
a 2d lang on a hexagonal grid with semantics somewhat close to flobnar or cascade, for example
11:03
@CommandMaster my upcoming golfing language has that. It's also probably useless :P
@emanresuA The language, or having shorter-then-byte characters?
Having shorter-than-byte chars
Although there's also a human-readable encoding
@emanresuA Why? Because usually you don't use enough common characters to get 8 bits?
That, and because I don't want to implement a full SBCS golflang
Hey guys is anyone here spamming account creation on week.golf? Because someone is creating a whole bunch of troll accounts for some reason
If it is anyone here, don't. It's really unfunny and doesn't accomplish much
11:09
@CommandMaster A lot of them do have two byte commands. fwiw until recently it was extremely difficult to get a fractional byte count, so 9 bit commands would usually cost just as much as 16 bit commands.
Yes, I'm aware. What had changed recently?
Yeah, the fractional byte meta was only recently experimented with once fractional byte counts were ruled valid
You used to have to round byte counts iirc
But now you can go as far as having irrational byte counts
Worse, you had to have an encoding that fitted into full bytes
Or build a computer that actually used fractional bytes? The old consensus was honestly not super clear.
Arguably the new consensus and the old consensus are the same thing said with different emphasis.
@CommandMaster I think it's because it's hard: both an inconvenient encoding to implement, and more importantly, very hard to know which builtins warrant which bit encodings.
11:21
Seems pretty easy. Copy commands from a existing language then scrape existing programs to know which are most common
but if you give a builtin a longer encoding, it won't be used much because it's not golfy, which will make you think it deserves a longer encoding, even if it doesn't
it's a complex self-referential optimisation game
That's why you copy a existing language
So there's plenty of data that can't be poluted
One thing I want to do is collect a corpus of Jelly answers and unleash a NN compression algo on them. It could be very useful in telling what sort of atom combinations are most useful.
and also, variable-encoding languages are hard to use because you can't immediately tell what program is going to be shorter just by looking at it
Need a dedicated editor that changes the physical width of a character depending on it's bit size
Maybe a font could do that
11:23
@pxeger You could have the atoms be variable width but the characters be fixed width.
I mean, ultimately, you could write plain ones and zeroes, which would directly correspond to the lengths of the builtins
I guess you could do it by using elements as "words", where the number of chars in the word corresponds to the bit length. Is that what you meant @WheatWizard
I once thought of an idea for a symbolic encoding for a language where every command is a word of up to 7 letters, and you separate words with tabs so they all have the same visual width
that's kind of the opposite
@pxeger I decided it wasn't that useful, especially because of string literals
It might be interesting for a 2D language.
Since those really care about alignment.
it would be a pretty wonky 2D language though; everything would be much wider than it is tall
11:27
Make every word a 7x7 block
make a programming language out of lego
That would be cool
And impractical
I want to make a programming language where the character width is variable as determined by the thue morse sequence.
Impractical languages are the most fun
11:29
@emanresuA not much more impractical than scratch, and people use that
Make a language like Cascade, but with gravity
For a lego lang all blocks would be different sizes which would limit how you can attach them together in 3d
you could use the shape of the blocks as a type system
In a normal language you can write the same function and put it anywhere in a file. However in this language it needs to align with the grain of the file to fit so functions cannot simply be translated around.
Yes
In lego there are also a few special blocks that allow half-stud offsets that would be interesting in a language
11:34
to make a lego-like language more practical, you could do it more like a typical 2D language but with polyominoes instead of individual chars
Lego should be 3d at least, 2d would defeat the point
but 3d would be a massive pain
I was thinking about a language where you can get the value of any node in the AST, even results in the future
@emanresuA On the activity page disabled buttons are still orange
12:18
CMC: given a string, return the same string but with the second character removed
abcdeb -> acdeb
input will always be at least length 2
@pxeger lambda x:x[0]+x[2:] (19 byes)
@pxeger ʒN≠
2d lego reminds me of a game called Junkbot
@pxeger f(a:_:b)=a:b
@WheatWizard What language is this?
12:28
Haskell
Also Curry
@pxeger vyxal: 1⋎
also i change list syntax to (1 2 3(3 4 5))
13:01
0
A: Sandbox for Proposed Challenges

pxegerInfinite Fibonacci word code-golf sequence fibonacci string The famous Fibonacci sequence of integers is defined as follows: \$ F_0 = 0 \\ F_1 = 1 \\ F_n = F_{n-1} + F_{n-2} \$ But what if we use this same recurrence relation to produce an infinite sequence of strings? Instead of addition, we'll ...

13:25
I am 65 minutes too early and my internet connection is E :/
I feel like being in the void would've been less boring
65 minutes to what?
and the void?
y'all I need context here
> y'all
this is your brain on American English
I have some appointment in 64 minutes
you start using y'all when you're talking to only one person
@pxeger bold of y'all to assume I was only asking one person
13:27
^
@mathcat hang on, a minute ago you said 65, and now it's 64?! Get your story straight!
weird, it's in 63 minutes now
guis I think time changes
no, I don't think it do
well what do the time does Australia now?
23:31:59
dammit I'm being rate limited
13:32
wait a sec
that's the time
it's Now o'clock
and that clock is always correct
NameError: name 'x' is not defined
Why is Rick 11?
@pxeger yeah because you don't have the prelude for the clock
13:33
wow lyxal just proved time is constant
Rick is 56
@mousetail *10
bold of you to assume my clock has 12 items
I've seen a similar meme clock where all the math expressions actually refer to the time at that position. This is defiantly not that.
It doesn't seem very defiant to me. It's just a clock.
I can't spelll
13:35
me niether
I just type random gibberish then use a AI trained to make it look like a sentence
> One word in this sentence is misspelled
okay so maybe I lied
it's not now o'clock
it's raze time
@pxeger woah that's clever
@lyxal it ain't loading for me
I still have 65 minutes, I can wait
Hang on, it's back to 65 now??
13:37
yup
we just went back in time
Time is constant again now, right?
What is the countdown for?
11 mins ago, by mathcat
I have some appointment in 64 minutes
ok same
@mathcat which void?
there's a whole bunch of voids I can think of
so you need to be a little more specific
13:41
The void where 0 divided by 0 is a complex number.
fair enough
@Adám How does this work? Im isn't 90 degrees of from Re
No, but in APL 11○X is Im(x)
"[...] 0 divided by 0 is a complex number"
lyxal: fair enough
quotation power
 
2 hours later…
15:27
@emanresuA Funnily enough I have a userstyle that does the opposite: turns pxeger's orange pfp into green :p
Sacrilege!
More useful if you include "y'all" since that's the main way it's spelled
16:06
Only works for me after focusing the search bar and hitting enter
Same
weird bug?
@WheatWizard @AncientSwordRage Can you give chat.stackexchange.com/users/538234/user110569 explicit write access to chat.stackexchange.com/rooms/52405/the-apl-orchard?
yay finally wifi!
how was your appointment
were you appointed?
16:18
were what was it you
16:36
@pxeger Charcoal, 4 bytes: ΦS⊖κ
16:56
@Neil osok
17:06
@PyGamer0 PHSTHK, rather
17:28
should i make it simpler by using one universal character (of their choice), or is the variety of chars (to make the arrow look like an actual pointing arrow) good?
17:46
It's a very vague description. I wouldn't even call it a specification.
18:06
CMQ: Favorite way of handling EOF in brainfuck?
The variant I prefer is all input is nonnegative, and EOF is -1.
@pxeger unfortunately the appointment is 3 days long
 
2 hours later…
20:44
Imagine two robots on the number line. If you choose a robot it goes forward one step with prob 0.5 and backwards one step with prob 0.5. You want to get either one of the robots to the point 10 with minimum total cost. The cost is the sum of the square of the number of steps each robot has taken.
how do you best play the game?
CMQ The question just above
21:32
@mathcat i hope it's not a disappointment
21:44
no, seems fun
att
att
22:33
@graffe it doesn't matter how you play, expected cost is infinite
@att How?
It seems like the expected cost would be 0
Since the behavior of the robot is symmetrical, its expected value can't be weighted toward negative or positive
att
att
cost 0 only occurs at the start when neither robot has moved
@graffe where do they start?
Ohh expected cost yeah
I misread that nvm
att
att
expected cost is infinite everywhere except 10
22:36
@graffe Probably move whichever is closest to 10, regardless of cost
easily :P
that's what i was thinking too but it seems like it should be possible for moving the farther one to be better
why does it seem that way
because to me it does not seem that way :3
since if the closer one has been dancing back and forward for 10000 moves the cost of moving it one more time might be more than trying the other one for a while
22:38
because that's how probability works right
Moving either bot, no matter its history, costs the same amount
Since it's the sum of both bots' costs that matters
> The cost is the sum of the square of the number of steps each robot has taken
Oh
I can read normally I promise :|
it's confusing wording
robot1steps^2 + robot2steps^2 ?
22:39
ye
i assume so at least lmao
ah, in that case i can imagine it making a difference yeah
some sort of like
movement budget / quota before you switch bots
move bot A X times and if it doesnt make Y steps in that time or whatever, switch bots
(but better)
I guess the solution would be to minimize (moves_so_far + expected_number_of_turns_to_reach_10) ** 2 - moves_so_far ** 2
I don't know what distribution expected_number_of_turns_to_reach_10 would be though
Oh it's like att said, the expected number of turns to reach any spot is infinite
So that makes me think the optimal solution would just be to do it however you want and it'll be equal
might be some way to meaningfully compare strategies though
like maybe does one's chance at any given number of steps of having succeeded asymptotically dominate the other
att
att
i'd probably pick whichever one has the cheapest straight path to 10
so if you win you win hard
so whichever one has minimal (distance+2*steps)*steps
even if i know the expected cost is infinite this still "feels better"
22:56
Since we're dealing with infinite expected cost stuff here, using a simulation to see what's optimal in practice won't work too well
But it could be interesting to try
@NoHaxJustRadvylf Actually, the expected cost is finite
I'm pretty sure it is
With a single robot, it will eventually reach 10 with probably 1
Sure, but the number of tries it'll take is on average infinitely many
att
att
I can write up a proof if you want
22:58
Just like how you'll always eventually flip a heads, but doubling your reward on tails still gives you infinite expected value
att
att
that it's infinite
is this for a koth :)
att
att
this is kinda ugly without latex
I've been debating making/installing a chat MathJax userscript for a while now. On the one hand it'd be useful, but on the other hand it's more annoying for mobile users and people who can't/don't want to install one
on the other hand: userscript that undoes monospace formatting back to being backtics
23:40
Thank you for this. I assumed the expected amount of steps would be a bit smaller. — ubershmekel Aug 31, 2015 at 4:45
huh, comments onebox too? nice
you could say that he expected the amount of steps to be finite

« first day (4185 days earlier)      last day (955 days later) »