In empty squares enter numbers from 1 to n (n=size of the puzzle) to result in each column and row having n different numbers. The entered numbers represent the heights of the pyramids (1=the lowest pyramid, n=the highest pyramid). The numbers on the sides determine, how many pyramids are visible from this spot in each row (1=only one, highest pyramid, is visible; n=there are n visible pyramids, meaning the pyramids are aligned by height). Higher pyramids conceal lower ones. Each puzzle has exactly one solution.

Example: