We have a square of side 1 and a number ℓ such that 0<ℓ<2. Two players A and B, in turn, draw in the square an open segment (without its two ends) of length ℓ, starts A. Each segment after the first cannot have points in common with the previously drawn segments. He loses the player who cannot make his play. Determine if either player has a winning strategy. geometrycombinatoricsgamesegmentssquaregame strategywinning strategy