Given a square of side length as least 2, there are two players who must in turn place a unit radius circle into the square without overlapping any previously placed circle.
The loser is the first player who can't place a circle.
For example, if the square has side length 2 then the first player ...
I am submitting a very interesting problem from French mathematical recreation site:
http://www.diophante.fr/problemes-par-themes/g-probabilites/g2-combinatoire-denombrements/1434-g248-le-billet-universel
This is a 10 years old problem, and they gave me their consent to share it here (provided of...