Stack Exchange
log in

Deadcode

 The Nineteenth Byte

The Nineteenth Byte: General discussion for codegolf.stackexc...
8
Deadcode
Jan 3 02:05
@Deadcode Oops, there actually are others with rational side lengths, probably an infinite number of them. They're about exponentially sparse though. And none of them aren't beaten by other known patterns. So I guess it could make a code golf challenge, but since only one of them is a good packing in general, it might not be interesting enough.
Deadcode
Jan 3 00:10
What do you mean by "13s"?
If you mean the kind of pattern of the s(293) that has a rational side length... it appears that it was an incredible one-off mathematical coincidence. I just checked for others in its series, and all of them are beaten by other known patterns, and don't even make rational side lengths anyway.
Deadcode
Jan 2 10:43
view-source:kingbird.myphotos.cc/packing/square-29.svg
Deadcode
Jan 2 10:42
@mousetail'he-him' Which one what?
Deadcode
Jan 2 10:41
The full Mathematica code for calculating the side length to any chosen number of digits is in the SVG source code.
Deadcode
Jan 2 10:40
It's Mathematica's RootApproximant[].
Deadcode
Jan 2 10:38
Unfortunately the method I'm using is only single-threaded, so it's only using 6.25% of my CPU. Which is a Xeon E5-2687W v2 @ 3.40 GHz with 64 GB of DDR3.
Deadcode
Jan 2 10:35
(which took a few days to solve)
Deadcode
Jan 2 10:35
Currently the record polynomial degree known is for s(108), which is degree 144.
Deadcode
Jan 2 10:34
I am also using heavy compute for something. Trying to find the polynomial roots for the more complicated packings. Currently I'm trying to find it for s(29). It's already taking on the order of a month, and if the polynomial degree is greater than 288, then I'll have to start another search that may take 4 months or more.
Deadcode
Jan 2 10:31
The search is to find ideas, the equation solve is to get to their local minima.
Deadcode
Jan 2 10:31
@Themoonisacheese Yes, but something found by a brute force search should be run through an equation solve anyway.
Deadcode
Jan 2 10:30
As far as I know, the only still best-known packings that were found with the aid of brute-force searching were s(29) and s(55).
Deadcode
Jan 2 10:29
@Themoonisacheese Compute is one way to find packings, but most of us find packings by creativity, along with computational equation solving.
Deadcode
Jan 2 06:57
The URL is: kingbird.myphotos.cc/packing/squares_in_squares.html
Deadcode
Jan 2 06:57
This isn't code golf per se, but it's similar. Anyone want to take a crack at finding/breaking some records in the packing of unit squares in a square?
I've recently expanded it from its original 1-100 up to 324. There have been lots of interesting findings in doing so. New types of packings, lots of patterns becoming much more apparent, and even the first record-breaking packing of rational side length just today.
What I'd *most* like to see is some of the "holes" filled: 103, 147, 150, 230, 232, 261, 263, 264, 290, 295, or 297. (There's also four holes on the right side of the triangular …
Deadcode
Apr 10, 2023 18:45
Well, that is kind of the entire point of the question :-) my regex answers emulate operations on integers larger than the input, because those operations can't be done directly without enough "scratch space" to work in. With scratch space, they'd be much smaller.
But I don't know enough about Trilangle to know *how* nontrivial it'd be to implement bigint multiplication in it. I do know that in Brainlove it'd be manageable.
Deadcode
Apr 10, 2023 18:22
Wow, Brainlove only has 6 existing answers on the site.
Deadcode
Apr 10, 2023 18:16
Sure, encouraging new users by giving them upvotes is a thing, but what if they keep making sloppy answers like that?
Deadcode
Apr 10, 2023 18:15
The answer also has other issues. It doesn't specify its own input and output format, and presents two links as if they're different versions of the program, but they're actually just different test harnesses of the same program.
Deadcode
Apr 10, 2023 18:09
@pxeger I mean yes, it is for answers of that kind that the question exists in the first place... but... it would be much more interesting if it could handle numbers up to 255.
Deadcode
Apr 10, 2023 18:04
@pxeger @Simd Well I'm afraid we'll have to get specific, because in this case at least, I don't think that makes any sense. This Brainlove answer can only handle inputs correctly in the range 1 to 22, even though the language's native type goes from 0 to 255. It's too much to ask even to handle numbers up to 255? How does it make sense to accept that?
Deadcode
Apr 10, 2023 17:09
I don't want to downvote it, since it's a new user... but, argh.
Deadcode
Apr 10, 2023 17:08
Why are people upvoting an answer that's not valid as per the challenge's specification? The answer can't handle inputs up to its language's native numerical type's upper bound, nor inputs as low as 0, both of which the challenge calls for, and yet it got upvoted up to +3. Yes, the user in this case is a new user with below 100 reputation, but doesn't it go against the principles of CGCC to upvote an answer that's not valid?
Deadcode
Apr 8, 2023 18:18
So, how much does the size need to increase for handling of 1?
Deadcode
Apr 8, 2023 18:17
Or with unlimited integers, it'd never halt
Deadcode
Apr 8, 2023 18:03
It seems I'm pretty alone in that. Almost nobody puts that kind of information in their answers.
Deadcode
Apr 8, 2023 18:03
These types of questions always interest me. If a challenge doesn't require handling of zero, I want to know which answers can handle it anyway, or if they don't, how much longer it'd need to be to handle zero.
Deadcode
Apr 8, 2023 18:01
Yeah I know it doesn't require that. But do any?
Deadcode
Apr 8, 2023 18:00
Do any of the answers return infinity for gcd(0,0)?
Deadcode
Apr 8, 2023 17:56
@Bbrk24 What challenge are you talking about?
Deadcode
Apr 8, 2023 17:54
And I also really wish it were possible for moderators to move answers from one question to another. For true duplicates, that'd be so much better than what currently happens.
Deadcode
Apr 8, 2023 17:53
@mousetail Bitwise operations don't have the same precedence in all languages. And not all languages even have bitwise operations.
Deadcode
Apr 8, 2023 17:50
If this were a matter of closing the question very soon after its creation, that'd be fine. But there's lots of existing answers.
Deadcode
Apr 8, 2023 17:50
@Bbrk24 Exactly.
Deadcode
Apr 8, 2023 17:50
You're robbing future people of being able to do that, when already many people had the opportunity.
Deadcode
Apr 8, 2023 17:49
How does it make the slightest bit of sense to do this to questions that have a whole lot of answers?
Deadcode
Apr 8, 2023 17:49
It's so horrible and unfair how people who happened to be active when that question was posted are allowed to post answers to it, and we aren't.
Deadcode
Apr 8, 2023 17:48
I so, so despise CGCC's policy of closing questions that are a little bit similar to another question. I'd much prefer a "live and let live" policy unless the question really is a true duplicate, or its difference is so tiny that it's truly not interesting. Is anybody with me on this?
Deadcode
Apr 8, 2023 16:10
@cairdcoinheringaahing And this was never true. Even the first revision of the challenge said a completely even number is an even number whose divisors except 1 are all even.
Deadcode
Apr 8, 2023 16:08
Why don't people realize this?
Deadcode
Apr 8, 2023 16:08
Yeah but the site won't allow a new powers of 2 question to be created. It'd be closed as a dupe. Catch 22.
Deadcode
Apr 8, 2023 16:07
Seems to me it's an avalanche effect. People want their opinion to match that of other people
 

 Attempt This Online

(ask in The Ninteenth Byte to unfreeze!) - Discussion and feed...
Deadcode
Oct 30, 2024 21:07
So it's possible it did work, and they included that note anyway because presumably it'd be silent when run from the ATO link.
Deadcode
Oct 30, 2024 21:04
Also it wouldn't be very useful to run a program that plays music in ATO, lol.
Deadcode
Oct 30, 2024 21:03
@pxeger I never personally got a chance to try it, because you added it during a time when I was inactive on CGCC. But there's one Sep 18, 2024 answer on CGCC that used it: Play the Final Fantasy Prelude... they may have included this link blindly though, given that they also say "To run, paste this into a .ps1 file, then run it in PowerShell; or paste it directly into a PowerShell terminal."
Deadcode
Oct 30, 2024 16:30
Of course upgrading to the latest is better if that works
Deadcode
Oct 30, 2024 16:23
And maybe there's a way to configure even the latest version to create a smaller memfd
Deadcode
Oct 30, 2024 16:22
@pxeger It must have been a recent PowerShell update that introduced this, right? Could you revert to the most recent version that doesn't have this problem?
Deadcode
Oct 25, 2024 17:15
@pxeger Thanks for maintaining ATO. Last I checked there was no PowerShell support, and now there is... except that it is now crashing, regardless of the program being attempted: /ATO/runner: line 4: 2 File size limit exceeded(core dumped) /ATO/yargs %1 /ATO/options /ATO/yargs %2 /ATO/arguments pwsh %1 /ATO/code %2 < /ATO/input