Steam installeren
inloggen
|
taal
简体中文 (Chinees, vereenvoudigd)
繁體中文 (Chinees, traditioneel)
日本語 (Japans)
한국어 (Koreaans)
ไทย (Thai)
Български (Bulgaars)
Čeština (Tsjechisch)
Dansk (Deens)
Deutsch (Duits)
English (Engels)
Español-España (Spaans - Spanje)
Español - Latinoamérica (Spaans - Latijns-Amerika)
Ελληνικά (Grieks)
Français (Frans)
Italiano (Italiaans)
Bahasa Indonesia (Indonesisch)
Magyar (Hongaars)
Norsk (Noors)
Polski (Pools)
Português (Portugees - Portugal)
Português - Brasil (Braziliaans-Portugees)
Română (Roemeens)
Русский (Russisch)
Suomi (Fins)
Svenska (Zweeds)
Türkçe (Turks)
Tiếng Việt (Vietnamees)
Українська (Oekraïens)
Een vertaalprobleem melden
when there's only 1 single white number in the underclued grid how exactly would you work backwards, you can solve that in so many different ways that would be guranteed spots for the tiles?
It all comes down to find boxes that are forced no matter how the rest of the grid will look like.
Most of these logical steps you need to take are hard to explain and way easier to understand when you play a little bit with the grid.
The 2x2 checkerboard for example, it cant exist in a grid where all white AND all blacks connect. Just try it in a grid. The moment you connect the two corners of the same color you looped around one of the other corners and isolated that area.
And since it can never exist, you have to avoid this pattern and all cells that would end in a checkerboard pattern have to have the opposite color.
Another advanced technique(not relevant in this particular puzzle but in quite a lot of the others):
Just in general with all white and all blacks connect, think about the edge of the grid. Can it have only one color? Yes, no problem at all.
Can it have both colors? Yes, sure.
But now its getting interesting: there can never be more than one string along the edge of each color. Otherwise you would not be able to connect everything. So along the whole edge of the grid the color switches exactly two times(or not at all if the edge is just of one color). You only have one black and one white part, there cant be a second b/w part along the edge, you would always isolating areas while trying to connect different parts of the edge with the same color. So how is this useul?
Lets say you have a grid with a white cell along the edge, then there is a gap and then another white cell along the edge and somewhere else is a black cell along the edge. Now you can immediately color all cells along the edge in the gap between the two white cells white as well, there cant be a second black area.
A lot of the replies here use a lot of words for something that is very simple:
Respectfully, you don't understand how Underclued Grid works, despite your claim. If there are multiple solutions to a tile in this kind of puzzle, you CANNOT fill in that tile under any circumstance! You ONLY fill in those tiles that have one, and only one, solution. That's it. That's Underclued Grid. There are no multiple solutions to these puzzles EVER.
See that counter above the puzzle? That's the number of tiles left to place. When you haven't placed any tiles, that number shows the amount of tiles that have only one solution.
Well yeah that's kind of the point. You have to figure out what tiles exist in all possible solutions. So you have to look for tiles who have requirements that exist in all permutations of the board. I can't speak to the specific example you mentioned because you need a lot more context. If literally the only rule is the number of tiles connected to a number then yeah that's going to be tough but probably doable? Imagine every possible configuration that satisfies that rule and then only place the tiles that exist in all permutations.