When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Strimko - Wikipedia

    en.wikipedia.org/wiki/Strimko

    Strimko is a logic number puzzle invented by the Grabarchuk Family in 2008. It is based on the idea of Latin squares described by the Swiss mathematician and physicist Leonhard Euler in the 18th century. All Strimko puzzles are solvable with pure logic; no special knowledge is required. Strimko uses only three basic elements: rows, columns, and ...

  3. Takuzu - Wikipedia

    en.wikipedia.org/wiki/Takuzu

    The rectangular grid sizes can vary greatly. Since the objective is to have equal number of both symbols in each row and column, the number of rows and columns is normally even. Though not required, grids are often square. Common sizes range from 4x4 to 20x20. [10] [11] Larger puzzles are also made, including ones that use a 30x40 grid. [12]

  4. Heyawake - Wikipedia

    en.wikipedia.org/wiki/Heyawake

    A Heyawake puzzle. Heyawake (Japanese: へやわけ, "divided rooms") is a binary-determination logic puzzle published by Nikoli. As of 2013, five books consisting entirely of Heyawake puzzles have been published by Nikoli. It first appeared in Puzzle Communication Nikoli #39 (September 1992).

  5. KenKen - Wikipedia

    en.wikipedia.org/wiki/KenKen

    As in Sudoku, the goal of each puzzle is to fill a grid with digits –– 1 through 4 for a 4×4 grid, 1 through 5 for a 5×5, 1 through 6 for a 6×6, etc. –– so that no digit appears more than once in any row or any column (a Latin square). Grids range in size from 3×3 to 9×9.

  6. Hidato - Wikipedia

    en.wikipedia.org/wiki/Hidato

    Numbrix puzzles, which appear in Parade magazine, are similar to Hidato except diagonal moves are not allowed. [9] (vos Savant has only used 7×7 and 9×9 grids). [10]Jadium puzzles (formerly Snakepit puzzles), created by Jeff Marchant, are a more difficult version of Numbrix with fewer given numbers and have appeared on the Parade web site regularly since 2014, along with a daily online ...

  7. Inshi no heya - Wikipedia

    en.wikipedia.org/wiki/Inshi_no_heya

    The puzzle starts with all the cells empty. The goal is to fill all the cells with nonzero single-digit numbers (1 through n, where n is the length of the grid's edge) such that: Solved Inshi No Heya grid The numbers in each room, when multiplied together, equal the small number in the upper left corner of the room

  8. Shikaku - Wikipedia

    en.wikipedia.org/wiki/Shikaku

    An initial configuration. A solution. Shikaku is played on a rectangular grid. Some of the squares in the grid are numbered. The objective is to divide the grid into rectangular and square pieces such that each piece contains exactly one number, and that number represents the area of the rectangle.

  9. Masyu - Wikipedia

    en.wikipedia.org/wiki/Masyu

    Like many other combinatory and logic puzzles, Masyu can be very difficult to solve; solving Masyu on arbitrarily large grids is an NP-complete problem. [2] However, published instances of puzzles have generally been constructed in such a way that they can be solved in a reasonable amount of time.