Trio Cut

From WPC unofficial wiki
Revision as of 20:23, 27 October 2022 by EctoPLASMA (talk | contribs) (Created page with "==Rules== {{Examples|Trio Cut}} Shade some cells to make some triominos so that each triomino will be cut twice by thick lines. In each region, exactly three cells are shaded. (Example from WPC 2015 IB) ==History of the puzzle== Invented by Ko Okamoto (Japan). First appeared on an online contest [https://logicmastersindia.com/lmitests/?test=M201205P No Numbers], held in May 2012. ==Appearances in the past WPCs== *WPC 2015/Round 10 by Vladimir Portugalov Catego...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Rules[edit]

Shade some cells to make some triominos so that each triomino will be cut twice by thick lines. In each region, exactly three cells are shaded.

(Example from WPC 2015 IB)

History of the puzzle[edit]

Invented by Ko Okamoto (Japan). First appeared on an online contest No Numbers, held in May 2012.

Appearances in the past WPCs[edit]