Two players. They take turns. Both play perfectly. Who wins? I'll show you how to model games as DP (dynamic programming) problems. You'll learn the minimax principle: on my turn I find the largest, on your turn you reduce.
The DP state captures the game position, and transitions represent possible moves. By the end, you'll solve problems where two players compete over arrays, stones, or numbers, and you'll know how to compute the winner when both sides play optimally.