In a pursuit-evasion game, each pursuer attempts to minimize the distance between the pursuer (P) and the evader (E) and capture it in the shortest time, whereas the evader tries to maximize the distance to escape from being captured. In this talk, we deal with PE games with an evader and n pursuers. It is easy to imagine that the dimension of the space where the agents are moving swells with the number of pursuers, making the problem hard to solve. We will use the well-known PDE approach and an original decomposition technique to get over the big dimensionality contained in the problem. Simulation results will show the effectiveness of the proposed strategy of resolution as well as the limitations of it.