1. Every pair of nests belongs to one pair of herons. Draw a flight path between the two nests of every pair. A path steps from one cell to the next, up and down or left and right, never diagonally, and it never runs beside itself: no cell of a path may touch another cell of the same path except the one before it and the one after it.
2. Paths never cross. Two different pairs never share a cell, so once a cell belongs to one path it is closed to every other.
3. Every cell of the marsh is used. No cell is left over when the marsh is finished; when every pair is joined and every cell is used, the game notices by itself.


