Comment by tromp

> which is fundamentally different from existing strong and weak solutions

It doesn't seem fundamentally different from Victor Allis' solution, but 2swap managed to generalize and streamline the rules available for static solutions, while also picking the winning moves that reduce the overall tree size.

> A weak solution can be visualized in a way that a strong solution (14tb uncompressed, 350gb compressed) cannot.

That is using an overly strict interpretation of strong solution. My database of all roughly 68000 8-ply positions allows for computing the best move from any position within seconds and takes only 12KB compressed (using one trit per 8-ply position, 5 trits per byte, using remaining 256-3^5=13 values for run length encoding).

[1] https://tromp.github.io/c4/c4.html