The Nineteenth Byte

« first day (4604 days earlier) ← previous day next day → last day (536 days later) »

OldSandboxPosts

01:00

Sandbox posts last active a week ago: Pseudo-Quantum Bogosort, Efficiently solve quadratic equations when 1+1=0

3 hours later…

lyxαl

03:44

@noodleman the corruption is coming into full force! :p

lyxαl

03:54

y'all ever just create an object in a method in an if statement, forget to return it, have return null; after the if statement, go to scroll to another function and then realise "oh hey wait I should probably return that"?

or is that just a lyxal moment(tm)?

hyper-neutrino

04:10

well I am not sure if I've done that exact thing but I'm sure I've done both similar and worse :P

Simd

04:27

CMC write code that takes in a positive integer n and outputs the same as itertools.product(range(4), repeat=n)

lyxαl

@Simd Vyxal, 20 bits2, 2.5 bytes: 3ÞẊ (vyncoded)

Unrelated String

jelly 3?

lyxαl

where Jelly version 2?

@UnrelatedString also, vyxal 3 (work in progress)

3 hours later…

l4m2

07:21

What's the smallest proven n s.t. BB(n)>TREE(3)?

MTN

@Simd Python, 54 bytes: lambda n:product(*[range(4)]*n);from itertools import*

Simd

08:10

@MTN I meant without using itertools

@lyxαl does this effectively use itertools?

@UnrelatedString bonkers :)

mousetail

Why don't you like itertools?

lyxαl

08:21

@Simd maybe maybe not

I don't remember how it's implemented under the hood

Not that you'd be able to use it in python anyway without importing itertools for the other things it's used for :p

Bubbler

kinda not golfed, 66 bytes: lambda n:[[i//4**j%4 for j in range(n)][::-1]for i in range(4**n)]

math scat

this

lyxαl

That's only for default list objects

If you give it a lazylist, it does it without itertools

So depends on what you give it. And given that a ranges are converted to LLs, it's using the non itertools definition

mousetail

f=lambda n:n and[[*j,i]for i in range(4)for j in f(n-1)]or[[]] should work

Adám

@Simd Are we allowed to return a multi-dimensional array or must it be a simple list?

@Simd APL, 5 bytes: ,⍳4⍴⎕ Try it online! — remove , if returning a multi-dimensional array is OK.

Simd

08:32

@mousetail I know how to do it with itertools so it's not interesting to me

@Bubbler nice!

@Adám a simple list

@mousetail cool

mousetail

The recursive version is 3 bytes shorter than Bubbler's modular arithmetic based one

math scat

08:47

CMC: Output all legal moves at the start of a chess game (white) using default notation. kolmogorov-complexity

thejonymyster

damn thats good i came here to post a cmc but that one is already neat

is there anywhere we can find a list of such moves so we dont have to do the research ourselves :P

math scat

It's basically pawn moves a2-h2 and 4 knight moves.

thejonymyster

ah right

@mathscat Regenerate, 18 bytes: [a-h][34]|N[acfh]3

math scat

09:05

cool lang

thejonymyster

right? i love regenerate :D

3 hours later…

Ginger

12:18

@l4m2 sir this is a Wendy's

you may want to ask in Math.SE instead :p

math scat

@l4m2 looks like there is no upper bound

Ginger

12:51

anyone here used numpy? I'd like to know how performant something is

specifically, flattening a 3d array of bytes and converting it to a list

math scat

pretty sure numpy has several flatten built-ins, so I believe it's good for the job.

lyxαl

performant, you goofy.

math scat

ah me goofy

ditch python use c

lyxαl

@mathscat Vyxal, 1 byte: ¤

Ginger

@mathscat no

lyxαl

12:56

the king can't move and isn't in check so it's stalemate, meaning there's no valid moves

Ginger

C might actually be the worst possible lang for what I'm trying to do

the numpy thing is only a small part of it, but I'd like to make sure it doesn't take stupidly long

since this flatten-and-listify operation will be called a lot and I'd like to know whether I should run it in a worker or not to avoid blocking the main loop

math scat

@lyxαl playing 4d chess while I'm still wondering how that knight thing moves.

lyxαl

@Ginger stackoverflow.com/a/23540029/9363594 could be of interest

and all DDG results say that numpy is fast in general

seems like you should be fine

apparently

as a human small language model I can't give a comprehensive overview of your problem

Ginger

cool

I think it's fast enough for my purposes

math scat

What exactly is your purpose, may I ask?

lyxαl

13:05

@Ginger I also found this question on it

confirms it should be fast enough

although it does say to be careful about avoiding memory leaks

Ginger

you're not going to get me that easy

a valiant effort, though

math scat

@lyxαl im done

I opened this in a background tab, did some other stuff, thought I looked up the video myself to check the views and clicked on it.

lyxαl

math scat

> new mexico state bar association

Rydwolf Programs

13:55

@Ginger That should be instant right?

The memory representation should be the same

Unless it's stored *-major where * isn't the right dimension

(what is the equivalent to row-major/column-major for more than 2d arrays?)

l4m2

14:32

@mathscat This is about code-golf, if a Turing machine with n states outputs more than TREE(3) 1's then n is an upper bound

math scat

I meant that no upper bound has been found yet (I think, not sure about that)

Ginger

@RydwolfPrograms in theory, but idk how numpy does the listification

Rydwolf Programs

Numpy's C internally right?

Ginger

yes

Sandbox Posts

A: Sandbox for Proposed Challenges

BB⁻¹(TREE(3)) Construct a Turing machine with tape alphabet {0, 1} that, starting on a tape filled with 0, it halts with at least TREE(3) 1's. Least states wins. Notes As math scat mentioned, this is asked in math stackexchange, but such a question may fit better here LOL

l4m2

14:44

@mathscat Such thing

math scat

bruh.

Simd

CMC Given two strings A and B with edit (Levenshtein) distance 2k, count how many stringsr there are with edit distance k to both A and B

l4m2

@Simd Is k given?

Petəíŕd The Linux Wizard

15:20

Sorry for disrupting(?) conversation, but:

winterbash.rip

Credits to balpha.

math scat

gigachad whoever made that

Ginger

;-;

l4m2

15:32

@PetəíŕdTheLinuxWizard Spam: ad

Petəíŕd The Linux Wizard

@l4m2 nope, why?

Ginger

?????

that's not spam

l4m2

So what's this

Petəíŕd The Linux Wizard

It's an announcement

math scat

They just liked a website, I'm quite sure that's fine.

Ginger

15:34

spam has no intrinsic value whatsoever

mousetail

Not really relevant to this chat room though

l4m2

I don't see how it's not an ad

Ginger

sure, but we can tolerate a bit of off-topic

math scat

after all, winter bash was a big part of se

Ginger

@l4m2 according to Wiktionary, an "advertisement" is "A commercial solicitation designed to sell some commodity, service or similar"

and I'm pretty sure he wasn't trying to sell us something

especially seeing as he has no affiliation with the site

l4m2

15:37

Wiki says Advertising is the practice and techniques employed to bring attention to a product or service.

math scat

That is neither a product nor a service.

l4m2

Wiktionary says A public notice.

Ginger

and I'm pretty sure that site isn't a product or a service

look, what are you trying to do here? do you have a personal vendetta against Winter Bash or Peter?

l4m2

I didn't flag or similar but it just look like an ad

Ginger

and we are telling you that it's not, so you don't need to worry about it

thejonymyster

16:24

CMC: print the string \0\x1f;Zx\x97µÔóđİŎ, where \0, \x1f, and \x97 are replaced with the characters with ascii values 0, 31, 151 respectively. (Significance: first 12 of A061251)

just to be clear, the comma at the end is not part of the string.

Hello, World!

16:48

A: "Hello, World!"

􏿾 (U+0001 and U+10FFFE), 158 bytes 1-1>11<1>1111<11>11<1>1<1>1<11>1<11>111<11>1<11>111<11>1<1111>11<1>1<11>1111<1>111111<1>1<1>1<111>1<11>1<1111>1<111>11<1>11<11>1<11>111<11>11<1>1111<1>1111<1􏿾 Ends with the character U+10FFFE, but since this language has only 13 builtins (including that chara...