Alexander Rodriguez

Kropki Sudoku puzzles add black (o) and white (o) circles to a regular Sudoku puzzle. All pairs of touching squares which contain consecutive values (such as 2 & 3 or 6 & 7) are marked with a white circle: o. Also, all pairs of touching squares which contain values where one number is exactly twice the value of the other (such as 2 & 4, or 4 & 8) are marked with a black circle: o. This applies to left/right, up/down touching only - there are no diagonal markers. All possible o and o are given, so if there is no circle between two touching squares then they are not consecutive and one is not double the value of the other.

Kropki Sudoku puzzles add black (o) and white (o) circles to a regular Sudoku puzzle. All pairs of touching squares which contain consecutive values (such as 2 & 3 or 6 & 7) are marked with a white circle: o. Also, all pairs of touching squares which contain values where one number is exactly twice the value of the other (such as 2 & 4, or 4 & 8) are marked with a black circle: o. This applies to left/right, up/down touching only - there are no diagonal markers. All possible o and o are given, so if there is no circle between two touching squares then they are not consecutive and one is not double the value of the other.

The goal is to place three mines in every row, column and region. The digits in the grid represent the number of mines in the neighbouring grids.

Slitherlink is a logic puzzle is played on a rectangular lattice of dots. Some of the squares formed by the dots have numbers inside them. The objective is to connect horizontally and vertically adjacent dots so that the lines form a simple loop with no loose ends. In addition, the number inside a square represents how many of its four sides are segments in the loop.

Place the given number of mines into empty cells in the grid such that the numbers in the grid represent the number of mines in the neighboring cells, including diagonal ones.

Place the given number of mines into empty cells in the grid such that the numbers in the grid represent the number of mines in the neighboring cells, including diagonal ones.

Place the given number of mines into empty cells in the grid such that the numbers in the grid represent the number of mines in the neighboring cells, including diagonal ones.

Place the given number of mines into empty cells in the grid such that the numbers in the grid represent the number of mines in the neighboring cells, including diagonal ones.

Linesweeper - logic puzzle game. A task is a square or rectangular grid. The object is to create a single continuous non-intersecting loop that connects the centers of the grid cells. The numbered cells can't be passed through; the number in the cell means how many of the 8 surrounding cells should contain some part of the solution path. (For example, "0" means the 8 surrounding cells can't be passed through at all).

Each puzzle is based on a rectangular arrangement of islands where the number in each island tells how many bridges are connected to it. The object is to connect all islands according to the number of bridges so: There are no more than two bridges in the same direction. Bridges can only be vertical or horizontal and are not allowed to cross islands or other bridges. When completed, all bridges are interconnected enabling passage from any island to another.

Each puzzle is based on a rectangular arrangement of islands where the number in each island tells how many bridges are connected to it. The object is to connect all islands according to the number of bridges so: There are no more than two bridges in the same direction. Bridges can only be vertical or horizontal and are not allowed to cross islands or other bridges. When completed, all bridges are interconnected enabling passage from any island to another.

Place numbers of the given range in the grid 6x6 such that every row and column contains each number exactly once. Inequality constraints must be satisfied. The open end of the sign denotes the greater number.

Each cell should contain a zero or a one. No more than two similar numbers below or next to each other are allowed. Each row and each column is unique and contains as many zeros as ones.

Each cell should contain a zero or a one. No more than two similar numbers below or next to each other are allowed. Each row and each column is unique and contains as many zeros as ones.

Each cell should contain a zero or a one. No more than two similar numbers below or next to each other are allowed. Each row and each column is unique and contains as many zeros as ones.

Yajilin is played on a rectangular grid of squares. At the beginning, cells are either indicative (containing a number and an arrow pointing "up", "down", "left," or "right") or empty. Black cells, an additional cell type, may be discovered during the solving process. The goal is to draw a single continuous non-intersecting loop that passes through each cell that is neither black nor indicative. The loop must "enter" each cell from the centre of one of its four sides and "exit" from a different side; all turns are 90 degrees. For each indicative cell, its number indicates the count of the black cells that lie in that row or column in the direction of its arrow. Indicative cells can never be black, and do not count as a black cell for the purpose of satisfying other indicative cells, although the loop cannot pass through them. Every non-indicative cell is either black or contains a segment of the loop. Every indicative cell is accurate. For example, if an indicative cell has an arrow that points to the left and the number '3', there must be exactly 3 black cells to the left of that indicative cell in the same row. Black cells do not touch each other orthogonally (they do not share a side). There may be black cells that are not accounted for by the indicative cells.

Yajilin is played on a rectangular grid of squares. At the beginning, cells are either indicative (containing a number and an arrow pointing "up", "down", "left," or "right") or empty. Black cells, an additional cell type, may be discovered during the solving process. The goal is to draw a single continuous non-intersecting loop that passes through each cell that is neither black nor indicative. The loop must "enter" each cell from the centre of one of its four sides and "exit" from a different side; all turns are 90 degrees. For each indicative cell, its number indicates the count of the black cells that lie in that row or column in the direction of its arrow. Indicative cells can never be black, and do not count as a black cell for the purpose of satisfying other indicative cells, although the loop cannot pass through them. Every non-indicative cell is either black or contains a segment of the loop. Every indicative cell is accurate. For example, if an indicative cell has an arrow that points to the left and the number '3', there must be exactly 3 black cells to the left of that indicative cell in the same row. Black cells do not touch each other orthogonally (they do not share a side). There may be black cells that are not accounted for by the indicative cells.

Numbricks puzzles are similar to Hidato. The most important difference is that it is only possible to move 1 node left, right, up, or down. It is played on a rectangular grid of squares. Some of the cells have numbers in them. The object is to fill in the missing numbers, in sequential order, going horizontally and vertically only. Diagonal paths are not allowed.

Numbricks puzzles are similar to Hidato. The most important difference is that it is only possible to move 1 node left, right, up, or down. It is played on a rectangular grid of squares. Some of the cells have numbers in them. The object is to fill in the missing numbers, in sequential order, going horizontally and vertically only. Diagonal paths are not allowed.

Killer Sudoku is a mix of Sudoku and Kakuro. Your goal is the same as in regular sudoku: fill every row, column and 3x3 region with the numbers 1-9 once. The difference is how you arrive at those numbers. The objective is to fill the grid with numbers from 1 to 9 in a way that the following conditions are met: Each row, column, and nonet contains each number exactly once. The sum of all numbers in a cage must match the small number printed in its corner. No number appears more than once in a cage. (This is the standard rule for killer sudokus, and implies that no cage can include more than 9 cells.)