文件名称:九宫图算法实现(过程表示法)
介绍说明--下载内容来自于网络,使用问题请自行百度
这题奇数是有数学方法的,可以构造出解。描述起来比较麻烦。 出一解的构造法: 首先在整个矩阵的最下面一行的中央置1, 然后向右下方向顺序填上2,3,4,5,6,7,…… 注意碰到底的时候就将数翻到上面去,碰到右边的时候就翻到左面去 比如5*5的幻方,如果1填在(5,3)处,2就应该填在(1,4)处,4就应该填在(3,1)处…… 另外,当原数的下方已经有数时,要将要填入的数填到原数正上方 仍举5*5幻方的例子,当5已填好(4,2)时,其右下方为1,不能把6填在那里,而应填在(3,2)处,即5的上方。 最后,一个特殊的点,右下角,这时也应当将新数填在右下角的上方。-odd that this a mathematical method of solution can be constructed. Descr iption relatively trouble. From a structural solution to the law : First, the entire matrix of the bottom of his home a central, then under the direction of the right order to fill 2,3,4,5,6,7 ... to the end of the encounter will be a few turns to above, where the right time to turn left on to For example, the 5 * 5 magic squares, fill in if a (5,3), the two should fill in (1,4), four should be filled in (3,1) Department ... Also, when the original number at the bottom of several that should be filled to fill several the original number is still above 5 5 * For Magic Squares example, when the five have completed (4,2), for its lower right one, we could not fill the six there, but should fill in (3,2), which is 5 ab
(系统自动生成,下载前可以参看下载内容)
下载文件列表
九宫图算法实现(过程表示法).txt
www.dssz.com.txt
www.dssz.com.txt
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.