[1]黄大海.四个魔方构造算法[J].东南大学学报(自然科学版),1989,19(2):66-74.[doi:10.3969/j.issn.1001-0505.1989.02.010]
 Huang Dahai (Department of Computer Science and Engineering).Four Algorithms for Constructing Magic Squares[J].Journal of Southeast University (Natural Science Edition),1989,19(2):66-74.[doi:10.3969/j.issn.1001-0505.1989.02.010]
点击复制

四个魔方构造算法()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
19
期数:
1989年第2期
页码:
66-74
栏目:
本刊信息
出版日期:
1989-03-20

文章信息/Info

Title:
Four Algorithms for Constructing Magic Squares
作者:
黄大海
东南大学计算机科学与工程系
Author(s):
Huang Dahai (Department of Computer Science and Engineering)
关键词:
算法 魔方/构造法
Keywords:
algorithm magic square/construction
分类号:
+
DOI:
10.3969/j.issn.1001-0505.1989.02.010
摘要:
介绍了作者提出的四个魔方构造算法。其中两个分别用于构造n=4k,n=2k+1(k>0)的魔方,另外两个则是前者的推广。文中通过一个定理阐述了这些算法的基本思想,并根据这一定理证明了算法的正确性。
Abstract:
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.

相似文献/References:

[1]殷新春,陈凌.求最长公共子串长度的算法[J].东南大学学报(自然科学版),1998,28(6):191.[doi:10.3969/j.issn.1001-0505.1998.06.038]
 Yin Xinchun,Chen Ling.Algorithms for Evaluating Length of the Longest Common Substring[J].Journal of Southeast University (Natural Science Edition),1998,28(2):191.[doi:10.3969/j.issn.1001-0505.1998.06.038]
[2]周佩德,谢晶.矢量图文变形的权值拖曳算法研究[J].东南大学学报(自然科学版),1996,26(2):93.[doi:10.3969/j.issn.1001-0505.1996.02.015]
 Zhou Peide,Xie Jing.The Research on Weight-Dragging Algorithms for Deforming Vector Graphics and Text[J].Journal of Southeast University (Natural Science Edition),1996,26(2):93.[doi:10.3969/j.issn.1001-0505.1996.02.015]

更新日期/Last Update: 2013-04-30