Alexander Rodriguez

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

Killer Sudoku is a mix of Sudoku and Kakuro. Your goal is the same as in regular sudoku: fill every row, column and 5x2 region with the numbers 1-10 once. The difference is how you arrive at those numbers. The objective is to fill the grid with numbers from 1 to 10 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 10 cells.

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.

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

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.

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.

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.

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 rules of Jigsaw Sudoku are similar to standard Sudoku, since you must place each of the numbers 1 to 9 (or 1 to whatever the size of the puzzle is) into each of the rows and columns. However whereas standard Sudoku also has rectangular boxes that must each contain every number, in Jigsaw Sudoku these boxes are replaced by different bold-lined shapes that must each contain every number instead.

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.

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

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.

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

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.

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.