Machine generation of geometric analogy problems

Geometric 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.