Traditional numerical solvers for minimax problems are calculus based. In this paper, we propose an evolutionary computation based numerical solver for minimax problems. We view the minimax problem as a game between two players with opposite objectives. One player trys to minimize the cost and the other trys to maximize it where strategies are expressed as populations. The strategies from each players are matched and scored. Only the best strategies will survive for each players. The surviving strategies will make offsprings for the next generation. We also consider relative evaluation method for faster convergence and number of matches between the opponents. The proposed technique is applied to a missile acceleration control problem for verification.