摘要
介绍了作者提出的四个魔方构造算法。其中两个分别用于构造n=4k,n=2k+1(k>0)的魔方,另外两个则是前者的推广。文中通过一个定理阐述了这些算法的基本思想,并根据这一定理证明了算法的正确性。
This paper gives four algorithms for constructing magic squares, two of which are used to Construct magic squares of the orders n=4k and n=2k+1, respectively (k>0), and the others are extensions of the formers. The basic idea depends on a theorem, by which the correctness of the algorithms can be proved.
出处
《东南大学学报(自然科学版)》
EI
CAS
CSCD
1989年第2期66-74,共9页
Journal of Southeast University:Natural Science Edition
关键词
魔方
算法
构造法
algorithm, magic square/construction