Anderson, R. B.2022-09-232022-09-23197819784727874https://hdl.handle.net/10657/11837Geometric analogy tests are generally of sufficient complexity to challenge the intellect of the average test taker. A question arises as to how complex these problems are from a computational viewpoint. It was shown that most of these problems are rather simple from a computational viewpoint in that a limited set of constructs are sufficient to represent a fairly large number of problems and solutions which can then be mechanically generated.application/pdfenThis item is protected by copyright but is made available here under a claim of fair use (17 U.S.C. Section 107) for non-profit research and educational purposes. Users of this work assume the responsibility for determining copyright status prior to reusing, publishing, or reproducing this item for purposes other than what is allowed by fair use or other copyright exemptions. Any reuse of this item in excess of fair use or other copyright exemptions requires express permission of the copyright holder.Thesisreformatted digital