Competitive co-evolution algorithm can adaptively acquire solutions of a problem. However, in a problem which does not have the optimal solution, it needs to decide a set of effective solutions as the best solution. In this paper, we propose a competitive co-evolution algorithm with a packaging solutions to solve the problem. Our algorithm has two characteristics. The one is minimization of the number of individuals in the set by extraction of the complemental solutions. The other is evaluating solutions in some continued generations by setting a life-time to an individual. We apply the proposal method to the Game in order to investigate its effectiveness. Furthermore, we analyze the process of the set formation. In the simulation results, our method can acquire the complemental strategies and shows a better performance than a conventional method.