This paper presents an N-person generalization of minimax aligned with the original definition. An efficient optimization method is further presented as a result of a straightforward mathematical extension of alpha-beta pruning to N-person games.