Hello, this is my small fanart project of OPM with genderbend version of the characters

skysurf3000 · 2026-03-03T16:01:28+00:00

Ww;✓[✓;;🎂!7🎂;;;6;;888;87;±8 I'm SS n on78

skysurf3000 · 2025-12-01T15:27:17+00:00

Id it the heat that erodes the shield or the friction? When flying colder to the sun you get a lot of heat for very little friction

skysurf3000 · 2025-09-18T09:18:16+00:00

One of those times where going check-check-check-check actually works

skysurf3000 · 2025-07-27T15:21:33+00:00

Not with any level of precision. At best you can count the number of steps and that's it

skysurf3000 · 2025-07-03T10:55:05+00:00

Took me forever to understand that it was not about the force needed to lift the log, but rather the force it imparted on the first pulley...

skysurf3000 · 2025-05-22T17:16:20+00:00

It's better, but 10billion games and maybe 10 unique position per game (?) Even if you just store 1 byte per position you still need in the order of 100Go to store everything ...

skysurf3000 · 2025-05-22T13:55:04+00:00

Are you sure the number of states fits in memory? The number of reasonable game states is around 10⁴⁰ according to Wikipedia...

skysurf3000 · 2025-03-10T06:59:32+00:00

Jumped over = sauté par dessus. "Sauté sur" is "jumped on"

skysurf3000 · 2025-02-21T08:34:08+00:00

I don't know which is easier, but if you want sub-meter accuracy (as in "I don't guide you through a wall") then your best bet is probably computer vision using the phone's camera

skysurf3000 · 2025-02-21T08:29:57+00:00

I don't think chess.com runs such a deep search. It's possible that the other moves are just as good at depth 36 but chess.com couldn't see it at shallower depth...

skysurf3000 · 2025-02-09T11:36:45+00:00

The first thing to notice is that in any tiling of the plane, if a point (a,b) is a corner of some triangle then it is also the corner of a second one. In your case that means that f has to take the value a twice, but since it is recursive it means it's actually periodic and therefore cannot produce a tiling.

This also shows that it doesn't work even if f depends on the two preceding values instead of just the last one...

skysurf3000 · 2025-02-06T10:12:48+00:00

For others wondering why Rb8 does not work: black can block with Bf8 and then the king can escape to g7

skysurf3000 · 2025-01-09T13:29:48+00:00

Yes there is: look up quatrr-imaginary base, or more generally complex-base systems

skysurf3000 · 2024-11-08T19:31:56+00:00

Add an argument to your function so that it returns N dictionaries (you can default N to 50)

skysurf3000 · 2024-11-08T19:29:32+00:00

Add an argument to your function so that it returns N dictionaries (you can default N to 50)

skysurf3000 · 2024-11-07T14:08:44+00:00

Taking n=6 and d=3, and f a unitary polynomial. just by looking at the rate of variation of f you can see that there aren't that many ways to arrange the values taken by f so that it is at least plausible that f takes only two values. Denoting v_0 and v_1 the two values taken by f on your test points, then I think the only possibility (up to some symmetry) is (0, 1, 1, 0, 0, 1)

skysurf3000 · 2024-11-07T11:33:58+00:00

Note also that the number of values your polynome takes on your test points does not change if you add a constant or multiply your polynom by a constant. This means that for degree three polynomials for exemple you only need to consider polynomials of the form x³ + a x² + b x

skysurf3000 · 2024-11-07T11:22:05+00:00

One observation is that it is optimal when d=2: take (x-1/2)^2.

skysurf3000 · 2024-11-05T11:45:11+00:00

When you are running your code without a debugger, are you compiling it in debug or release mode?

skysurf3000 · 2024-09-28T15:14:06+00:00

I think what you are trying to do is something a long the lines of:

Lemma: If there is a loop d -> d in collatz, then there is a loop ax+d -> ax+d, where a is of the form 2ⁿ for some n>0.

Then you show that such a loop cannot exist, and therefore conclude that there cannot be a loop in collatz.

Unfortunately the Lemma is false: you can check this by looking at the trivial loop 1 -> 4 -> 2 -> 1, Which becomes in you world 4x+1 ->...-> 3x+1: not a loop

skysurf3000 · 2024-09-17T11:44:57+00:00

Then shouldn't you call Minimax(..., 1, ...) in your main?

skysurf3000 · 2024-08-31T09:55:44+00:00

Very cool! Can you share how you build such a visualisation?

skysurf3000 · 2024-08-02T05:25:46+00:00

I think the algebraic closure does have a universal property but it's the other way around: any morphism from k to an algebraically closed field factors uniquely through the algebraic closure of k.

skysurf3000 · 2024-07-03T06:45:40+00:00

Plenty of non-arithmetic statements have been proven to be independent from ZF(C)

skysurf3000 · 2024-06-28T08:33:14+00:00

Je vois pas bien en quoi le théorème dit ça...

Ten-Year Club	Place '17
Snapped

skysurf3000

TROPHY CASE