A half-hearted attempt at finding (or rather searching) a MSOS (Magic Square of Squares) in the spirit of the Parker Square.

I recommend running it with pypy for obvious reasons if not even going ahead and porting it to C++.

pypy search_square.py

Fiddle around with N and the number of parallel workers as you please. On my machine I got to around N=2000.

The code is the documentation.

This code is licensed under WTFPL.