>>659

Tomorrow I'll render the F side more. What is it about that side that makes multiple columns in (-E,0) that are fully populated with imperfect squares on N? N..-1, -4, -9, -16, -25, -36, -49, -64. Why are THOSE numbers perfect squares? I initially thought -E was a red herring, but I'm out of ideas.

In the original code,

int f = e - ((2 * d) + 1)

f, n - 1, d + 1, x + 1, a, b

Why is F calculated like that? Why are the variable's adjusted like that? On the E side, D=floor(sqrt(c)), on the F side, D=ceiling(sqrt(c)). What does this mean?

>>667

I swear to God you are gonna be the one to figure this out.

>>672

F isn't just negative -E values, F is a copy of the E side with different rules. Why the copy? What is the purpose of the new rules?

>>676

If geometrically swapping N and A are equal, why does the grid not allow it?

Also going to the F side, we aren't fixing A or B, we're fixing X and N. Why?

What if D=floor(sqrt(c)), is the small square root, and D=ceiling(sqrt(c)) is the big square root, the answer lies in the difference between them?

I'm just throwing shit at the wall now to see what sticks. I gotta get to bed now though.