Chessboard squares (Q1894757): Difference between revisions

We consider the problem posed by \textit{R. Häggkvist} [Discrete Math. 75, No. 1-3, 253-254 (1989; Zbl 0669.05015)] on finding \(n\times n\) arrays which are avoidable. An array is said to be avoidable if an \(n\times n\) latin square on the same symbols can be found which differs from the given array in every cell. We describe a family of arrays, known as chessboard arrays, and classify these arrays as avoidable or non- avoidable.