摘要
九宫重排问题是一个经典的问题,目前国内尚有人尝试用计算机去解决它.本文将该问题代数化,用置换群的方法彻底地解决了这一难题.
In this paper, a classical problem-the Nine Palace Repermutation Problem was thoroughly and very beautifully resolved by algebraic method.
出处
《烟台大学学报（自然科学与工程版）》
CAS
1991年第2期1-6,共6页
Journal of Yantai University(Natural Science and Engineering Edition)
关键词
九宫重排问题
置换
状态符
Nine palace repermutation problem. State sign. Permutation.
