A planar polygonal billiard ¶ is said to have the finite blocking property
if for every pair (O,A) of points in ¶ there exists a finite number of
``blocking'' points B1,...,Bn such that every billiard trajectory from
O to A meets one of the Bi's. As a counter-example to a theorem of
Hiemer and Snurnikov, we construct a family of rational billiards that lack the
finite blocking property.Comment: 5 pages, 3 figure