Balanced designs for two-component competition experiments on a square lattice

A Two-Variety Square Lattice Design Balanced Under Besag's Coding Scheme

“…At the expense of some efficiency (Besag and Moran, 1975), the method avoids the awkward computational problems associated with a full maximum-likelihood approach. Veevers and Zafar-Yab (1980) give a class of balanced designs for two varieties on a square lattice of hill plots which consist of mixtures of monoculture rows and rows on which the two varieties are strictly alternating. The designs have the property that there are equal numbers of hills having each of 0, 1, 2, 3 and 4 hills of the opposing variety amongst their nearest neighbours.…”