Given a $d$-dimensional array $M$ with $n^d$ real-valued entries, find the $d$-dimensional square subarray of $M$ (i.e. sides are of equal length) which maximizes the sum of the elements it contains.