James Lee

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.

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.

Akari (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.

Akari (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.

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

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

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

It is a 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: 2-1-3-4). The aim is to fill all white cells with the numbers from 1 to N (where N is the size of the grid). No single number can repeat in any row or column. Clues in black cells remove that number as an option in that row and column, and are not part of any straight.

Fill in the grid with 'X' or 'O' such that four consecutive 'X's and 'O's do not appear horizontally, vertically or diagonally.

Fill in the grid with 'X' or 'O' such that four consecutive 'X's and 'O's do not appear horizontally, vertically or diagonally.

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.

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.

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

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.

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.

It is a 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: 2-1-3-4). The aim is to fill all white cells with the numbers from 1 to N (where N is the size of the grid). No single number can repeat in any row or column. Clues in black cells remove that number as an option in that row and column, and are not part of any straight.

Fill in the grid with 'X' or 'O' such that four consecutive 'X's and 'O's do not appear horizontally, vertically or diagonally.

Fill in the grid with 'X' or 'O' such that four consecutive 'X's and 'O's do not appear horizontally, vertically or diagonally.

Heyawake (from Japanese, "divided rooms") is played on a rectangular grid. The grid is divided into rectangular "rooms". A rectangle, bordered by bold lines, is called a "room". Fill in cells under the following rules. The numbers indicate how many painted cells there are in a room. Rooms with no number may have any number of painted cells. White cells cannot stretch across more than two rooms in a straight line. Painted cells cannot be connected horizontally or vertically. White cells must not be separated by painted cells.