In this section we try to sum up some of the important characteristics of the Hunter-Gatherer control architecture. First we set out the novel contributions HG brings to the state of the art. Next, we consider some of the formal properties of HG, namely the soundness and completeness of its planning capabilities. The third section discusses the notion of island processing, and how HG implements it. We conclude by discussing graph topology, and how it can be used to explain how and why (and when) HG works.