James Lee

Maze is a puzzle consisting of a complicated network of paths or passages. The aim is to find a path between two selected points.

A Consecutive Sudoku puzzle adds one extra constraint to the standard Sudoku grid - not only must you place 1 to 9 (or 1 to whatever the width of the puzzle is) in each row, column and bold-lined box, but also obey the white consecutive markers: White bars between squares indicate that the squares are consecutive - meaning that the numbers in these two squares have a numerical difference of '1'. For example: 1 and 2; or 4 and 5. If there is no white bar then the numbers are not consecutive.

A Consecutive Sudoku puzzle adds one extra constraint to the standard Sudoku grid - not only must you place 1 to 9 (or 1 to whatever the width of the puzzle is) in each row, column and bold-lined box, but also obey the white consecutive markers: White bars between squares indicate that the squares are consecutive - meaning that the numbers in these two squares have a numerical difference of '1'. For example: 1 and 2; or 4 and 5. If there is no white bar then the numbers are not consecutive.

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

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.

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.

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.

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.

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.

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.

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.

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.

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.

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

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

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.

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.

Maze is a puzzle consisting of a complicated network of paths or passages. The aim is to find a path between two selected points.