Nurikabe: SixesHexagonal KurokuronStatue Park: FiveStatue Park: Knight's LinesA Sincere Nurikabe Puzzle3D...
Why the first octet of a MAC address always end with a binary 0?
What makes a character irredeemable?
Lighthouse Alternatives
Is "weekend warrior" derogatory?
PhD Length: are shorter PhD degrees (from different countries) valued differently in other counter countries where PhD Is a longer process?
Quote to show students don't have to fear making mistakes
How to write a chemical equation for an reaction that is still fitting inside the document?
Duck, duck, gone!
How to say "respectively" in German when listing (enumerating) things
Realistically, how much do you need to start investing?
Why do personal finance apps focus on outgoings rather than income
When Vesuvan Shapeshifter copies turn face up replacement effects, why do they work?
Looking for circuit board material that can be dissolved
What does the triangle look like in this diagram?
Phonetic distortion when words are borrowed among languages
Airport Security - advanced check, 4th amendment breach
Did the Soviet army intentionally send troops (e.g. penal battalions) running over minefields?
What's the global, general word that stands for "center tone of a song"?
What is the difference between increasing volume and increasing gain?
What is the idiomatic solution in SQL Server for reserving a block of ids for use in a bulk insert?
Job interview by video at home and privacy concerns
Why does `FindFit` fail so badly in this simple case?
Parent asking for money after moving out
How to "Start as close to the end as possible", and why to do so?
Nurikabe: Sixes
Hexagonal KurokuronStatue Park: FiveStatue Park: Knight's LinesA Sincere Nurikabe Puzzle3D Statue Park: U shapesStatue Park: Apollo 11Heyawake: An Introductory PuzzleQuick Nurikabe Puzzle: $4$sNurikabe minicubes: the Headache, the Panache, the ApacheQuick Kurodoko Puzzle: Threes and Triples
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{
margin-bottom:0;
}
.everyonelovesstackoverflow{position:absolute;height:1px;width:1px;opacity:0;top:0;left:0;pointer-events:none;}
$begingroup$
This is a Nurikabe puzzle. The goal is to paint some cells black so that the resulting grid satisfies the rules1 of Nurikabe:
- Numbered cells are white.
- White cells are divided into regions, all of which contain exactly one number. The number indicates how many white cells there are in that region.
- Regions of white cells cannot be adjacent to one another, but they may touch at a corner.
- Black cells must all be orthogonally connected.
- There are no groups of black cells that form a $2times2$ square anywhere in the grid.
1 Paraphrased from the original rules on Nikoli
grid-deduction
asked 8 hours ago
jafejafe
36.3k5 gold badges101 silver badges361 bronze badges
$endgroup$
add a comment
|
$begingroup$
This is a Nurikabe puzzle. The goal is to paint some cells black so that the resulting grid satisfies the rules1 of Nurikabe:
- Numbered cells are white.
- White cells are divided into regions, all of which contain exactly one number. The number indicates how many white cells there are in that region.
- Regions of white cells cannot be adjacent to one another, but they may touch at a corner.
- Black cells must all be orthogonally connected.
- There are no groups of black cells that form a $2times2$ square anywhere in the grid.
1 Paraphrased from the original rules on Nikoli
grid-deduction
asked 8 hours ago
jafejafe
36.3k5 gold badges101 silver badges361 bronze badges
$endgroup$
add a comment
|
$begingroup$
This is a Nurikabe puzzle. The goal is to paint some cells black so that the resulting grid satisfies the rules1 of Nurikabe:
- Numbered cells are white.
- White cells are divided into regions, all of which contain exactly one number. The number indicates how many white cells there are in that region.
- Regions of white cells cannot be adjacent to one another, but they may touch at a corner.
- Black cells must all be orthogonally connected.
- There are no groups of black cells that form a $2times2$ square anywhere in the grid.
1 Paraphrased from the original rules on Nikoli
grid-deduction
asked 8 hours ago
jafejafe
36.3k5 gold badges101 silver badges361 bronze badges
$endgroup$
This is a Nurikabe puzzle. The goal is to paint some cells black so that the resulting grid satisfies the rules1 of Nurikabe:
- Numbered cells are white.
- White cells are divided into regions, all of which contain exactly one number. The number indicates how many white cells there are in that region.
- Regions of white cells cannot be adjacent to one another, but they may touch at a corner.
- Black cells must all be orthogonally connected.
- There are no groups of black cells that form a $2times2$ square anywhere in the grid.
1 Paraphrased from the original rules on Nikoli
grid-deduction
grid-deduction
asked 8 hours ago
jafejafe
36.3k5 gold badges101 silver badges361 bronze badges
asked 8 hours ago
jafejafe
36.3k5 gold badges101 silver badges361 bronze badges
asked 8 hours ago
jafejafe
36.3k5 gold badges101 silver badges361 bronze badges
asked 8 hours ago
jafejafe
36.3k5 gold badges101 silver badges361 bronze badges
asked 8 hours ago
jafejafe
36.3k5 gold badges101 silver badges361 bronze badges
36.3k5 gold badges101 silver badges361 bronze badges
add a comment
|
add a comment
|
1 Answer
1
active
oldest
votes
$begingroup$
First, any two numbered cells that are one space apart must be separated by a black cell, which gives us the top-right, and given the "all black cells must be connected" condition one straightforwardly (and stair-wise) gets to
Again, from here the continuation still follows from the same rule applied to the bottom-right, until
Now note that the orange square below cannot be white, it's too far away from any numbered cell, and therefore the red one nearby cannot be black, because of the 2x2 rule. Moreover, there is no way the red cell can be connected to another 6 than the one on its right, because the one on its right would not have 6 friends.
We therefore get this, right after a second application of the 2x2 rule:
From here, there is only one way to connect the black pieces while leaving enough space for the top 6 to have friends:
answered 8 hours ago
Arnaud MortierArnaud Mortier
5,95314 silver badges50 bronze badges
$endgroup$
2
$begingroup$
You beat me to it. I've played quite a few Nurikabes, and this one was not very hard but good fun. I must confess that at the point in your explanation with the orange square, I just saw the rest of solution without reasoning it through exactly, just by knowing the black parts had to be connected together around the remaining islands.
$endgroup$
– Jaap Scherphuis
8 hours ago
3
$begingroup$
@JaapScherphuis It was quite fun indeed! I forbid myself to "see" things, as I was scolded by Deusovi once for doing that :)
$endgroup$
– Arnaud Mortier
8 hours ago
add a comment
|
Your Answer
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "559"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/4.0/"u003ecc by-sa 4.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f89554%2fnurikabe-sixes%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
First, any two numbered cells that are one space apart must be separated by a black cell, which gives us the top-right, and given the "all black cells must be connected" condition one straightforwardly (and stair-wise) gets to
Again, from here the continuation still follows from the same rule applied to the bottom-right, until
Now note that the orange square below cannot be white, it's too far away from any numbered cell, and therefore the red one nearby cannot be black, because of the 2x2 rule. Moreover, there is no way the red cell can be connected to another 6 than the one on its right, because the one on its right would not have 6 friends.
We therefore get this, right after a second application of the 2x2 rule:
From here, there is only one way to connect the black pieces while leaving enough space for the top 6 to have friends:
answered 8 hours ago
Arnaud MortierArnaud Mortier
5,95314 silver badges50 bronze badges
$endgroup$
2
$begingroup$
You beat me to it. I've played quite a few Nurikabes, and this one was not very hard but good fun. I must confess that at the point in your explanation with the orange square, I just saw the rest of solution without reasoning it through exactly, just by knowing the black parts had to be connected together around the remaining islands.
$endgroup$
– Jaap Scherphuis
8 hours ago
3
$begingroup$
@JaapScherphuis It was quite fun indeed! I forbid myself to "see" things, as I was scolded by Deusovi once for doing that :)
$endgroup$
– Arnaud Mortier
8 hours ago
add a comment
|
$begingroup$
First, any two numbered cells that are one space apart must be separated by a black cell, which gives us the top-right, and given the "all black cells must be connected" condition one straightforwardly (and stair-wise) gets to
Again, from here the continuation still follows from the same rule applied to the bottom-right, until
Now note that the orange square below cannot be white, it's too far away from any numbered cell, and therefore the red one nearby cannot be black, because of the 2x2 rule. Moreover, there is no way the red cell can be connected to another 6 than the one on its right, because the one on its right would not have 6 friends.
We therefore get this, right after a second application of the 2x2 rule:
From here, there is only one way to connect the black pieces while leaving enough space for the top 6 to have friends:
answered 8 hours ago
Arnaud MortierArnaud Mortier
5,95314 silver badges50 bronze badges
$endgroup$
2
$begingroup$
You beat me to it. I've played quite a few Nurikabes, and this one was not very hard but good fun. I must confess that at the point in your explanation with the orange square, I just saw the rest of solution without reasoning it through exactly, just by knowing the black parts had to be connected together around the remaining islands.
$endgroup$
– Jaap Scherphuis
8 hours ago
3
$begingroup$
@JaapScherphuis It was quite fun indeed! I forbid myself to "see" things, as I was scolded by Deusovi once for doing that :)
$endgroup$
– Arnaud Mortier
8 hours ago
add a comment
|
$begingroup$
First, any two numbered cells that are one space apart must be separated by a black cell, which gives us the top-right, and given the "all black cells must be connected" condition one straightforwardly (and stair-wise) gets to
Again, from here the continuation still follows from the same rule applied to the bottom-right, until
Now note that the orange square below cannot be white, it's too far away from any numbered cell, and therefore the red one nearby cannot be black, because of the 2x2 rule. Moreover, there is no way the red cell can be connected to another 6 than the one on its right, because the one on its right would not have 6 friends.
We therefore get this, right after a second application of the 2x2 rule:
From here, there is only one way to connect the black pieces while leaving enough space for the top 6 to have friends:
answered 8 hours ago
Arnaud MortierArnaud Mortier
5,95314 silver badges50 bronze badges
$endgroup$
First, any two numbered cells that are one space apart must be separated by a black cell, which gives us the top-right, and given the "all black cells must be connected" condition one straightforwardly (and stair-wise) gets to
Again, from here the continuation still follows from the same rule applied to the bottom-right, until
Now note that the orange square below cannot be white, it's too far away from any numbered cell, and therefore the red one nearby cannot be black, because of the 2x2 rule. Moreover, there is no way the red cell can be connected to another 6 than the one on its right, because the one on its right would not have 6 friends.
We therefore get this, right after a second application of the 2x2 rule:
From here, there is only one way to connect the black pieces while leaving enough space for the top 6 to have friends:
answered 8 hours ago
Arnaud MortierArnaud Mortier
5,95314 silver badges50 bronze badges
answered 8 hours ago
Arnaud MortierArnaud Mortier
5,95314 silver badges50 bronze badges
answered 8 hours ago
Arnaud MortierArnaud Mortier
5,95314 silver badges50 bronze badges
answered 8 hours ago
Arnaud MortierArnaud Mortier
5,95314 silver badges50 bronze badges
5,95314 silver badges50 bronze badges
2
$begingroup$
You beat me to it. I've played quite a few Nurikabes, and this one was not very hard but good fun. I must confess that at the point in your explanation with the orange square, I just saw the rest of solution without reasoning it through exactly, just by knowing the black parts had to be connected together around the remaining islands.
$endgroup$
– Jaap Scherphuis
8 hours ago
3
$begingroup$
@JaapScherphuis It was quite fun indeed! I forbid myself to "see" things, as I was scolded by Deusovi once for doing that :)
$endgroup$
– Arnaud Mortier
8 hours ago
add a comment
|
2
$begingroup$
You beat me to it. I've played quite a few Nurikabes, and this one was not very hard but good fun. I must confess that at the point in your explanation with the orange square, I just saw the rest of solution without reasoning it through exactly, just by knowing the black parts had to be connected together around the remaining islands.
$endgroup$
– Jaap Scherphuis
8 hours ago
3
$begingroup$
@JaapScherphuis It was quite fun indeed! I forbid myself to "see" things, as I was scolded by Deusovi once for doing that :)
$endgroup$
– Arnaud Mortier
8 hours ago
2
2
$begingroup$
You beat me to it. I've played quite a few Nurikabes, and this one was not very hard but good fun. I must confess that at the point in your explanation with the orange square, I just saw the rest of solution without reasoning it through exactly, just by knowing the black parts had to be connected together around the remaining islands.
$endgroup$
– Jaap Scherphuis
8 hours ago
$begingroup$
You beat me to it. I've played quite a few Nurikabes, and this one was not very hard but good fun. I must confess that at the point in your explanation with the orange square, I just saw the rest of solution without reasoning it through exactly, just by knowing the black parts had to be connected together around the remaining islands.
$endgroup$
– Jaap Scherphuis
8 hours ago
3
3
$begingroup$
@JaapScherphuis It was quite fun indeed! I forbid myself to "see" things, as I was scolded by Deusovi once for doing that :)
$endgroup$
– Arnaud Mortier
8 hours ago
$begingroup$
@JaapScherphuis It was quite fun indeed! I forbid myself to "see" things, as I was scolded by Deusovi once for doing that :)
$endgroup$
– Arnaud Mortier
8 hours ago
add a comment
|
Thanks for contributing an answer to Puzzling Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f89554%2fnurikabe-sixes%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
