The article presents a new algorithm for finding Nash equilibrium in games, which is a key concept in game theory. The algorithm can find the best strategy for all players involved, even when they all start playing at the same time. By using this algorithm, we can identify different types of equilibria in various games. The research shows that some games have only one equilibrium, some have none, and others have multiple equilibria. This algorithm is versatile and can handle all these scenarios, making it a valuable tool in understanding economic and social behaviors in game theory.