LeetCode 843: Guess the Word
A clear explanation of the Guess the Word interactive problem using candidate filtering and minimax-style guessing.
Tag
Game-Theory
10 notes
LeetCode 913: Cat and Mouse
A clear explanation of Cat and Mouse using game states, reverse BFS, and topological propagation.
LeetCode 877: Stone Game
A clear explanation of the Stone Game problem using game theory and interval dynamic programming.
LeetCode 810: Chalkboard XOR Game
A math and bit manipulation solution for deciding whether Alice wins the XOR removal game.
LeetCode 486: Predict the Winner
A clear explanation of predicting whether Player 1 can win using minimax dynamic programming over score difference.
LeetCode 464: Can I Win
A clear explanation of solving the Can I Win game using minimax recursion, bitmask state compression, and memoization.
LeetCode 375: Guess Number Higher or Lower II
A clear explanation of finding the minimum guaranteed cost using interval dynamic programming.
LeetCode 294: Flip Game II
A recursive game theory solution with memoization for deciding whether the starting player can force a win.
LeetCode 292: Nim Game
A game theory solution for deciding whether the first player can win by using the losing-position pattern of multiples of four.
91. Game Theory, Economics, Social and Behavioral Sciences
This volume studies strategic interaction, economic systems, and quantitative models of behavior.