The prison yard problem

Zoltán Füredi, D. J. Kleitman

Research output: Contribution to journalArticle

10 Citations (Scopus)


Given a polygon II with n vertices whose sides are walls. Guards, located at vertices can see all directions, but cannot see beyond walls. We prove that at most [n/2] guards suffice to see everywhere the whole plane. If II is not convex, then [n/2] suffice.

Original languageEnglish
Pages (from-to)287-300
Number of pages14
Issue number3
Publication statusPublished - Sep 1 1994


  • AMS subject classification code (1991): 52A30

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'The prison yard problem'. Together they form a unique fingerprint.

  • Cite this