Problem #PRU-100618

Problems Discrete Mathematics Algorithm Theory Game theory Winning and loosing positions

Problem

Rekha and Misha also play with coins. They have an unlimited supply of 10p coins and a perfectly round table. In each move, one of them places a coin somewhere on that table, but not on top of any other coins already there. A person that cannot place any more coins loses. Who will win, if Rekha goes first?