An Algorithm to Construct Super-Symmetric Latin Squares of Order 2n

Literature shows that there are several ways of generating Latin squares, but there is not enough implementation about Supersymmetric Latin squares. This paper proposes a mathematical algorithm to construct Super-symmetric Latin squares of order 2 by substituting blocks of order 2n which has the basic properties of a recursive algorithm. The proposed algorithm was tested for a large number of orders and the results proved that the algorithm could be generalized for any input order n where n is a positive integer.