In this paper, we study a theoretical math problem of game theory and calculus of variations in which we minimize a functional involving two players. A general relationship between the optimal strategies for both players is presented, followed by computer analysis as well as polynomial approximation. Nash equilibrium strategies are determined through algebraic manipulation and linear programming. Lastly, a variation of the game is also investigated.