Problem #PRU-98271

Problems Combinatorics Dissections, partitions, covers and tilings Dissections

Problem

On a plane there is a square, and invisible ink is dotted at a point \(P\). A person with special glasses can see the spot. If we draw a straight line, then the person will answer the question of on which side of the line does \(P\) lie (if \(P\) lies on the line, then he says that \(P\) lies on the line).

What is the smallest number of such questions you need to ask to find out if the point \(P\) is inside the square?