Given a sufficiently simple and well-defined initial set of Proto-property spaces, a minimal set of graph rewrite rules, and a computable Lagrangian favoring high aggregate, the iterative application of the local maximization dynamic to an initially simple or random graph state will spontaneously generate a non-trivial diversity of stable, emergent patterns.