Install Steam
login
|
language
简体中文 (Simplified Chinese)
繁體中文 (Traditional Chinese)
日本語 (Japanese)
한국어 (Korean)
ไทย (Thai)
Български (Bulgarian)
Čeština (Czech)
Dansk (Danish)
Deutsch (German)
Español - España (Spanish - Spain)
Español - Latinoamérica (Spanish - Latin America)
Ελληνικά (Greek)
Français (French)
Italiano (Italian)
Bahasa Indonesia (Indonesian)
Magyar (Hungarian)
Nederlands (Dutch)
Norsk (Norwegian)
Polski (Polish)
Português (Portuguese - Portugal)
Português - Brasil (Portuguese - Brazil)
Română (Romanian)
Русский (Russian)
Suomi (Finnish)
Svenska (Swedish)
Türkçe (Turkish)
Tiếng Việt (Vietnamese)
Українська (Ukrainian)
Report a translation problem
4-2 is mostly about realizing that those {x} cells will usually overlap some guaranteed territory no matter where they're oriented, and when those guaranteed blues touch other {y} cells they pin that segment too far from one edge to touch it so you get some black cells too.
Look at the {4} at the bottom. No matter where you start, A,B e C will always be blue. You see, A and B solves the {2}.
Suppose you want to start from the top.
Take the {3} on the left and the {2} on the right. No matter where you start, F and G will always be blue... and now you know that H can't be blue, otherwise there would be 5 blue cells around the {4}.
https://steamhost.cn/steamcommunity_com/sharedfiles/filedetails/?id=2892513601
I'll mark what I think was the best explanation as the answer