Enumerating Diagonal Latin Squares of Order Up to 9
Stepan Kochemazov and Oleg Zaikin
ISDCT SB RAS
Lermontov street 134
Southwest State University
50 let Oktyabrya 94
305040 Kursk Russia
Nakhimov Avenue 36 Building 1
We propose an algorithm for enumerating diagonal Latin squares. It relies
on specific properties of diagonal Latin squares to employ symmetry
breaking techniques. Furthermore, the algorithm employs several heuristic
optimizations and bit arithmetic techniques. We use the algorithm to
enumerate diagonal Latin squares of order at most 9.
Full version: pdf,
(Concerned with sequences
Received July 3 2019; revised versions received October 8 2019; October 28 2019.
Published in Journal of Integer Sequences,
December 28 2019.
Journal of Integer Sequences home page