From WPC unofficial wiki
Jump to navigation Jump to search


Suguru Example.png Suguru Example Solution.png

Place a digit in each empty cell such that every thickly outlined region of size N contains all digits from 1 to N. The same digits do not touch each other, even diagonally.

(Rules and example from WPC 2017 IB)

Minor variants[edit]

  • Suguru Diagonal: From WPC 2018/Round 2. Marked diagonal contains each of the numbers from 1 to the size of the grid.
  • Capsules: A different name for the puzzle; it sometimes refers to a specific variant of Suguru where all regions have a size of 5 cells.

History of the puzzle[edit]

Invented by Naoki Inaba (Japan) in 2001 under the name "ナンバーブロック" ("Number Block"). [1] The name "Suguru", a contraction of "Suji gurupu" ("Number group") is given by Puzzler Magazine (UK) since, according to them, the original name "did not sufficiently reflect the qualities of" the puzzle. [2]

Appearances in the past WPCs[edit]