##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
You've used DP for optimization. Game Theory DP handles two players taking turns with optimal moves.
Foundational minimax game theory with optimal play
Classic minimax DP with variable M parameter
State classification
Teaches optimal play and game-ending conditions
Covered with full walkthrough in this section.
Alternate picking from piles. Greedy insight when one pile dominates.
Two-player game on palindrome string. Analysis of symmetric vs asymmetric cases.
Build lexicographically smallest string. Game-like decision at each step.
Move token on permutation. DP on DAG to determine winning positions.
Subtract 1 or divide by k. Grundy number analysis with special structure.
Count paths with subtract or divide moves. DP with harmonic sums.
Transform array to geometric sequence. Minimize total changes optimally.
First player always wins with even piles. Math insight or interval DP.
Take 1 to 2M piles, M grows. Minimax DP with expanding parameter.
Take 1-3 stones from front. Classic minimax with suffix DP.
Remove square number stones. Sprague-Grundy with perfect squares.
Split row, keep smaller half. Interval DP maximizing Alice score.
Classic stone game - determine winner with optimal play. Foundation for game theory DP.
Two-player deque game - interval DP meets game theory. Maximize your score difference.
