Hostname: page-component-7dd5485656-tbj44 Total loading time: 0 Render date: 2025-10-31T17:21:32.414Z Has data issue: false hasContentIssue false
  • English
  • Français

Pattern Variants on a Square Field

Published online by Cambridge University Press:  01 January 2025

S. J. Prokhovnik
S. J. Prokhovnik*
Affiliation:
The University of New South Wales
Get access Rights & Permissions [Opens in a new window]

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.

Information

Type
Original Paper
Information
Psychometrika , Volume 24 , Issue 4 , December 1959 , pp. 329 - 341
Copyright
Copyright © 1959 The Psychometric Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

Footnotes

*

The author is indebted to Mr. J. Sandiford for his invaluable assistance on the theoretical aspects of the problem and to Mr. J. L. Griffith for his helpful criticism.