Problem #WSP-000204

Problems Discrete Mathematics Algorithm Theory Game theory Winning and loosing positions

Problem

Two goblins, Krok and Grok, are playing a game with a pile of gold. Each goblin takes a positive number of coins, at most 9, from the pile. They take turns one after another. There are 3333 coins in total and the goblin who takes the last coin wins. Who will win if Krok goes first?