On an n×n square grid, two vertices are chosen at random and a segment is drawn connecting them. As n→∞, what is the probability that the segment does not cross any vertices of this graph besides the two chosen ones?
Your answer seems reasonable.
Find out if you're right!