Feedback | Home
This puzzle consists of a grid with heavy outlines dividing it into a set of rectangular regions of various sizes. Some of the individual cells are to be shaded, such that no two adjacent cells are ever shaded, all the unshaded cells form a single orthogonally connected group, and in regions with a clue number, the number of shaded cells equals that number.
MIT Mystery Hunt 2007 Puzzle Editing
MIT Mystery Hunt 2011 Nik-holey
MIT Mystery Hunt 2013 Portals
MIT Mystery Hunt 2014 Magic Mushrooms
MIT Mystery Hunt 2022 Dancing Triangles