The optimal control sequence is found for the capture by a pursuer of the identities of an arbitrary number of evaders. The pursuer moves to observe the face of each evader, which each evader simultaneously moves to conceal. A dynamic game model is used, with metrics defining evader observability and utility functions embodying pursuer and evader control objectives. Nash equilibria are found specifying player strategies in a repeated game with perfect but either complete or incomplete information. The evolution of evasive runaway, identity capture, and stopping is characterized, and an exact solution with proof is found for the optimal sequence of pursuer controls which results in the identification of an arbitrary number of evaders in minimum time. Performance illustrations of the optimal sequencing are provided.