Marcus White

In Killer Sudoku, sub-regions have specified sums, and no number can be repeated within a region. This variant also called "Sums Sudoku", "Sums Number Place", "Samunamupure", "Kikagaku Nampure".

Neighbours is played on a grid of irregular shape. Some cells of the grid contain numbers. It is necessary to divide the grid into a number of connected regions of an equal number of cells. Every region contains exactly one cell with a number (or a question mark) in it, and has as many neighbours as the number indicates. Regions are neighbours when they share a part of their border.

Nurimaze ("Nurimeizu") consists of a grid divided on regions. The aim is to blacken some regions according to the following rules: - Cells with letters, circles or triangles are always white. - White cells form a path from a cell with S ("start") to a cell with G ("goal"); a path must be exactly one cell wide. - A path from S to G includes all cells with circles and no cells with triangles. - No 2 x 2 cell area within the grid can have the same color. - All white cells must form an orthogonally continuous area. - White cells must not form a loop.

Water Fun is played on a rectangular or square grid. The goal is to fill water in some parts of the grid. Numbers outside the grid show how many cells of each row and column must be filled with water. Connected areas of filled cells must have the same level of water everywhere, like in a series of tubes.

Tiger is a logic puzzle invented by Naoki Inaba (Japan). A rectangular or square grid contains circles in some cells. The goal is to divide the grid into regions of exactly four cells. Each region contains one circle.

Tenner Grid (also known as "From 1 to 10", "Zehnergitter", "Grid Ten") consists of a rectangular grid of width ten cells. The task is to fill in the grid so that every row contains the digits 0 through 9. In columns the numbers may be repeated. The bottom numbers give the sum of the numbers in column. The digits in contiguous cells (even diagonally contiguous cells) must be different.

Tatamibari is a logic puzzle invented by Nikoli. A rectangular or square grid contains 3 kinds of symbols: cross, horizontal bar, vertical bar. The goal is to divide the grid into rectangular regions. Each region contains one cell with a symbol. A region with a cross must be a square. If a region contains a horizontal bar, the region's width must be greater than its height. If a region contains a vertical bar, the region's width must be less than its height. A grid dot must not be shared by the corners of four regions.

Unlike Mosaic is a logic puzzle invented by Naoki Inaba (Japan). A rectangular or square grid contains circles in some cells. The goal is to divide the grid into rectangular regions. Each region contains one circle. Black cells do not belong to any region. Regions of the same size must not share an edge.

Shirokuro is a logic puzzle invented by Nikoli. It contains white and black circles. The task is to connect each white circle with a black circle by a horizontal or vertical line. Lines are not allowed to cross other lines. The line between two circles may not pass through other circles.

CalcuDoku is a mathematical and logical puzzle loosely similar to sudoku. It was invented by a Japanese mathematics teacher Tetsuya Miyamoto. The objective is to fill the grid in with the digits 1 through N (where N is the number of rows or columns in the grid) such that: - Each row contains exactly one of each digit. - Each column contains exactly one of each digit. - Each bold-outlined group of cells (block) contains digits which achieve the specified result using the specified mathematical operation: addition (+), subtraction (-), multiplication ( ), and division ( ). - Unlike Killer Sudoku, digits may repeat within a block.

Lighthouse Battleships combines Battleships with Lighthouses puzzle. A cell with a number is a lighthouse, and it indicates the total number of ship pieces that are in the same row or column as the lighthouse. Ships cannot touch each other or the lighthouses, not even diagonally.

Sun and Moon ("Munraito") is a logic puzzle invented by Naoki Inaba (Japan). A square grid contains planets in some cells. The goal is to place exactly one star and one stardust cloud into each row and each column of the grid. If a particular semicircle of a planet is illuminated, there must be a star in that rank to light it. A star shines horizontally and vertically only; planets and stardust clouds block starlight.

Bright Light is played on a rectangular or square grid. It contains black cells with numbers. The number in the cell represents how many stars can be seen from this cell. A star is visible from the black cell, if it is in the same row or column as this cell, but not behind other black cells.

Lighthouses is played on a rectangular or square grid. It contains black cells with numbers ("lighthouses"). The number in the cell represents the number of ships lit by the lighthouse. A ship is lit if it is in the same row or column as the lighthouse, also ships behind other ships or lighthouses. Each ship is lit by at least one lighthouse. The ships are placed so that no ship touches any other ship or lighthouse, not even diagonally.

Kuromasu (from Japanese "kuromasu wa doko da", literally "Where is black cells?"; also known as "Kurodoko") is played on a rectangular grid. Some of these cells have numbers in them. Each cell may be either black or white. The object is to determine what type each cell is.The following rules determine which cells are which: - Each number on the board represents the number of white cells that can be seen from that cell, including itself. A cell can be seen from another cell if they are in the same row or column, and there are no black cells between them in that row or column.- Numbered cells may not be black. - No two black cells may be horizontally or vertically adjacent. - All the white cells must be connected horizontally or vertically.

Triplets ("One or All") is a logic puzzle invented by Naoki Inaba (Japan). The task consists of a rectangular or square grid divided into regions of exactly three cells. Some cells contain figures of 3 kinds: squares, circles, triangles. The goal is to fill in each cell with figures. Each region must contain all identical or all different figures. When two figures are orthogonally adjacent across a region boundary, the figures must be different.