This paper describes a two-space genetic algorithm that finds solutions to minimax optimization problems. The genetic algorithm maintains two populations and searches both simultaneously. Each individual is evaluated with respect to the individuals in the other population. Preliminary experimental results confirm that the algorithm can find good solutions to minimax optimization problems.