In this paper, the authors present a metaheuristic algorithm that is inspired by Particle Swarm Optimization (PSO). The algorithm maintains a set of intercommunicating particle clusters and equips each particle with a specialized local search function. To demonstrate the effectiveness of the algorithm, they analyze its ability to solve Mastermind codes and compare its performance with other algorithms found in the literature. For the mastermind problem, they have found that their algorithm is comparable to other algorithms for small problem sizes, but has much more efficient scaling behavior.