Player 2 wins if the # of objects=1(mod3) Otherwise, Player 1 wins Ex.) Poison with 2009 objects 2009/3=669.66667 2009=2(mod3) Player 1 should have a winning strategy
Player 2 wins!
Winning Strategy If you are Player 2 when there are 10 objects, you would like to continue having it be your turn when # of objects=1(mod3) Therefore, your strategy is always to do the opposite of what your opponent does ie.) If the other player takes 1, you take 2. If the other player takes 2, you take 1.
Game Variants The variants of Poison are often called Nim Variants: Vary the number of objects Vary number of objects allowed to take per turn Nim Heaps – Piles of objects, on your turn you can remove any number of objects from a single pile, including the whole pile.
Game Theory and Adaptive Learning Can we write a program to train a computer to figure out the best strategy to play a game? Idea: - Start by picking moves randomly - Let the computer play game many times - Reward the moves that lead to a win and punish those leading to loss by weighting the “move” options
Conclusions You are now a Poison grand master and can always win (provided you can talk the other person to going first!) Computational game theory is an exciting area of mathematics with many interesting applications