摘要
本文定义了广义Euler方阵及其计数,研究了一类六阶广义Euler极值问题的多重解。它的背景是著名的36军官问题。所得的结果可用于六元编码的设计。
In this paper, the generalized Euler square matrix and its count are defined. The multi-ple solutions of the extremum of 36 officers problem are discussed. The results of these solu-tions can be used for 6-ary coding design.
