“神奇”的拉马努金矩阵

# coding=utf-8

'''
拉瓦努金矩阵
ref1 -> https://www.imsc.res.in/~rao/ramanujan/newnow/magicsqr.htm
ref2 -> http://leninkumarkoppoju.blogspot.com/2014/07/ramanujans-magic-square.html

22    12    18    87
88    17    9     25
10    24    89    16
19    86    23    11
'''

(a, b, c, d) = (22, 12, 18, 87)
#(a, b, c, d) = (12, 17, 19, 96)
(e, f, g, h) = (0, 0, 0, 0)
(i, j, k, l) = (0, 0, 0, 0)
(m, n, o, p) = (0, 0, 0, 0)

def check_single_not_suit(checked, all):
    return (checked in all) or (checked <= 0)

def check_SR_magic_sqr(abcd):
    count = 0
    a, b, c, d = (abcd)
    x = 4*max(abcd)
    y = sum(abcd)

    for f in range(1, x):
        for k in range(1, x):
            all = [a, b, c, d, f]
            if check_single_not_suit(k, all):continue
            all.append(k)
            p = y - a - f - k
            if check_single_not_suit(p, all):continue
            all.append(p)
            e = y - a - b - f
            if check_single_not_suit(e, all):continue
            all.append(e)
            m = y - a - d - p
            if check_single_not_suit(m, all):continue
            all.append(m)
            i = y - a - e - m
            if check_single_not_suit(i, all):continue
            all.append(i)
            j = y - e - f - i
            if check_single_not_suit(j, all):continue
            all.append(j)
            n = y - b - f - j
            if check_single_not_suit(n, all):continue
            all.append(n)
            o = y - m - n - p
            if check_single_not_suit(o, all):continue
            all.append(o)
            g = y - c - k - o
            if check_single_not_suit(g, all):continue
            all.append(g)
            h = y - e - f - g
            if check_single_not_suit(h, all):continue
            all.append(h)
            l = y - d - h - p
            if check_single_not_suit(l, all):continue
            all.append(l)
            if ((y == c + d + g + h) and (y == i + j + m + n) and \
                (y == k + l + o + p) and (y == i + j + k + l) and \
                (y == b + c + n + o) and (y == e + i + h + l) and \
                (y == d + g + j + m) and (y == f + g + j + k) and \
                (y == b + e + l + o) and (y == c + h + i + n) and \
                (y == g + h + k + l)):
                print(a, b, c, d)
                print(e, f, g, h)
                print(i, j, k, l)
                print(m, n, o, p)
                print('\n')
                count += 1
    return count

def main():
    count = check_SR_magic_sqr((a, b, c, d))
    print('total count is {}'.format(count))

if __name__ == "__main__":
    main()
    pass

 ...
(22, 12, 18, 87)
(57, 48, 20, 14)
(31, 3, 68, 37)
(29, 76, 33, 1)


(22, 12, 18, 87)
(56, 49, 23, 11)
(33, 1, 66, 39)
(28, 77, 32, 2)


(22, 12, 18, 87)
(56, 49, 21, 13)
(32, 2, 67, 38)
(29, 76, 33, 1)


total count is 228