For integers n>2 and k>0, an (n×n)?k semi-Latin square is n×n array of k-subsets (called blocks) nk-set (of treatments), such that each treatment occurs once in row column the array. A uniform if every pair blocks, not same or column, intersect positive number treatments. It known a Schur optimal class all squares, here we show when exists, squares are precisely ones. We then compare using crit...