The Nineteenth Byte - 2022-02-17 (page 1 of 3)

« first day (4037 days earlier) ← previous day next day → last day (810 days later) »

12:37 AM

0

Q: FOREST OF NUMBERS:

FOREST OF NUMBERS: (Bosque de Números) PROBLEM: by Jaime Poniachik and Ivan Skvarca Start with an infinite square grid. Each cell has eight neighbors. Place the numbers 1, 2, ..., n anywhere. Now place the numbers n+1, n+2, ..., m in order, subject to the rule that when you place k, the sum of it...

number code-challenge sequence grid

@l4m2 use a private window to suggest the edit anonymously? (doesn't work on all SE sites though)

OldSandboxPosts

1:00 AM

Sandbox posts last active a week ago: Output up to n sets of n characters randomly

CMC: Determine if a number is base 2 heavy. It is base 2 heavy if it has more than n digits of the same digit at one end.

@BgilMidol I think this would make a good challenge.

2 hours later…

2:38 AM

ello

anyone think this is ok?

0

A: Sandbox for Proposed Challenges

Knights jam The knight is a chess piece that, when placed on the o-marked square, can move to any of the x-marked squares (as long as they are inside the board): .x.x. x...x ..o.. x...x .x.x. Eight knights, numbered from 1 to 8, have been placed on a 3×3 board, leaving one single square empty .....

3:24 AM

0

A: Sandbox for Proposed Challenges

Golf the colors of a rug code-golf kolmogorov-complexity Background The challenge is based on this rug: Its colors seem very regular, but the pattern isn't obvious. This bugged me for about a year, but I finally figured out the pattern. Your challenge is to find the pattern and use it to output ...

3:50 AM

@RadvylfPrograms the links to risky aren't actually broken

github.com/RedwolfPrograms/risky redirects to the right place

Only the github pages links have been broken

redwolfprograms.github.io/risky doesn't th

ninjad

Challenge idea: Output n with ratio probability of 1/3^n

So the chances of outputting 1, 2, 3 etc are proportional to 1, 9, 27

Also, RIP xiogi's inbox

I spent a few seconds trying to work out who you were talking about

@emanresuA so basically [n for n in range(yes) if random.randint(3**n) == 1]?

I'm not sure if it's even possible tbh

Wait actually no, it should be

0 { 1+ : 3$e ℅ 3<[,Q should do the trick

4:20 AM

Wait no it doesn't

4:38 AM

gasps SO hasn't had a question in the last minute

5:25 AM

2 minutes of screaming done

3 minutes to go

Update: 3 minutes and 9 seconds done

2 minutes and 51 seconds to go

LMAOOOO

nice @lyxal

should i post knights jaM

0

A: Sandbox for Proposed Challenges

Knights jam The knight is a chess piece that, when placed on the o-marked square, can move to any of the x-marked squares (as long as they are inside the board): .x.x. x...x ..o.. x...x .x.x. Eight knights, numbered from 1 to 8, have been placed on a 3×3 board, leaving one single square empty .....

anyone pls answer thx

6:18 AM

@pxeger whats whython

6:54 AM

Anyone recognise this code:

import itertools as I
S=sorted
P=I.product
def C(n,m,k):
 Q=[((-1,)*(n-m)+(0,)*m,)]
 for i in' '*(k-1):Q=set(tuple(S(q+(v,)))for q in Q for v in P(*[(-1,0,1)]*n)if sum(map(abs,v))==n-m if not v in q and any(sum((a!=b)*(1+2*a*b)for a,b in zip(v,u))==2for u in q))
 return sum(all(S(q)<=S(zip(*r))for X in I.permutations(zip(*q))for r in P(*((p,tuple(-x for x in p)) for p in X)))for q in Q)
{}

Because it's the only Vyxal answer on the site according to my sucky corpus

7:11 AM

It... looks like one of my old answers?

Nvm I was using the wrong SQL query lol

lol

caird coinheringaahing

@RadvylfPrograms I think mainly just the timings and the sound, but I can't really remember

7:36 AM

0

A: Sandbox for Proposed Challenges

Sorted string filter Input a list of strings a and a string s for search keyword. Find out all strings in a which contains s as subsequence. And sort them in the following order: Exact equals to s Starts with s Contains s as substring (continuous subsequence) Contains s as subsequence When two ...

@DialFrost looks good

it looks hard at first

8:00 AM

im back

@DialFrost pxeger made a mod of python

@lyxal my sad response was also sarcasm

its called whython

I'm sorry the post-irony is too much

Are you planning to add anything more to whython?

well I still have to finish adding function composition

8:02 AM

I accidently presolve knights jam before it’s posted because i was too bored

@pxeger What's that?

so ima not rush post answer

@pxeger whython idea: add a bloated standard library

and i only have the math cycle, not the golfed program

@emanresuA see:

8:04 AM

That's cool and cursed

>>> f = lambda x: x * 2
>>> g = lambda x: x * 11
>>> h = f[g]
>>> h(4)
88

why is it f[g] and not f.g o_O

g[f] would do the same thing in this context right?

@emanresuA yeah, I realised this isn't the best example

>>> f = lambda x: x + 2
>>> g = lambda x: x * 11
>>> h = f[g]
>>> h(4)
46

So f[g] applies g then f? That's slightly confusing

8:05 AM

@PyGamer0 because the f.g syntax is basically impossible to implement, because it's already used for attributes

@emanresuA f[g[identity]] = x => f(g(x))

it's the same visual order as normal function composition

Oh okay, that makes more sense

@emanresuA not confusing to me

@pxeger very cool

that should be in python along with x->x+1 lambda syntax of coconut (what was it called?)

@emanresuA anyway, the behaviour is customisable!

>>> import sys
>>> sys.y_compose = lambda f, g: print("compose", f, g)
>>> f[g]
compose <function <lambda> at 0x7f7f1a86c1b0> <function <lambda> at 0x7f7f1a86c260>

Should that be in sys or ctypes or something?

@pxeger lmao

8:07 AM

@emanresuA it is in sys

Okay

@Adám is that JS?!

SE chat search now seems to be returning only results before 2016

Yeah

And I can't even find that message I usually use in this situation

elo

8:14 AM

18

A: Possible bug preventing chat room message search

My apologies. This was an oversight on my part. I was doing maintenance on the search cluster and didn't realize that chat didn't automatically rebuild its search indices, like our other applications do. In the past, some kind person must have been coming behind me to fix these missing indices. I...

@pxeger status-reproduced

> The index builds starting with the oldest data, so it will take some time before the most recent information returns to the results.

Dec 16 '21 at 2:02, by emanresu A

Chat never worked, so they never have to fix it

@PyGamer0 Yes.

guys can i post knight jam?

8:15 AM

@pxeger oh

Except this time, they're actually fixing it

Can anyone help me find this question? Map each element of the input to how many times it has occured thus far. E.g. "Hello" -> { 1 1 1 2 1 }

There are a couple sort of like that but nothing I can remember where the only task is that

@Adám python gives 0 and False

0

Q: Knights Jam | Chess

The knight is a chess piece that, when placed on the o-marked square, can move to any of the x-marked squares (as long as they are inside the board): .x.x. x...x ..o.. x...x .x.x. Eight knights, numbered from 1 to 8, have been placed on a 3×3 board, leaving one single square empty .. They can ne...

code-golf string matrix chess

8:22 AM

posted ^

I know you're meant to leave sandboxed posts for a few days, but this got +5 so I'm posting it

ye @emanresuA its a rly gd challenge

@emanresuA I think it's worth explicitly clarifying whether "increasing" means strictly or non-strictly

non-strictly

ye

8:24 AM

also, you say "you can assume the input will be increasing", but one of the test cases is [3, 9, 2, 5, 1]

Oops, my bad. Forgot to fix the falsy testcases when I changed that

And I'm making it positive integers only, because negative doesn't really add much and some langs will find it a lot harder.

0

Q: Is it a fibonacci-like sequence?

The Fibonacci Sequence is a sequence of positive integers where the first two elements are 1 and the rest are the sum of the previous two. It begins \$1, 1, 2, 3, 5, 8, 13\$ and continues forever. But what if you started with numbers other than \$1, 1\$? You could start with \$3, 4\$ and have the...

code-golf decision-problem integer subsequence

???

1 view 3 upvotes

nice @emanresuA

yo @pxeger chill u posted in like 50 seconds lmao

wow @emanresuA u have so many upvotes

(i have 1 only) sad:(

@DialFrost uh it looks like you have 0 when i checked

8:41 AM

bruh

somone downvoted

sigh

@DialFrost rip, it happens

is my challenge this bad

emanresu's challenge got 7 upvotes within the first 5mins

mine got 0

What is going on today? The moment someone (including me) posts an answer to @emanresuA challenge, it is upvoted immediately.

suspicious

ye

idk, some posts have 2 upvotes, some have 1

8:43 AM

@ophact I get a notification :P

oh, so you just upvote every answer

nice

yeah thanks for that :D

@DialFrost your question is good, but very simple once simplified

???

first part is to check validity

if you use a specific way to turn that 3x3 into a flat list, it will always be the same list

i am not gonna spoil it

8:46 AM

@Niko ok dont spoil any more, i havent figured it out yet

??? im confused wdym

@Niko good

@AidenChow oofs sorry

wdym flat list and it will always be the same list

@DialFrost you can analyze it and turn it into a very simple question

8:47 AM

@DialFrost idk, maybe there is a certain way you flatten the list that helps simplify the problem

@chunes +/∘.=⍨ in APL.

idk also lol

my solution is 258 bytes long

@DialFrost what language

python

@pxeger I have 39 bytes to my challenge in Whython

8:49 AM

i think i can do <100 byte in python if perfectly golfed

@Niko for the knight problem right?

WAT HOW NIKO

@AidenChow yea

do you guys brute force through it?

@chunes And once you have the APL solution, you can translate it to some inferior language like JS: [..."Hello"].map((e,i,s)=>s.map(o=>e==o).reduce((a,b)=>a+b))

:| still not seeing it, maybe i have to make my own test cases to see the pattern

8:51 AM

@Adám did you say "inferior"?

@emanresuA Whython, 39 bytes: f=lambda n:n[0]+n[1]-n[2]or f(n[1:])?[]

@pxeger exactly what I had lol

@ophact Yes, surely JS is inferior to APL for this task.

@Niko i havent even begun constructing an answer yet, still trying to see the trick

@Niko i got 211 now

8:52 AM

@Adám okay, maybe for this task.

@AidenChow same

@ophact And for a lot of other tasks.

my approach may not be the shortest tho, but it don’t need to do any simulation

what do you mean "it v"

ipad typing strikes again

@Niko dang how do you find the # of moves without simulating it, thats wild

8:55 AM

I think I have begun to see the trick

@ophact please dont spoil it, thanks

never said I would

just making sure

bad news, i can’t where i write those things down

@Niko write what??

9:00 AM

CMQ: Is Jelly stack-based?

No, it's tacit

the simplified thingys of the question

@Niko so you forgot the trick????????

@WheatWizard Hi. Can you give chat.stackexchange.com/users/540556/user17921685 write access to chat.stackexchange.com/rooms/52405/the-apl-orchard?

@Adám It's similar to stack-based languages in having fixed-arity links, which most tacit langs don't have

9:01 AM

no i did not forget

just need to rewrite it again

i am lazy :p

@emanresuA Do we have any authoritative source I can use to back up a claim that Jelly isn't stack-based?

@Adám its parser is stack-based

@Adám github.com/DennisMitchell/jellylanguage/search?q=stack

@pxeger Aren't (almost?) all parsers stack-based at some level?

Pretty much yeah

@pxeger Cute :-)

9:02 AM

true

@Adám (Aside from a 2d lang parser I have)

i find it :D

@Niko cool!

i just realized, once someone else find the trick and post an answer using it, then everyone will know it

yea

i want to post an answer, but i don’t have access to computer and is at school

@AidenChow if I do, I'll hide it behind a spoiler.

9:06 AM

@ophact yeah thats a good idea

wait just out of curiosity what is the current LYAL

look to the right

@AidenChow dc

and it's yesterday's, because LYaL is supposed to happen on Wednesdays UTC

Is it? It's thursday

nvm

> every second Wednesday [...] and lasting for 24 hours, from 00:00UTC to 23:59UTC.

sigh im getting no upvotessssssss

9:17 AM

wait for a while is the only advice I can give

oh, there you go, an upvote

not mine

yeah you usually need to wait a little bit for ppl to view ur question and upvote it

i have 1999 rep

bruh

caird coinheringaahing

@Adám it's parsing is stack based

...I should read the full transcript before replying :P

lol

Anyone know how I can access class variables in "static" methods in Python? ato.pxeger.com/…

@DialFrost can I input as a string? ([123,456,78.] -> 12345678.)?

9:26 AM

@pxeger C.x should work

ato.pxeger.com/…

@AidenChow no, because helper is called during the construction of C

er

yes

yes?

okay, thanks

caird coinheringaahing

@pxeger ato.pxeger.com/…

The problem is that it relies on the name of the class being fixed, which isn't always the case. Change the name, and you have to change all the static references

@cairdcoinheringaahing huh so C.x does work

caird coinheringaahing

9:31 AM

60

A: How can static method access class variable in Python?

You can access it as InviteManager.INVITE_MESSAGE, but a cleaner solution is to change the static method to a class method: @classmethod @missing_input_not_allowed def invite(cls, email): return cls.INVITE_MESSAGE (Or, if your code is really as simple as it looks, you can replace the whole...

im confused now, pxeger says it doesnt work but its showing here it works???

caird coinheringaahing

Either way: it's the wrong way to go about it

YES 2K REP LESGOOO

@DialFrost congrats!

dang youve only been a member for 2 months, already at 2k rep

@DialFrost gg gamer

9:33 AM

:\

@AidenChow They ask too many questions.

that sounds like something out of a movie

"they ask too many questions."

ive been a member for 1 yr 7 months, still at 1.6k rep

sad

cuz u nvr post often

@DialFrost yeah, i never get any good challenge ideas, thats why

i have posted quite a bit of answers though

Ahh, my code for the chess challenge refuses to work!

9:44 AM

haha

@ophact syntax problem or is it that your trick isnt working

o/

@AidenChow my trick works. However, my eval gets stuck in an infinite loop

i think ophact got it

Sorta.

mine still doesn't know when to give up

9:54 AM

check any one of the number is at right spot

maybe?

for me, i turn the space to the right spot and then check one’s position

YES!

it works for the ones that are possible

now, time to account for the impossible.

10:12 AM

LOL

it works now, just it's way too long

JS, 313 bytes

holy

yay now i can access suggested edits in the queue

i need 3k to access the rest

done

@AncientSwordRage Can I bother you to give chat.stackexchange.com/users/540556/user17921685 write access to chat.stackexchange.com/rooms/52405/the-apl-orchard?

10:33 AM

anyone wanna check this? codegolf.meta.stackexchange.com/questions/2140/…

IMO the challenge would be much more interesting if we were allowed to use other pieces to block the check.

AncientSwordRage

@Adám ~~mischief managed~~ antics accomplished

Is Brainfuck still Turing complete if ]s can only appear at the end?

AncientSwordRage

@DialFrost I sort of didn't appreciate your edit to my question just now (I've rolled it back)

> Input criteria is flexible, and just taking the inputs in as a and b or as a list of two numbers is fine

^thats mostly true, and I've clarified that, but also it's up to the OP to word that in normally

10:49 AM

@l4m2 I think it isn't, because that condition means that only the innermost loop can ever repeat.

OK make sense

oh

sry @AncientSwordRage

my bad

@AncientSwordRage is that a harry Potter reference?

AncientSwordRage

@PyGamer0 shhhhh (yes)

@DialFrost it's cool, I appreciate the intention

sry lol

11:05 AM

@AncientSwordRage i invented a spell: runprogam accumulato summation over x where x is [1,2,3,4]

lol

anyone can take a look at codegolf.meta.stackexchange.com/questions/2140/…

AncientSwordRage

Harry potter spells and parseltongue would be rich sources for esolangs

@DialFrost I Iike it

thx @AncientSwordRage u have any feedback to improve it?

> IMO the challenge would be much more interesting if we were allowed to use other pieces to block the check.

AncientSwordRage

@DialFrost that sounds like it would require me thinking....

11:13 AM

"IMO the challenge would be much more interesting if we were allowed to use other pieces to block the check"- PLEASE NO that would make it insanely hard

we already have insanely hard challenges

but your choice.

still..

i didnt want to overcomplicate this

plus it would introduce a lot more rules to the challenge

and im js a student, im not vry free so sry :/

AncientSwordRage

@DialFrost I misread as "and I'm a JS student, I'm not very sorry, so free"

4

😁

@AncientSwordRage lmaoooooo how the heck did u misinterpret the msg by that much

if yall have any feedback for "chess analyzer", pls tell me so i can edit the post thx

or u can also say if u think there arent any errors

AncientSwordRage

@DialFrost willful ignorance/perpetual lack of caffeine ?

4

11:26 AM

? wdym

@DialFrost because you golf your english, we don't.

6

ah

> we dont

wdym

AncientSwordRage

@PyGamer0 IYKWIMAITYD

11:28 AM

₹_₹

haha

@PyGamer0 That was also a "golf".

since when i golf my english

i nvr do tat

IYKWIMAITYD -> I you know what I must ask if tungsten yeets down

confusion lvl 1billion

11:30 AM

@DialFrost since te bgng of tm

although yes i do use slang

which is NOT THE SAME AS "GOLF"

yes u do indd use slng

sigh

lol it's quite funny.

i somehow can understand u

except for bgng

11:31 AM

ys, bc u r accstmd to doing so, whrs im not

@DialFrost "beginning"

oh

wth are yall saying

im acstmd to it?? says the persn whos golfing his own el

that was intentional

speaking in Dialfrost lang

11:32 AM

but now I no longer golf my English.

I remember a CMC from a long time ago that called for users to "golf their sentences".

"Long time ago" meaning a few months ago, of course. ;)

@AncientSwordRage hmm the latter :P

u no lngr golf ur el? thats sad

×_₹

@DialFrost ill strt glfn my eng

@AncientSwordRage so u think "chess anylazer" is good? (and like no errors or need for imprvmnt?

@PyGamer0 no its "il strt glfn my el"

erm did i accidentally set off a glfn eng trend

no you didnt

orh

orh -> my fav slang

11:45 AM

0

A: Sandbox for Proposed Challenges

Golf my english! Inspired by random messages in TNB Task Given input as a string which is an english sentence, golf that sentence. A word consists of letters abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ separated by other characters including spaces. Remove any vowels in words that are g...

^ lmao

AncientSwordRage

@DialFrost I didn't look

@SandboxPosts I think 'remove all vowels and lowercase' isn't too tricky, right?

"inspired by random messages in TNb"

woi

where's my credit

lmao

@PyGamer0 i need credit for starting this trend :P

@AncientSwordRage u didnt look at it how u like it then? :)

Thnk u @DialFrost fr ths xclnt chlnge

@AncientSwordRage yeah it isnt, ill have to think of something to make it interesting

11:55 AM

@PyGamer0 i need credittttt :)

jst a smll qstion, how wld u glf "oops"?

lol ths is rly fun

ps

snds wrd

$ ps

u cant golf oops

cuz ops makes no sense

ps makes no sense either

11:57 AM

yh ik u hv a vry cmplx systm to glf ur eng

i js rm ltrs lft and rgt

hpfly u can undrstd me?

yes sir

caird coinheringaahing

Ok, lets try to keep things somewhat understandable :P

ok gd ide

yeah i know you have a very complex system to golf ur englsh

« first day (4037 days earlier) ← previous day next day → last day (810 days later) »

Transcript for

Feb '2217

The Nineteenth Byte

The Nineteenth Byte: General discussion for codegolf.stackexc...

join this room
about this room

00:00

06:00

12:00

18:00

all times are UTC

site design / logo © 2024 Stack Exchange Inc; legal

mobile