Cluster-based Particle Swarm Algorithm for Solving the Mastermind Problem

Dan Partynski
unpublished
In this paper we present a metaheuristic algorithm that is inspired by Particle Swarm Optimization. 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, we analyze its ability to solve Mastermind codes and compare its performance with other algorithms found in the literature. For the Mastermind problem, we have found that our algorithm is comparable to other
more » ... arable to other algorithms for small problem sizes, but has much more efficient scaling behavior.
fatcat:7avfofrp55cmrbjb2zvesrvadu