12:01 AM
Any feedback on any of these? random fib, n-perfect, delicate or alpha.

8 hours later…
7:32 AM
0

Starting an the origin on an infinite grid, you follow a predetermined path going up (U), down (D), left (L), or right (R). You paint every square you visit, including the square you started at and the square you finish at. Using this method, we can paint the number six using the instructions RRD...

1 hour later…
8:42 AM
@cairdcoinheringaahing for n-perfect, the mathjax formatting is a bit off, 'or' is placed on the right of the mathjax "box", so I see "+40+60+120" on the line after 'or', so try having 'or' the line after. also, it seems like a (perhaps) trivial variant of the divisor sum challenge codegolf.stackexchange.com/q/142071
the most interesting of them would be random fib

4 hours later…
12:46 PM
0

Move the Knight! Your knight is on (0, 0) on an infinite (to all of the four edges, not just two) chessboard, and you need to move it to (a, b). You can use arbitrary (but finite) number of moves to do that. Since the chessboard is infinite, you can use squares with negative coordinates. Since yo...

1:04 PM
@user41805 Yeah, I have no idea what's causing the Mathjax issue, but I've done a bit of an edit, so it should be fixed. I see the similarities with the divisor sum challenge, but I think they're different enough to avoid being VTCed as duplicates

2 hours later…
3:22 PM
@cairdcoinheringaahing I think I know why you found my highly-composite-number challange... :-)

@LuisMendo I don't think you do :P
I've basically been working my way through inactive questions and it showed up :P

Ah, I thought it was because it's related to this

No, but that would make sense :P

:-)

I'm trying to golf a Jelly answer, get 19 bytes. Check the existing answers: "Jelly, 7 bytes" by Dennis :/
6
(For a different challenge)

3:25 PM
You know, very hard to outgolf Dennis...

Unless you have 4 years of Jelly dev on your side, and even then it's not a guarantee

2 hours later…
5:02 PM
@NewMainPosts started off with twice as many bytes as Jelly, now down to only 3 bytes more

4 hours later…
8:51 PM
0

Say you have an infinite 6 by 6 grid, now say you want to cut a rectangle with dimensions LxW out of it such that the overhang, i.e., the distance from any vertex up to the cut line less than 6, is less than or equal to 1.5. The output will be the left, right, up, down over hang distance. Boom! O...

9:01 PM
I think I can golf electronics.stackexchange.com/a/521322 down to six relays - one for power, one for direction, and four to select the motor (K1 and K2 from his diagram and two more to replace K3...K5)

1 hour later…
10:06 PM
2

A positive integer \$x\$ is an \$n\$-perfect number if \$\sigma(x) = nx\$, where \$\sigma(x)\$ is the divisor sum function. For example, \$120\$ is a \$3\$-perfect number because its divisors sum to \$360\$: $$360 = 3\times120 = 1+2+3+4+5+6+8+10+12+15+20+24+30+40+60+120$$ and 926073336514623897...

I never realised that the feedback given when low-rep/anonymous users vote on posts is actually collected/used

10:56 PM
0

Background Tetris is a single-player game played on a rectangular grid with tetromino pieces. When you fill one or more lines with tetrominoes, the filled lines are removed, and all blocks above them move down accordingly. In the following diagrams, . is an empty space, # is an existing block, an...