Rules: Shade some cells in the grid to form blocks of any shape.
1. Each block must contain exactly one number or a question mark.
2. A number indicates the size of the block that contains it.
3. Diagonally adjacent blocks form a chain. A chain cannot contain two identically shaped blocks, counting rotations and reflections as the same.
4. All blocks must be diagonally adjacent to at least one other block.
Rules: Trace a loop that does not intersect itself and visits each given circle and each given diamond. If two circles are visited successively, the path of the loop visits two or more empty cells between them. If two diamonds are visited successively, the path of the loop turns in two or more white cells between them. Between a circle and a diamond that the loop visits successively, it turns in one cell.
Rules: Shade some cells in the grid to form blocks of any shape.
1. Each block must contain exactly one number or a question mark.
2. A number indicates the size of the block that contains it.
3. Diagonally adjacent blocks form a chain. A chain cannot contain two identically shaped blocks, counting rotations and reflections as the same.
4. All blocks must be diagonally adjacent to at least one other block.
Rules: Shade some cells such that each outlined region contains two or more groups of orthogonally connected shaded cells of the same size but different shapes. There cannot be any other shaded cells. Shaded cell groups across regions can only touch diagonally, while they must all be connected to each other diagonally within a region. Given numbers indicate shaded cells part of a group of that size. Each group contains one or no given number.
Rules: Divide the grid along the gridlines into some regions, and fill each of the empty hexagonal cells with a number. When two cells containing the same number are adjacent, they must belong to the same region. Given numbers represent the area of the region they belong to. A region may contain none, or one or more of the givens
Rules: Insert a number in some cells so that each outlined area contains at least one number. Each number represents the number of cells containing a number in that area. Two numbers connecting across a region boundary must be unequal. All numbers, including the givens, must form one or more connected areas with no 2x2 areas of numbered cells. Each such area is a universe, with two or more regions, and with no two regions containing the same number allowed to have identical arrangement of the numbers. Some numbers may already be given. The multiverse is a network of diagonally connected universes, with no universe isolated. A region cannot belong to two or more universes.
Rules: Insert a number in some cells so that each outlined area contains at least one number. Each number represents the number of cells containing a number in that area. Two numbers connecting across a region boundary must be unequal. All numbers, including the givens, must form one, connected area with no 2x2 areas of numbered cells. Also, conversely, no 2x2 area can have all empty cells. Some numbers may already be given.
Rules: Insert a number in some cells so that each outlined area contains at least one number. Each number represents the number of cells containing a number in that area. Two numbers connecting across a region boundary must be consecutive. All numbers, including the givens, must form one, connected area with no 2x2 areas of numbered cells. Some numbers may already be given.
Rules: Place X instances of X, and Y instances of Y, into each region, one number per cell, X <> Y. In the end, all cells containing numbers must form a single connected group, with no 2x2 group of cells filled completely, and every number reachable from every other number through orthogonal paths. Within a region, two equal numbers may or may not occupy adjacent cells, but two different numbers can never occupy adjacent cells.
Theme: Slow Ascension
Rules: Insert a number in some cells so that each outlined area contains at least one number. Each number represents the number of cells containing a number in that area. Two numbers connecting across a region boundary must be different. All numbers, including the givens, must form one, connected area with no 2x2 areas of numbered cells. Some numbers may already be given. As an exception, one number doesn't follow the rule across region borders. For example, if it is the number '1', at least one instance of that number in each such region is adjacent to another from an adjoining region.
Rules: Construct straight line paths in each region outlined in bold.
- Each path begins in the given circle, passes horizontally or vertically through cell centres, and ends in a cell in the same region.
- Paths do not touch one another across regions, not even at a point.
- Paths have different and consecutive lengths starting from 1, measured from cell centre to cell centre.
- Each path is identical to the one that is one shorter than it, compared up to that shorter length.
About : This puzzle type was invented by Anurag Sahay.
About : This puzzle type was invented by Anurag Sahay.