Problem #PRU-102818

Problems Set theory and logic Theory of algotithms Game theory Symmetric strategies

Problem

A two-player game with matches. There are 37 matches on the table. In each turn, a player is allowed to take no more than 5 matches. The winner of the game is the player who takes the final match. Which player wins, if the right strategy is used?