In the realm of evolutionary game theory, the majority of scenarios involve players with incomplete knowledge, specially regarding their opponents' actions and payoffs compounded by the everāshifting landscape of players' interactions. These dynamics present formidable challenges in both the analysis and optimization of game evolution. To address this, a novel model named the networked evolutionary game (NEG) is proposed based on incomplete information with switched topologies. This model captures situations where players possess limited insight into their opponents' benefits, yet make decisions based on their own payoffs while adapting to different networks and new players. To bridge the gap between incomplete and complete information games, R. Selten's transformation method is leveraged, a renowned approach that converts an incomplete information game into an interim agent game, thereby establishing the equivalence of pure Nash equilibria (NE) in both scenarios. Employing the semiātensor product (STP) of matrices, a powerful tool in logistic system, the evolution of the model is articulated through algebraic relationships. This enables to unravel the patterns of game evolution and identify the corresponding pure Nash equilibria. By introducing control players, strategically positioned within the game, optimized control is facilitated over the evolutionary trajectory, ultimately leading to convergence towards an optimal outcome. Finally, these concepts are illustrated with a practical example within theĀ paper.