https://h30306.github.io/blog/tags/game-theory/Recent content in Game-Theory onHugo -- gohugo.ioenhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungSun, 01 Feb 2026 00:00:00 +0000https://h30306.github.io/blog/leetcode/leetcode-3828/Sun, 01 Feb 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-3828/LeetCode 3828 note: Alice can leave only the first or last element on her first move, guaranteeing max(first, last); Bob can likewise keep only an end, and one deletion changes at most one end, so the answer is max(first, last)https://h30306.github.io/blog/leetcode/leetcode-3627/Sun, 27 Jul 2025 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-3627/LeetCode 3627 note: after sorting, each group takes the two largest and the smallest, with the second largest as the median; the answer takes every other value from the end, n / 3 of themhttps://h30306.github.io/blog/leetcode/leetcode-1025/Tue, 27 Sep 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-1025/LeetCode 1025 note: dp[i] holds when some divisor x of i makes dp[i - x] a loss; observing the pattern, the answer is simply whether n is evenhttps://h30306.github.io/blog/leetcode/leetcode-292/Tue, 23 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-292/LeetCode 292 note: whoever faces a multiple of 4 stones loses, so the first player wins when n % 4 != 0