The Nineteenth Byte

noodle man

01:51

do you think it makes sense to invite new users that seem enthusiastic to TNB? or should they find it on their own

i guess it probably doesn’t make much difference

Unrelated String

i feel like chat is kinda hard to find tbh

like you'll see chat links in comments but it's usually for moving stuff out of comments more so than a hey there's a room where you can also just hang out here

thejonymyster

trying to make a chess related challenge, see here for sandbox, but im realizing now that what "jumping" means for a piece is kind of... subjective i guess? its not really handled in standard chess rules since theres only one "jumping" piece... and it doesnt move orthogonally or anything so im just like. about to pose a CMQ about it i guess

CMQ: what does it mean for a chess piece to "jump"? are knights jumping? or do they just move at an angle and distance (velocity?) that has no intermediate landing points?

Sandbox Posts

02:12

0

A: Sandbox for Proposed Challenges

Build a word list from a phonemic inventory @sandbox: part one. similar to my previous challenge, but I think it's different enough to be a separate question(?) I have ideas chained to this one for gamifying the next steps to building a dictionary in the general case, but cut them off as this got...

guest4308

02:29

for sandbox, I thought I saw somewhere that said it's generally accepted practice to link to the question and then delete your answer; but there are a lot of posts that are just a link and aren't deleted. should I undelete the old post or is standard practice still deleting them? codegolf.meta.stackexchange.com/a/26054/119818

New Posts

04:10

0

Q: Golf a LaTeΧ math expression

A problem I sometimes encounter is that when writing comments using LaTeX, the comment is too long. Today you will solve this, by writing code which, given a LaTeX math expression, will produce the shortest equivalent expression. To define equivalent expressions, we will need to specify a (simpli...

Rydwolf Programs

04:29

@guest4308 Deleting them is still standard practice IIRC people just forget or wait a little while

There was a meta question recently lemme find it

11

Q: Are we still deleting sandbox posts?

The Sandbox currently says: When you think your challenge is ready for the public, go ahead and post it, and replace the post here with a link to the challenge and delete the sandbox post. (Emphasis original.) These days, however, I see a lot of sandbox posts which are edited down to a link but...

discussion sandbox

Ah, it seems there's no consensus

So yeah just do what feels right ig :p

@thejonymyster To move to a square without interacting with any others

thejonymyster

oh thats a more useful definition

thanks

and then i myself would be limiting those to like, straight lines from the start position for simplicity

or wait

whats it called when you keep thinking youve solved an issue but you keep thinking about it wrong and get caught in loops OTL

Rydwolf Programs

Technically every piece would jump under this definition ig, just only under certain conditions, but if you think of that more as interactions it could have, it still excludes those

So I guess jumping would be more like moving to a square without interacting or caring about any others (with the exception of, e.g., pins)

thejonymyster

i guess its more like; if i tell a piece to move between two squares and there isnt an obvious like, orthogonal / cardinal path between them, is it ok to say thats a jumping move by default?

or is it like

that move couldnt have anything blocking it anyway

by the nature of the angle chosen

like a single knight move

its so hard to phrase this naturally because i hardly understand what im asking T_T

i just recognize theres a Problem

Unrelated String

04:49

i feel like there's like
two separate intuitions for what constitutes a knight jumping
could a rook reach that space in two moves, and could a queen

thejonymyster

the challenge about like, defining piece movement, so i guess im wondering like, does a knight need to be defined as having jumping moves or is it just [1,2] and the very nature of that movement is not needing a jump

Unrelated String

05:06

the very nature of that movement is not needing a jump

consider chess pieces as occupying single grid-locked points instead of entire squares on the grid

[1,2] movement literally just can't ever collide with any other point before the destination

thejonymyster

and then would it be reasonable to say that [2,4] would need specification to ask if it jumps or collides with [1,2] on the way?

Unrelated String

05:23

yep

basically anything where the coordinates are or can be coprime

thejonymyster

nodding thank you ok i guess i just needed a sanity check :P i'll write that in next time i mess with the sandbox ty

Unrelated String

np

Simd

08:31

Hi all

Simd

10:49

clearly a quiet perid...

lyxal

11:04

weekends be like that

perfectly fine

Simd

@lyxal what do you mean fine???

:)

lyxal

nothing wrong with a quiet room

Simd

fair enough

I am wondering whether to post my sandboxed challenge

or if leaving it in the sandbox might help

lyxal

which question

Simd

0

A: Sandbox for Proposed Challenges

Title: Random factorized numbers Input The code should take an integer \$n\$ between 1 and 1000. Output The code should output positive integers with \$n\$ bits. Accompanying each integer should be its full factorization. Each integer should be a uniformly random \$n\$ bit number. Score The score...

lyxal

11:09

I don't see anything wrong with t

*it

Simd

thanks!

Posting...

New Posts

0

Q: Random factorized numbers

Input The code should take an integer \$n\$ between 1 and 1000. Output The code should output positive integers with \$n\$ bits. Accompanying each integer should be its full factorization. Each integer should be a uniformly random \$n\$ bit number. Score The score for your code will be the number...

fastest-code

Simd

thanks for the upvote!

so 100% ratio of views to upvotes :)

noodle man

12:46

codegolf.stackexchange.com/q/92776/108687 is crazy, there's a 70 byte golfscript, 16 byte japt, 40 byte jelly..

lyxal

10 byte jelly

noodle man

somehow i missed that but there is also a 40 byte jelly

Simd

hi @Neil

Simd

14:12

argh! downvote :(

Simd

16:28

unexplained downvotes make me sad

mousetail

@Simd Maybe try to write more challenges that you think would be fun to solve rather than random problems you are interested in

Simd

@mousetail That's a little unfair!

I pose questions that I think are fun

but I really like slightly difficult questions that are interesting to make fast

mousetail

Do you? You basically asked to convert a paper to code

Simd

@mousetail Oh. I didn't see it that way

I thought it was just a cool thing to do as there doesn't seem to be much code online for it and it's sort of magical that you can do it at all

mousetail

It is a cool algorithm, and you are right it's kinda magical you can do it at all, but that doesn't make it a fun challenge to optimize

Simd

16:36

codegolf.stackexchange.com/questions/265455/… didn't involve speed :)

@mousetail isn't it fun to see which of the many primality tests you can make fastest?

mousetail

That one didn't get any downvotes though?

Simd

no it didn't.. I just wanted to defend myself by showing that not all my questions are the same

codegolf.stackexchange.com/questions/263910/… also doesn't involve speed

mousetail

A lot of your challenges are interesting for sure

Simd

thank you. I was feeling a little sad

I think it's normal that different people like different sorts of questions

mousetail

I wasn't trying to say they where all bad, in fact none of them are really bad. Just think you might get more votes if you tried to make ones that might be more interesting to specifically optimize rather than just implement

Simd

16:38

I wish they wouldn't downvote questions that aren't aimed at them

I dislike code-golf questions of uninteresting functions. I would never downvote them

mousetail

You can't really judge questions since you never solve them

They may be very interesting to golf, but you'd never know since you never attempt them

Simd

@mousetail is that fair?

I have no interest in esolangs

mousetail

I think so yes, you can only really judge a question if you have at least considered how you would golf it

You can golf in practlangs

Or solve any of the non-golf challenges

Simd

but do people consider how they would solve my latest question before downvoting it?

I suspect not

it's really a time problem for me

mousetail

I think they did, they realized they'd need to basically transcribe the algorithm from the paper and that that would be tedious and boring

Simd

16:41

I have just enough time to pose a question every now and then

@mousetail but why boring? I mean you have to deal with 500 bit numbers!

and make it fast

mousetail

None of those things are interesting to optimize

Simd

hmmm

mousetail

You'd just use a bignum library

A interesting problem is not necessarily interesting to optimize

Simd

that would depend on whether you trusted it to be fast enough I guess

mousetail

It's gonna be a lot faster than writing it yourself, that much is guarenteed

Fastest code is usually the code you don't write

5

Simd

16:44

in my experience someone always comes up with an amazing way to make the code fast

the fastest answer to codegolf.stackexchange.com/questions/264775/… is amazing

mousetail

Is it fun to brute force your way to that solution?

Simd

sorry, which solution?

brute force won't terminate before the heat death of the unverse

mousetail

A problem that is fun to optimize must be optimizable in small steps, if it requires a genius insight it's not gonna be fun for most normal people

Simd

4

Q: Compute convolution quickly and accurately

Input An array A of integers of length 100,000. The array will contain only integers in the range 0 to 1e7. Output The convolution of A with itself. As this will be of length 199999 you should time just the convolution calculation however, not the time to print out the answer. Example in Python ...

fastest-code

that is a good example for me. The fast answers are very impressive

even though the idea is not new

mousetail

That's why golf is fun, even if your algorithm is terrible you can still shave off a few bytes in small increments which is fun

Simd

16:46

@mousetail right. I think my problem has that property

mousetail

Fastest code can be like that, but it requires a specific type of problem

Simd

I claim my problems normally have that property...well sometimes you make a big improvement with a clever idea and then more smaller but important improvements with code optimization

mousetail

It must also be relatively easy to get a basic working solution that you can then optimize

Simd

right... that's why the python answer is so useful

it might have been better if I had put it in the question

mousetail

It might have yea

Simd

16:49

thank you to Command Master

mousetail

Absolute legend

Simd

:)

mousetail

I'm wondering how the perfect_power function is implemented in sympy, seems suprising that it runs faster than facotring

Simd

github.com/sympy/sympy/blob/master/sympy/ntheory/factor_.py

it's in there

mousetail

So it's kinda long and hart to understand but it seems it's trying primes? Seems it would be slow

Simd

16:58

i don't realy know to be honest

I assume it isn't trying all primes

mousetail

for p in prime_iter:
        if threshold < p:
            # If p is large, find the power root p directly without `iroot`.
            while True:
                b = pow(2, logn / p)
                rb = int(b + 0.5)
                if abs(rb - b) < 0.01 and rb**p == n:
                    n = rb
                    multi *= p
                    logn = math.log2(n)
                else:
                    break
        else:
            while True:
                m, _exact = iroot(n, p)
                if _exact:

This seems to be looping over all primes?

Not sure what's happening inside the loop though

Simd

maybe it only does it up to log size?

that is threshold?

mousetail

Possibly

This is the last thing it tries btw, it tries 3 other methods I understand even less and if none of them work it does thos

Simd

yes

mousetail

17:24

Interesting how many primality tests involve Fibonacci numbers

noodle man

18:02

just found a slightly sketchy mirror of the site :)

oop not a mirror, it only has Calculate the Aspect Ratio of the Nepal Flag

Unrelated String

19:26

why of course

lyxal

22:06

@noodleman you'd be surprised at how many there are

Just random pages that scrape code golf questions

noodle man

yeah it’s weird the links on the page also didn’t work

the challenge used MathJax and the site didn’t load it

hyper-neutrino

is there any way to use a CSS grid to make the first and third columns take up equal but minimal space and the second column take up as much as possible?

1fr auto 1fr makes the second column get compressed and auto 1fr auto makes the side columns not match widths

tried asking chatGPT but it kept alternating between the two depending on which demand I made more recently, lol. can't think of a way to do it but I am curious if I'm just missing something

noodle man

should the side columns have equal width?

lyxal

@hyper-neutrino fr fr?

hyper-neutrino

@noodleman yes - the reason is I am trying to align the content in the center and there will be a button to the left of the header, so I want the body to have equivalent spacing on the left so it's aligned with the header, and to avoid asymmetry, I want an empty right column with the same spacing

noodle man

22:18

fr action fr

hyper-neutrino

@lyxal ong no cap

noodle man

so the second should be in the middle

idk how you’d do it with grid but with flex box you could give the second one flex-grow: grow

i think that would work, can’t test in mobile

hyper-neutrino

I think that wouldn't enforce the side columns' equal width though

I'm tempted to just copy the left column's element into the right column and make it invisible :P

I'll just stick to that unless I can think of something better lmao

noodle man

~~you could use jQuery~~

lyxal

@hyper-neutrino Is there content in the (f|th)ir(st|d) column?

ATaco

22:24

Three dashes

hyper-neutrino

it's in the second column (first, second, third in LTR order)

also it just occurred to me that slicing that much width off both sides is actually terrible for the mobile version so I have decided to not do this

lyxal

So there's absolutely nothing in the other columns

hyper-neutrino

there's a button at the top of the left column and nothing else

lyxal

Could that button be outside of the columns?

And just left aligned above?

noodle man

@lyxal ah yes, the thirst column

lyxal

22:26

Because then this simply becomes a vertical centering problem which there's probably 82 million blog posts about if you can put the button outside

@noodleman the fird column

noodle man

wouldn’t it be horizontal centering?

i’m still not convinced flex-grow wouldn’t work

hyper-neutrino

this is what I was trying to do lol

but on mobile the gutters would make the content too narrow to be usable so I'm just going to do this differently, probably just gonna put the button on the right so the header and body are still aligned

still curious if it's possible using pure CSS just out of theory though

noodle man

@hyper-neutrino just add a min-width

lyxal

@hyper-neutrino <details>

let the browser do it for you

hyper-neutrino

22:42

forgot that existed lol

noodle man

umm actually that won’t work on netscape navigator 0.2

lyxal

neaeeaeaetscape naeaaeavegator

ATaco

23:04

"It doesn't work in my browser 🤓" Okay? Install my browser then

noodle man

23:46

i’ll give 100 rep to anyone who does my radiation-hardening challenge in a 2D lang with a score of 75 or more (can be less if it’s really interesting)

3

Transcript for