1973: Václav Chvátal proves that ⌊n/3⌋ (the integer value of n/3) is the upper bound for the number of guards needed to watch a one store museum whose floor plan is an n-sided-polygon.
1978: Steve Fisk gives an algorithm for positioning the guards in ⌊n/3⌋ (the integer value of n/3) of the n vertices
To the MNS presentation