This is actually incredibly useful. It is incomplete though,
{0:8:5:4:1:25}=25
{0:9:8:6:2:32}=64
{0:16:10:8:2:50}=100
{0:18:7:6:1:49}=49
Here's the normal view of (1,N) again. I'm focused on getting the initial value of X, if someone could find a formula for how X behaves after that, it'll be huge. The distances are small enough that it can be forced out, but moving thousands of N records, the formula is significant.
My understand of E and F is this. E is the amount C is over it's perfect square root, F is the amount C is under the next perfect square root up (D+1). This is why the perfect square roots only fill E0, but they fill the inverted square roots in F. Every perfect square root can be a perfect square root under a different perfect square root.
We also have the VQC bruteforcer that I figured out what was wrong with. The correct version is this.
ArbitraryCell(e, n, x){
e = e;
n = n;
x = x;
a = (x * x + e) / (2 * n);
b = a + 2 * (x + n);
c = a * b;
d = sqrt(c);
}
boolean isValid(){
return (c - d * d) == e;
}
You can generate any cell by any E,N,X and test if it's a good cell or not. Good for looking at very specific regions.