MathDB

Let

A_1A_2A_3A_4

and

B_1B_2B_3B_4

be two squares such that the boundaries of

A_1A_2A_3A_4

and

B_1B_2B_3B_4

does not contain any line segment. Construct 16 line segments

A_iB_j

for each possible

i,j \in \{1,2,3,4\}

. What is the maximum number of line segments that don't intersect the edges of

A_1A_2A_3A_4

B_1B_2B_3B_4

? (intersection with a vertex is not counted). Proposed by Allen Zheng

Problem Statement