A disadvantage of the packing search method described here is the significant effort required to implement it. This challenge arises because the symmetry operations differ for each space group, resulting in unique intermediate cluster constructions for each space group. Our current sampling covers the top 22 most common space groups, but extending the approach to all 230 space groups would require significant effort. Although, the choice to focus efforts on only a subset of space groups was universal among participants in 7th CSP Blind Test. Although the current packing search aims for crystals of Z'=1, coverage of Z'<1 crystals is inherent to the method. This is because the point group symmetry of the ASU together with a lower symmetry space group can form a higher symmetry space group. If the corresponding lower symmetry space groups are already searched, no additional development is needed for Z'<1 systems. Extension to other complex systems such as hydrates, salts, and cocrystals, is straightforward. However, a naive implementation may present a challenge for workflow throughput.