Shortest opaque set (opaque forest problem)
What is the shortest system of curves that blocks every line of sight through a given shape, such as the unit square?
Summary
Stefan Mazurkiewicz introduced opaque sets in 1916, and Frederick Bagemihl posed the problem of minimising their length in 1959. For the unit square a barrier of length about 2.639 is known, but its optimality is unproven; published algorithms that claimed optimal barriers were later shown to be incorrect.
Source
Open, as listed by Wikipedia · Unsolved problems in mathematics. Checked 18 Nov 2026.
The status is the source’s. Papex does not decide whether a problem is solved.
Records on this problem
No public record addresses this problem yet.