Art gallery problem

Also called Minimum guard problem, guarding polygons, minimum guard problem, museum problem, point guard problem, polygon guarding problem, vertex guard problem.

Find the minimum number of guards placed in a polygon so that every point is visible to some guard.

About this page

The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.

Ladder	Level	What the next level needs
Human proof	H0 no proof	add a proof in proofs/ (06.5)
Lean	L0 no Lean part	name a Lean module in the lean field (07)
Visual	V0 none	add viz/scene.ts or a figure (10)
Writing	W0 stub	Definition one source with a locator

Tag 9KMKQ5 Edit this page History Report an error