2529: "Unsolved Math Problems"

[ratammer]

Title text: After decades of studying the curve and the procedure that generates it, the consensus explanation is "it's just like that."

She should pick up the curve and wield it like a staff.

[The Snide Sniper]

I kinda want to know the answer to the second one.

[somitomi]

I kinda want to know the answer to the second one.

Nerd-sniped?

[chridd]

The second one seems a bit underspecified, since it's not clear what exactly counts as a "line". Going from the diagram, the marbles don't have to be in adjacent squares, but do they still have to be one apart on some axis? Or if not, then do they have to be evenly spaced? Or do they just have to be colinear?

[ratammer]

I interpreted it as co-linear.

[pulsar512b]

I kinda want to know the answer to the second one.

Nerd-sniped?

what do u think i spent my friday and saturday on

ok in all seriousness, i havent gotten to figuring that out, but i have got a program that does some non-intersecting random walk stuff and I HAVE SOME OPINIONS OK

WHAT DOES "NONINTERSECTING RANDOM WALK MEAN" DOES IT MEAN NEVER INTERSECTING, or JUST NOT LIKE, IMMEDIATELY RUNNING INTO ITSELF OR WHAT??????
because, like if it never intersects if N and K are sufficiently large that like N*K is like in the hundreds, then you have to do quite a few runs with just a random walk to see one that keeps going for long enough

anyway code https://github.com/pulsie/non-intersecting-random-walk do whatever you want, there's no documentation but just dm me here/discord and i'll tell ya

i also got fun graphs, but that's beside the point, more importantly, i've got to the point where i think the hardest part of figuring out how to sim the original problem is finding colinearity tbh

[balthasar_s]

For some reason I keep reading "non-intersecting random walk" as "not interesting random walk".

[pulsar512b]

I kinda want to know the answer to the second one.

Nerd-sniped?

what do u think i spent my friday and saturday on

ok in all seriousness, i havent gotten to figuring that out, but i have got a program that does some non-intersecting random walk stuff and I HAVE SOME OPINIONS OK

WHAT DOES "NONINTERSECTING RANDOM WALK MEAN" DOES IT MEAN NEVER INTERSECTING, or JUST NOT LIKE, IMMEDIATELY RUNNING INTO ITSELF OR WHAT??????
because, like if it never intersects if N and K are sufficiently large that like N*K is like in the hundreds, then you have to do quite a few runs with just a random walk to see one that keeps going for long enough

anyway code https://github.com/pulsie/non-intersecting-random-walk do whatever you want, there's no documentation but just dm me here/discord and i'll tell ya

i also got fun graphs, but that's beside the point, more importantly, i've got to the point where i think the hardest part of figuring out how to sim the original problem is finding colinearity tbh

ok so ive figured some stuff out, and further ive reasoned out that there's some ways to basically do the nonintersecting random walk, without just having to spam random walks for a long time, but with the same result. (dm here or on discord again for more info)
colinearity was interesting, it took a lot of talking with very smart people i know to get something, but we ended up figuring out how to get it to n^2 (and possibly less if i can be arsed to get multiprocessor stuff going)

also i did other things and now im basically entirely ready to start working on the original problem asap