From WPC unofficial wiki


Divide the grid into regions so that each region contains exactly two numbers. For each region, one of its numbers is greater than its size and the other is smaller.

(Rules and example from WPC 2019 IB)

History of the puzzle[edit]

Invented by Masatoshi Kengo (Japan) in 2007.[1] First appeared on 2nd round of 2007 Japanese Nationals. Original name 相ダ部屋 "aidabeya" is a pun on 相部屋 "aibeya" ("to share a room") and 間 "aida" ("between").

The name Araf was given by Serkan Yürekli (Turkey). It means "purgatory" in Turkish.



Invented by Prasanna Seshadri (India). First appeared on WPC 2017/Round 20.

Divide the grid into some regions containing four circles each. Each cell is part of one region. Each region must have an area that is strictly between the smallest and the largest of the numbers in the circles contained in it. Further to this, each region must also be divided into two sub-regions, each containing exactly two given numbers, and each having an area strictly between the two numbers they contain.

(Rules and example from WPC 2017 IB)

Appearances in the past WPCs[edit]


  1. Toketa, volume 2, 91