Can you help me construct an $8 \times 8$ square filled with numbers from 1 to 64 (each cell has a different number obviously) such that every $3 \times 3$ subsquare has sum of numbers less than $256$?
I have tried to fill up the corners with the big numbers but I have failed to balance the $3 \times 3$ squares. I have also find some symmetries in the configuration but I still haven't succeed to stay lower than $256$.
The question is a subtask from a problem I invented myself. I don't post the whole problem because I want to protect my work and use it for future projects.
One qualifying grid: \begin{array}{|c|c|} \hline 61 & 50 & 21 & 54 & 57 & 14 & 44 & 62 \\ \hline 43 & 32 & 12 & 36 & 39 & 19 & 31 & 49 \\ \hline 27 & 5 & 4 & 23 & 9 & 1 & 10 & 25 \\ \hline 58 & 40 & 22 & 38 & 56 & 7 & 41 & 52 \\ \hline 53 & 35 & 11 & 55 & 37 & 26 & 34 & 59 \\ \hline 13 & 20 & 3 & 15 & 18 & 2 & 17 & 16 \\ \hline 45 & 30 & 8 & 33 & 42 & 6 & 29 & 47 \\ \hline 63 & 48 & 24 & 51 & 60 & 28 & 46 & 64 \\ \hline \end{array}
Sums of $3\times 3$ subsections: \begin{array}{|c|c|} \hline 255 & 237 & 255 & 252 & 224 & 255 \\ \hline 243 & 212 & 239 & 228 & 213 & 235 \\ \hline 255 & 233 & 255 & 252 & 221 & 255 \\ \hline 255 & 239 & 255 & 254 & 238 & 254 \\ \hline 218 & 210 & 222 & 234 & 211 & 236 \\ \hline 254 & 232 & 254 & 255 & 248 & 255 \\ \hline \end{array}