Creating Latin squares of fixed order following the Sequential Enumeration scheme
1: start the first LS with first row 1 2 3 4 ….
2: try to complete the LS row by row and site by site (from left to right) by always choosing the lowest possible number for the subsequent sites
3; in case of failure return to the last site where you had a choice (the last-choice site) and took the lowest possible number
4; now take the lowest available number there and proceed, always taking lowest possible numbers;
5; proceed in this manner, if in failure return to the last site where one or more choices are (still) available, always taking the lowest. If the process fails again return to the last but one choice site, etc.
6; proceed until the LS is finished. Number it LS(01) *.
7; start the completion of LS(02) by: taking the previously completed LS as starting point, returning to the last choice site of that LS, and following 5
8; proceed until there are no choice sites left in the previously completed LS.
“failure”: impossibility to meet the Latin square condition at a current site
“possible”: compatible with the Latin square condition
“available” possible and not yet adopted in a previous attempt to continue the process
“last” refers to the process in time of successively filling the sites, going from upper to lower rows, etc.
Numbering of the 24 LS’s of order 4 (Chapter2) followed the sequence of creation with the Sequential Enumeration schema. .