The author presents a variation of a tiling problem where each row or column contains a complete set of elements, each diagonal is free of contiguous like elements, and at least one partition exists. These restrictions limit the number of solutions considerably, and methods of solution are subsequently discussed. (CT)