  For many applications the presence of a quantum advantage crucially depends
on the availability of resourceful states. Although the resource typically
depends on the particular task, in the context of multipartite systems
entangled quantum states are often regarded as resourceful. We propose an
algorithmic method to find maximally resourceful states of several particles
for various applications and quantifiers. We discuss in detail the case of the
geometric measure, identifying physically interesting states and also deliver
insights to the problem of absolutely maximally entangled states. Moreover, we
demonstrate the universality of our approach by applying it to maximally
entangled subspaces, the Schmidt-rank, the stabilizer rank as well as the
preparability in triangle networks.
