In this paper we conduct a systematic computerized search for groups generated by small, but highly symmetric, sets of elements of order 3. Many classical groups are readily obtained in this way, as are a number of sporadic simple groups. Firstly, we introduce monomial modular representations as these will prove useful later in the paper. Then the techniques of symmetric generation developed elsewhere are described afresh. The results we obtain are presented in a convenient tabular form, together with relevant character tables.