From WPC unofficial wiki
Jump to navigation Jump to search


Lookouts Example.png Lookouts Example Solution.png

Divide the grid into regions of given sizes. Each number indicates the total number of cells within its region that can be seen horizontally or vertically from that cell, including the numbered cell itself. All numbers that are maximal within their region are given, and no other numbers are given.

(Rules and Example from WPC 2019 IB)

History of the puzzle[edit]

Invented by Roland Voigt (Germany) in 2013. First appeared on Hausigel Contest Series.

Appearances in the past WPCs[edit]