• Journal of Industrial Convergence
• /
• v.19 no.4
• /
• pp.23-28
• /
• 2021

This paper finds the regular pattern of n = [3, ∞] for Euler square game related with n = 6(6×6=36) thirty-six officer problem that is still unsolved problem. The solution of this problem is exists for n = [3, 10] without n = 6. Also, previous researchers finds the random assigned solution for specific number using computer programming. Therefore, the solution of n = [11, ∞] Euler squares are unsolved problem because of anything but easy. This paper attempts to find generalized patterns for domains that have been extended to n = [3, ∞], while existing studies have been limited to n = [3, 10]. This paper classify the n = [3, ∞] into n = odd, 4k even, 4k+2 even of three classes. Then we find the simple regular pattern solution for n = odd and 4k even(n/2 = even). But we can't find the regular pattern for 4k+2 even(n/2 = odd).