Problem #PRU-103967

Problems Discrete Mathematics Algorithm Theory Theory of algorithms (other)

Problem

There is a rectangular table. Two players start in turn to place on it one pound coin each, so that these coins do not overlap one another. The player who cannot make a move loses. Who will win with the correct strategy?