Pattern Variants on a Square Field

Abstract
A quantitative approach to the psychology of pattern recognition requires knowledge of the number of possible variants of any particular pattern. The general solution for the number [p/m2] of pattern variants that p counters can form on a square network of m2 positions is obtained by elementary group theory. The exact solution is given in terms of the different types (symmetric, asymmetric, etc.) of patterns possible and an approximate formula for the total number of patterns is also developed.