A brief description of the concept can be found in [1]}. Instead of the term “Latin property” we often say that the rooks are non-attacking, or they do not see each other. Each subspace of the chess-board of dimension \(k\) , where \(k\in \mathbb {Z}_d\) , is itself considered as a \(k\) -LSC with \(n^k\)  cells and \(n^{k-1}\)  non-attacking rooks. Consequently, a file contains 1 rook, a layer contains \(n\)  non-attacking rooks.
