« first day (2568 days earlier)      last day (2275 days later) » 

12:10 AM
@PhiNotPi Do it.
 
Kinda sad that it is called White-Hat Hacking rather then White-Hatking
@DJMcMayhem add it and just link the commit version that it should work for
I will keep my changes until the next major version off of git
I always feel so happy when I type Pain-Flak into TIO and see my creation come up :)
@Dennis I broke TIO locally, I want to tell you what I did but it will kinda ruin a CnR answer, you willing to not crack my answer if I tell you the bug? Or do you want to wait.
 
12:36 AM
@Christopher Well, if you have other features you want to add (or remove even) I'd love to include those in the challenge
 
@DJMcMayhem let me think
 
@Christopher I'm not sure I understand. If you tell me here, will everybody be able to crack it or just me?
@Pavel Briefly. I didn't understand it very well.
 
@Dennis anyone who knows what does it could crack it
 
@Christopher You could tell Dennis over the TIO gitter. Literally no one looks there.
 
I was going to email him over the TIO email
 
12:40 AM
@Christopher Does this bug have anything to do with intercepting SIGINT or with reading from .output.tio, by any chance? That covers the two TIO borks that I know of.
 
nope
 
@Christopher Sure, email works. I won't use it to crack your answer.
 
@Dennis Thanks!
I sent the email saying what i did
 
I need to know what it is now ;-;
 
Crack my answer and I will tell you
 
12:54 AM
@Christopher Eh, haven't even looked at the challenge yet
 
Whose fault is that?
 
@Christopher OK, thanks. Should arrive in a while.
 
@Dennis :P If you can't get the bug to show again I can send the code I was using when I did the bork
 
Why does everyone know the 2 languages i use :|
 
12:58 AM
@Pavel o_O
 
@DJMcMayhem my code
 
@Christopher Because I hang out in talk.tryitonline.net far too much, and know about every language request. It was beyond obvious though.
 
I did brain-flak before
 
@Pavel Why is the URL mirrored?
 
@Christopher Which I would have tried if Pain-Flak didn't work. TIO doesn't have all that many flaks.
 
12:58 AM
@Dennis rtl
 
Ah.
 
@Dennis I accidentally pasted the code first, and didn't delete it completely before replacing it with the url
 
@Christopher Are you on Gitter? We could start a private chat there, instead of being all mysterious here.
 
@Dennis he cracked my answer
 
@Dennis It's been cracked, no point.
Actually, H. PWiz cracked it officially.
 
1:00 AM
Basically when adding in a RTL override to the very beginning of the code the entire TIO tab crashed. Refreshing the page kept it crashed
@Dennis ^
 
I think if you have a challenge where you need to guess what language something is, don't post a jumbled mess of brackets and expect it to stay safe
 
Yeah very hard to hide
 
@Christopher Assuming that there's one in your submition, given that I just sent you a TIO link to it,
 
especially since I talk about *-flak
@Pavel no different code that time
 
@Christopher No repro.
 
1:02 AM
@Christopher Browser?
 
Chrome
Huh
 
Yeah, norepro
 
Can't get it to work either
 
Anyhow, if it survived a reload, it's probably a Chrome problem, not a TIO problem.
 
Reload didn't fix it
 
1:57 AM
PSA: Please upvote, this is really interesting and comes from a not-very-active user
 
2:08 AM
0
Q: ABAA/ABBB: Generate this recursive 2D pattern

PhiNotPiI was messing around with infinite resistor networks (long story) when I came across the following interesting recursive pattern: |-|| |--- Each instance of this pattern is twice as wide as it is tall. To go from one level of the pattern to the next, you break up this rectangle into two sub-bl...

 
@MDXF Does 5.6k rep and 210 answers really count as not very active? :P
 
@Dennis Yeah, they've got alot of rep and answers, but it's really rather infrequent
 
Just posted my 3rd challenge in 3 days.
IMO not as good as the first two.
It was just something I had in the sandbox.
Also, the bot was super-fast. (only a couple seconds)
 
@PhiNotPi love how you were inactive for like a year and then posted GoL Tetris and are now completely active again
 
2:15 AM
hah
 
@MDXF They're number 24 in rep this year and have a language on TIO. ¯\_(ツ)_/¯
 
¯\_(ツ)_/¯
 
@MDXF @Dennis Alright, s/not-very-active/typical
 
Anyway, a user's activity level should in no way influence how you vote for their posts.
 
It was just a side note
Regardless of the user it's a great answer
 
2:17 AM
@Dennis At that point you would never be voted for :P
 
@MDXF I coasted on the GoL Tetris wave for a long time.
 
some say they're still riding the wave
 
Still get an upvote at least every other day from it.
 
Totallyhuman it shocks me how much more rep you have then me at this point :P
 
activity
 
2:20 AM
yeah
and you use jelly judgement
 
Mr. Xcoder and neutrino used to have close to the same amount of rep as me
Now xcoder's like climbing the stairsreally fast
@Christopher ...i don't?
 
@totallyhuman thought you did lol
 
I have like one jelly answer
 
Anyone have any tips on how to implement multiple IP's in a 2d esolang? (In C, without fork())
 
NVM I have a fair amount
 
2:23 AM
@MDXF Some sort of queue?
 
7 jelly answers
 
@PhiNotPi Like an array/stack of IPs, then loop through them during execution?
 
Basically yeah. Take the top IP (represented by like its coordinate pair or something), execute it, and then shove it to the bottom.
 
Yeah, seems to be the easiest to implement
 
If you use a linked data structure (or really anything other than a fixed-length array) you can have the program create/destroy IPs throughout execution.
 
2:26 AM
hey don't shove ip's :|
 
Program terminates when the queue is empty (all IPs have been destroyed)
 
Or just a generous maximum limit of IPs, fixed-length array, and then an integer to specify how many are used
 
Sure
 
@PhiNotPi yeah that's what I was thinking, a command to destroy the current IP
Then the program quits when there are none left
 
0
Q: Wanna See a Card Trick? (Part I)

WallyWestAmazingly, this is the easier of the three card tricks I know off the top of my head... The aim of this is to have your compiler perform a specific card trick. There's no slight of hand, and the compiler won't be memorizing the choice and saying "Voila, this is your card!" The code will basicall...

 
2:27 AM
0
A: Sandbox for Proposed Challenges

ChristopherFibbiprime is fibbdivine Given a positive integer N that is > 0 return the Nth fibbiprime number. Fibbiprime A fibbiprime number is created by multiplying the first N prime numbers together. However because 2 and 3 are primes that do not conform to most mathematical prime rules they are NOT in...

 
@DJMcMayhem bug in brain-flak
@lt doesn't work
 
@NewMainPosts this challenge has the old non-observable requirements
> The chosen card is drawn correctly at the end providing you have the array/stack manipulations worked out. Please do not simply assign the chosen card into a variable and pull it out in the end... This will be regarded as an invalid answer.
 
Sad video of the day: the last recorded bird call of an extinct species.
Another bird call to cheer you up, courtesy of the lyrebird: youtube.com/watch?v=WA0tP-p7m40
 
2:43 AM
@Christopher You're gonna need to be more specific than that :P
 
@DJMcMayhem I see you're using a recursive algorithm thingy in your new brainflak algorithm
 
Yep
 
I did that with Sad-flak, though a little bit differently
anyway, one of the minor optimisation things i did was remove all () nilads and replace it with a count of how many there were, so that it wouldn't go over them multiple times
especially in some restricted source i imagine that would have some impact
I think i also included the [] monad if it only contained () nilads? i vaguely recall something like that
the interpreter for Sad-flak is not as bad as for Turtlèd or whatever if you wanna check it out. or at least i don't remember it being that bad
I also used lists instead of objects
now that i think about it, maybe i could have made those into tuples
actually looking at the code I take that back. I'm not sure i can actually read it
 
@DJMcMayhem ( @lt5 ) doesn't push 5
 
yes it seems i did put the optimization of the [] monad with only () nilads or a [] monad following the conditions just set forth here...
 
2:53 AM
Can someone give me a rundown on the history of Brain-Flack?
 
DJ created it
THen WW made variants
I made one
and that is about it
It is sadistic
 
@DJMcMayhem you should put that minor optimisation in i guess
 
@Christopher HJ
@PhiNotPi there's not a C if I remember correctly
 
@Zacharý no he is wheat wizard again
 
@Zacharý Yeah
I was curious because I saw it when it first came out (and even worked on an optimizer for some challenge), but it seems like it's been under development a long time for what I thought was a simple language.
 
2:57 AM
It really is not under dev but we just make more kinds
 
Anonymous
@PhiNotPi Brain-Flak is basically the new brainfuck - someone made a minimalistic tarpit esolang, and then everybody started making derivatives/variants
 
and also, different compilers i guess
@Mego not really. these languages aren't exactly equivalent
 
Anonymous
And by everybody I mean mostly WW, with some contributions by Christopher and Lemon
 
as a large amount of bf derivatives are
 
Hey but the variants are better
 
Anonymous
3:00 AM
The main difference is, whereas most bf derivatives add things to bf, most Brain-Flak derivatives subtract things (like Mini-Flak) or intentionally make it harder to use (like Pain-Flak)
 
Yeah
 
some of them don't add anything though (bf derivatives)
My brain-flak derivative has different control flow
 
o
o no
@DJMcMayhem I am so sorry, I have created a monster idea (cc @WheatWizard)
if i can get it working you will fear the name Christopher
I am already scared of my new language idea
 
we need the details
 
Lost+Brain-flak... Lost-Flak
 
3:03 AM
hmmm I am intrigued
I imagine an easier in terms of implementation and design might be lost + sad-flak
because you just get it to pick a random line rather than a random character
especially so you don't have to try and figure out what happens when you enter in the middle of brackets
@Christopher please give any ideas you have for this
 
@DestructibleLemon You could also have a 50/50 chance of starting at the end of the line, and running through it backwards
 
why isn't writing.se in life / arts
@Οurous to be honest, i feel like that might just be piling on
 
Anonymous
@Οurous Better: error if the program's reverse does not yield the same result
 
@DestructibleLemon That's an odd place to draw the line :P
 
it's distinct from the main purpose of the language
do we have 2d brainflak?
 
3:19 AM
@DestructibleLemon so ideas are that starts from random location, have some sense of control flow, if it starts and the end of the line it runs backward (the ENTIRE program)
Idk about the last one though
 
ok but what if it starts on a ] or something
 
magic
nothing it just skips right or somthin
idk sounds hard
again beta idea
perhaps 2d brain-flak
that is amazing
imma do that
@DJMcMayhem @WheatWizard get ready, sometime soon i will have a 2d brain-flak ready
 
i would be curious as to how the recursion in that works
do brackets make the ip turn left, perhaps?
no, conditional turning will be needed
 
3:41 AM
I made an iso projection thing and it is working so far i think or something
it's not actually in a really usable state, but i mean, it's got the bare bones and it does not crash
 
4:00 AM
hmm, I am having a problem with it at the moment, a problem which could possibly be made into a ppcg challenge
it's a painting order issue
 
@WheatWizard bug in Unbalanced: loops are executed one more time than the spec indicates.
The cause of this bug seems to be that the "outside" function in your interpreter returns both the inside and the outside of the loop.
 
4:16 AM
Just remembered (one hour too late) to lock the Best Of. Stupid DST.
 
Anonymous
@Dennis Shame on you. Go sit in the corner and think about what you've done /s
 
does anyone have any tips on redefining python comparator operators for sorting?
 
@DestructibleLemon Why not just give a sort argument instead?
 
@Nitrodon Yeah I noticed that. I've been working on fixing it.
I needed to let my answer get cracked first
 
because sort works by comparing the values with comparator operators, which optionally has a key, but that key will just return a different value to be compared
the context in which they are compared is a bit important
but while that is the case, it is transitive though, I'm pretty sure
 
Anonymous
4:23 AM
@DestructibleLemon Back in Python 2, you used to be able to provide a cmp kwarg that would take two arguments and return one of [-1, 0, 1] (for <, ==, >).
 
Anonymous
I think there's a cmp_to_key function floating around somewhere in the stdlib
 
I need to compare whether two cylinders position on the xz plane overlap at all, as part of the comparator
which will not work without changing the comparators
 
@Dennis So... what happens now? Is there a post anouncing the winners, or something like that?
 
Anonymous
We'll also need a chatroom for organizing the distribution of bounties
 
@Pavel I think we simply created a chat room and sorted out which bounty would be placed by whom. Martin used to handle the Best Of.
 
Anonymous
4:26 AM
Dibs on Best Explanation bounty again :P
 
the idea for the sorter is that when an object that overlaps another object on the xz plane, the higher one gets painted later, otherwise the closest forward one gets painted later
or uh, not the highest one, it might be the lowest one depending on the angle
 
5:10 AM
Is it just me, or do people not explain their code as much as they used to?
My guess is that, when people first started coming up with all these golfing languages, they felt the need to explain how their language worked. But now that those languages are literally everywhere, they've stopped bothering.
Maybe that and the rise of TIO.
 
CMP: Who uses the original TIO client, and who uses Downgoat's?
 
@EsolangingFruit Original. You may consider Downgoat's prettier, but it lacks a lot of features.
 
@ATaco is ataco generator open source i would like to contribute
@Pavel ಠ_ಠ
 
@Downgoat What do you use?
 
I don't use TIO too often but generally I use whichever I have an open tab of
 
5:17 AM
link to downgoat's version?
 
Ninja'd :(
 
@Pavel stop use http
#httpsmasterrace
 
5:18 AM
@Downgoat Please set up redirect
 
@Pavel i did but nginx seems to hang on all http reqs
didn't happen with apache
though it doesn't happen with my other sites which use same config like climatego.org seems to work without https
 
@Mego I'm promoting startpoint on HN btw: news.ycombinator.com/item?id=16338047
@Downgoat 0/10 can't pagedown for scrolling, and two scrollbars are ugly
 
@Pavel that is chrome fault
also partially my fault because i am too busy to maintain
but goats cannot be at fault, good luck prosecuting a goat
 
@Downgoat Still doesn't have a favicon btw
 
@Downgoat Ataco generator?
 
5:33 AM
@ATaco mathjax to pic
also 10/10 for responsive
 
The code isn't open source, but I can release it.
Blame stack exchange for only just notifying me.
 
@ATaco that would be great, I'd like to add some things like browser history and buttons
 
6:16 AM
My first Element answer in a long time: codegolf.stackexchange.com/a/155322/2867
 
 
2 hours later…
8:17 AM
2
Q: Orient the Rubik's Cube

Kevin CruijssenIntroduction: I collect twisty puzzles, so I'm quite the fan of rubiks-cube-challenges (even though most are fairly difficult). So, let's try a fairly easy rubiks-cube-challenge for a change. When an NxNxN Cube gets scrambled during a WCA (World Cubing Association) competition, the cube is alwa...

 
 
2 hours later…
10:12 AM
Any final feedback on this? Planning to post it today.
 
10:26 AM
@Mr.Xcoder May we return a matrix of matrices?
 
Sure.
I will clarify.
@Adám Is it clearer now?
 
@Mr.Xcoder Yes. (Personally, I just omit mention of I/O formats, as I allow any reasonable formats as long as they follow consensuses.)
@Mr.Xcoder Nice.
 
Thank you.
 
@Mr.Xcoder I'm just adding your test cases now, then I'm ready to post.
 
Heh you have already written an answer (in APL/J/QuadR/QuadS/Stencil/whatever I suppose?)
 
10:40 AM
@Mr.Xcoder APL. Let's hope people upvote non-trivial answers too.
 
Wait APL has a built-in / near built-in?
 
@Mr.Xcoder Yes. ⊢⌺ is a near built-in.
 
@Adám I think this challenge will serve as a reference for people who try to solve other sub-matrix related challenges. Therefore, I chose to specify the I/O formats clearly.
 
@Mr.Xcoder Not an issue at all, which is why I parenthesised that. I was just telling you.
 
Sure
And I explained why I added them this time :)
Hm, this problem over on Brilliant (I have no affiliation whatsoever with this site) would make up for a good challenge. (The sequence part)
Why does the Sandbox have 5 rep instead of 1?
 
thx
 
You need 5 rep to ask on meta
 
> mini-edit to gain enough rep to participate on meta; don't mind me ~Doorknob
Ninja'd
 
11:18 AM
Tis 1 rep now but it wasn't at the time
 
11:32 AM
0
A: Sandbox for Proposed Challenges

Luke StevensRemove duplicates from a String Inspired by this unassuming StackOverflow question. The idea is simple; given a String and an array of Strings, remove any instances of words in the array from the input String other than the first, along with any additional whitespace this may leave. The words m...

 
11:43 AM
@PhiNotPi I can't speak for the actions of others, but if you ever see a post of mine that I have not fully explained, please ping me about it, and I'll fix it asap.
 
@PhiNotPi I've noticed that too. I try to explain every answer I post, but I see more and more answers without explanation (which is sad)
 
@PhiNotPi I guess I've noticed that too. But at the same time, I haven't seen anyone ask for explainations as much either.
 
@mınxomaτ lol the comments are gold.
 
Now I'm having a introspection crisis about whether I need to explain my answers more, and how to tell what parts or answers need explaining.
 
12:07 PM
I usually explain my answers, especially those that aren't trivial. But if I post a trivial answer, chances are, I won't bother to explain it. I probably won't add an explanation either if I'm just golfing a reference implementation
 
12:59 PM
@Arnauld I'll keep it deleted for a moment. Currently at work, so I don't have a Rubik's Cube with me. It's hard to visualize the rotations.. Will fix and undelete it tonight. Again, sorry for the trouble that website caused..
 
0
A: Sandbox for Proposed Challenges

ZgarbLocal periods of strings code-golf string Local periods Take a non-empty string, for example s = "abaabbab". The local period of s at index i is the smallest positive integer n such that for each 0 ≤ k < n, we have s[i+k] = s[i-n+k] whenever both sides are defined. Alternatively, it is the m...

 
Anonymous
1:18 PM
@KevinCruijssen I should buy a Rubik's cube. Got a good suggestion for a cube that doesn't suck and is reasonably cheap?
 
@Mego Cubes from ShengShou are fairly cheap, but still good. Other good brands include QiYi, MoYu, Dayan, and probably a few others
 
Anonymous
@NieDzejkob $5 USD isn't bad at all. Thanks!
 
if you're buying it from ebay, make sure that a specific model is mentioned in the description, and that it does not say "unbranded" in the details table while mentioning a brand in the title
 
Anonymous
I was going to buy it directly from the ShengShou site
 
I don't think such a site exists...
 
Anonymous
1:28 PM
Err, the speedcube site
 
Anonymous
My morning coffee is still kicking in :P
 
I don't think ShengShou has any way to even contact them at all
@Adám I don't think just ⊢⌺ is enough to answer that challenge :-D
 
@EriktheOutgolfer I don't think so either, but it solves the essence of the problem. You just have to specify the sub-matrix size and remove the shards.
 
@Adám ...which isn't as easy as it seems at first
oh you answered
 
0
Q: Generate all square sub-matrices of a given size

Mr. XcoderYou will be given a square matrix of integers M and another positive integer n, strictly smaller than the size of M. Your task is to generate all square sub-matrices of M of size n. For the purposes of this challenge, a square sub-matrix is a group of adjacent rows and columns contained in M. ...

 
1:36 PM
Morning.
 
@Mego MoYu MF3RS2 is about 5 USD and a great Cube. Not sure about shipping, but at zcube.hk/Moyu-333-MF3RS2?search=mf3 it's only 5.28 USD (and even less when you use the coupon code "sale" for -23%)
 
@Adám There's a typo in your answer header template. For the hover-text for SBCS you have "charater" instead of "character."
 
@Mego If you don't want to wait about 3-4 weeks because this webshop is in Hong Kong, you can also buy it in the US-based webshop SpeedCubeShop for 8 USD + shipping: speedcubeshop.com/search?type=product&q=mf3rs2
 
@NewMainPosts Jelly, 8 bytes.
 
@Mego @NieDzejkob MoYu (and all their subbrands) are usually favorited by the cubing community. DaYan is outdated these days (last speedcube released was a couple years ago). QiYi isn't too bad, though.
 
1:42 PM
@Adám outgolfed :D
 
@user202729 Why don’t you post it?
 
Anonymous
@KevinCruijssen Thanks for all the great info. I'm not too concerned about shipping time (I won't even be buying one for a few weeks), so I'll just buy from the HK shop.
 
@Mego Oh, Cubezz.com is even cheaper I now notice. 5.55 USD and free worldwide shipping :) cubezz.com/…
 
Anonymous
Excellent :)
 
Anonymous
I'll try to remember that in a week or two
 
Anonymous
1:47 PM
I love that I can ask for a recommendation for just about anything here, and there's at least one expert :)
6
 
Posted.
 
@Mego You're welcome. :) "I love that I can ask for a recommendation for just about anything here, and there's at least one expert :)" True. XD
 
Because the solution seems highly redundant... I was trying to find a solution with more unique characters.
 
I accidentally made the snippet display each answer (no. of cracked answers) times, and I'm wondering why it feels slow
 
Wṡ€ẎZ€ṡ€ẎZ€ takes 11 bytes. Trying to do Wðṡ€ẎZ€µ⁺ is both longer and not working. Wµṡ€⁴ẎZ€µ⁺ works and is even longer.
 
1:50 PM
@user202729 I have 6 bytes
You can take it
 
... should I brute force all length-5 with ⁴Ƥ, , Z, to see which one works?
 
@NewMainPosts Does the output have to be 3D rather than 4D?
 
@user202729 I don’t think thers is any 5-byter.
@Neil Yes, of course it must be 3D. Why would it be 4D?
 
and Dennis posts one
 
@NewMainPosts +6 sandbox, +2 Main ;-(
 
2:03 PM
why can't it be 4D?
 
@Mr.Xcoder It's "naturally" 4D. You need to flatten it.
 
Wait, what?
 
@Mr.Xcoder bleh, that invalidates both mine and @Adám's answers
 
What??
I’m very, very confused.
 
4D is 2D matrix + 1D for each submatrix in the same row + 1D for each row
 
2:05 PM
A sub-matrix is a 2D array, right? I am asking for an array of submatrices, so a 3D array. How can it naturally be 4D?
 
But the natural arrangement of those submatrices are 2D.
 
Wait a bit
Okay, I’ll allow 4D. Output can be a singleton list btw
The 05ab1e solution can save 3 bytes if I allow this
Not sure what I should do
 
(so much for the sandbox...)
 
@mınxomaτ Even let's you get past the pages without the "proceed anyway" button iirc
 
I honestly didn’t think that people might ask if 4 D is allowed, shrug. Gtg
 
2:09 PM
(known problem with codegolf, just like the voting culture)
 
and it's really hard to do 3D in APL
 
@Neil well, the sandbox is bad for finding things that a golfed submission would require, as that would give a FGITW advantage
 
@user202729 @EriktheOutgolfer @Neil I allowed 4D now.
 
I'm trying to manually brute force the possibilities. With pen and paper.
 
... I think you’re wasting your time brute-forcing.
 
2:58 PM
@Mr.Xcoder No you didn't, you allowed it while it was still in sandbox:
5 hours ago, by Adám
@Mr.Xcoder May we return a matrix of matrices?
5 hours ago, by Mr. Xcoder
Sure.
 

« first day (2568 days earlier)      last day (2275 days later) »