Abstract. Let E be a number field and G a finite group. Let A be any O E -order of full rank in the group algebra E [G] and X a (left) A-lattice. In a previous article, we gave a necessary and sufficient condition for X to be free of given rank d over A. In the case that (i) the Wedderburn decomposition E[G] ∼ = χ M χ is explicitly computable and (ii) each M χ is in fact a matrix ring over a field, this led to an algorithm that either gives elements α 1 , . . . , α d ∈ X such that X = Aα 1 ⊕ · · · ⊕ Aα d or determines that no such elements exist. In the present article, we generalise the algorithm by weakening condition (ii) considerably.