James Lee

Place numbers in the grid such that each row, column and 3x3 box contain the numbers 1 to 9. Outside cells must be inserted in one of the first three cells of the row or column.

AkariAkari (Light Up) is played on a rectangular grid of white and black cells. The player places light bulbs in white cells such that no two bulbs shine on each other, until the entire grid is lit up. A bulb sends rays of light horizontally and vertically, illuminating its entire row and column unless its light is blocked by a black cell. A black cell may have a number on it from 0 to 4, indicating how many bulbs must be placed adjacent to its four sides; for example, a cell with a 4 must have four bulbs around it, one on each side, and a cell with a 0 cannot have a bulb next to any of its sides. An unnumbered black cell may have any number of light bulbs adjacent to it, or none. Bulbs placed diagonally adjacent to a numbered cell do not contribute to the bulb count. FutoshikiPlace numbers of the given range in the grid 9x9 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. KakuroEach puzzle consists of a blank grid with sum-clues in various places. The object is to fill all empty squares using numbers 1 to 9 so the sum of each horizontal block equals the clue on its left, and the sum of each vertical block equals the clue on its top. In addition, no number may be used in the same block more than once. SuguruSuguru, also known as Tectonics or Number Blocks, is a Japanese puzzle invented by Naoki Inaba. The goal is to fill a given rectangular grid with numbers, so that every designated area contains a sequence of non-repeating, consecutive numbers, starting from 1 and going up. Also, adjacent (touching) cells should not contain the same number, even diagonally.

Fill the empty cells in such a way they build a chain of consecutive numbers from 1 to the marked largest number. All cells with consecutive numbers must touch each other either horizontally, vertically or diagonally.

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.

Fill the empty cells in such a way they build a chain of consecutive numbers from 1 to the marked largest number. All cells with consecutive numbers must touch each other either horizontally, vertically or diagonally.

HitoriHitori is played with a grid of squares or cells, with each cell initially containing a number. The objective is to eliminate numbers by blacking out some of the squares until no row or column has more than one occurrence of a given number. Additionally, black cells cannot be adjacent, although they can be diagonal to one another. The remaining numbered cells must be all connected to each other. CalcuDokuEach puzzle consists of a grid containing blocks surrounded by bold lines. The object is to fill all empty squares so that the numbers 1 to N (where N is the number of rows or columns in the grid) appear exactly once in each row and column and the numbers in each block produce the result shown in the top-left corner of the block according to the math operation appearing on the top of the grid. In CalcuDoku a number may be used more than once in the same block. BinaryEach 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. SuguruSuguru, also known as Tectonics or Number Blocks, is a Japanese puzzle invented by Naoki Inaba. The goal is to fill a given rectangular grid with numbers, so that every designated area contains a sequence of non-repeating, consecutive numbers, starting from 1 and going up. Also, adjacent (touching) cells should not contain the same number, even diagonally.

Place numbers of the given range in the grid 8x8 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.

Place numbers of the given range in the grid 7x7 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 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.

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.

Skyscrapers Each puzzle consists of an NxN grid with some clues along its sides. The object is to place a skyscraper in each square, with a height between 1 and N, so that no two skyscrapers in a row or column have the same number of floors. In addition, the number of visible skyscrapers, as viewed from the direction of each clue, is equal to the value of the clue. Note that higher skyscrapers block the view of lower skyscrapers located behind them. Slitherlink 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. Straights The solver is given a 9x9 grid, partially divided by black cells into compartments. Each compartment, vertically or horizontally, must contain a straight - a set of consecutive numbers, but in any order. For example: 7, 6, 4, 5 is valid, but 1, 3, 8, 7 is not. Like sudoku, the solver must fill the remaining white cells with numbers 1 to 9 (or 1 to n in puzzles with N cells per side) such that each row and column contains unique digits. Whereas Sudoku has the additional constraint of 3x3 boxes, in Str8ts rows and columns are divided by blacks cells. Additional clues are set in some of the black cells - these numbers remove that digit as an option in the row and column. Such digits do not form part of any straight. Hidoku Fill the empty cells in such a way they build a chain of consecutive numbers from 1 to the marked largest number. All cells with consecutive numbers must touch each other either horizontally, vertically or diagonally.

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.)

Place numbers of the given range in the grid 7x7 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.

Hitori Hitori is played with a grid of squares or cells, with each cell initially containing a number. The objective is to eliminate numbers by blacking out some of the squares until no row or column has more than one occurrence of a given number. Additionally, black cells cannot be adjacent, although they can be diagonal to one another. The remaining numbered cells must be all connected to each other. Minesweeper 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. Straights The solver is given a 9x9 grid, partially divided by black cells into compartments. Each compartment, vertically or horizontally, must contain a straight - a set of consecutive numbers, but in any order. For example: 7, 6, 4, 5 is valid, but 1, 3, 8, 7 is not. Like sudoku, the solver must fill the remaining white cells with numbers 1 to 9 (or 1 to n in puzzles with N cells per side) such that each row and column contains unique digits. Whereas Sudoku has the additional constraint of 3x3 boxes, in Str8ts rows and columns are divided by blacks cells. Additional clues are set in some of the black cells - these numbers remove that digit as an option in the row and column. Such digits do not form part of any straight. Suguru Suguru, also known as Tectonics or Number Blocks, is a Japanese puzzle invented by Naoki Inaba. The goal is to fill a given rectangular grid with numbers, so that every designated area contains a sequence of non-repeating, consecutive numbers, starting from 1 and going up. Also, adjacent (touching) cells should not contain the same number, even diagonally.

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.

Hitori is played with a grid of squares or cells, with each cell initially containing a number. The objective is to eliminate numbers by blacking out some of the squares until no row or column has more than one occurrence of a given number. Additionally, black cells cannot be adjacent, although they can be diagonal to one another. The remaining numbered cells must be all connected to each other.

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.)

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.