Nurikabe minicubes: the Headache, the Panache, the ApacheHexagonal KurokuronStatue Park: Knight's LinesStatue...
Assign every word from a line to a variable
Finding partition with maximum number of edges between sets
Is my sink P-trap too low?
hyperref warns when using cleveref in section
How can I prevent my AC condensate pipe from making my soil soggy?
What's the benefit of prohibiting the use of techniques/language constructs that have not been taught?
Nurikabe minicubes: the Headache, the Panache, the Apache
How to make classical firearms effective on space habitats despite the coriolis effect?
Why does an orbit become hyperbolic when total orbital energy is positive?
How to publish superseding results without creating enemies
How much would a 1 foot tall human weigh?
Why don't Wizards use wrist straps to protect against disarming charms?
Bash awk command with quotes
Why does Kubuntu 19.04 show an update that apparently doesn't exist?
An ES6 array of numbers - Double last number, delete the first number
License of project files created with Blender
Make 2019 with single digits
Is there a tool to measure the "maturity" of a code in Git?
What are the advantages and disadvantages of tail wheels that cause modern airplanes to not use them?
Are there objective criteria for classifying consonance v. dissonance?
What was the ultimate objective of The Party in 1984?
What organs or modifications would be needed for a life biological creature not to require sleep?
Shouldn't countries like Russia and Canada support global warming?
Pronunciation of "солнце"
Nurikabe minicubes: the Headache, the Panache, the Apache
Hexagonal KurokuronStatue Park: Knight's LinesStatue View: 2, 3, 5, 73D Statue Park: U shapesMixed-breeds are puzzles too!Yajilin minicubes: the Hullabaloo, the Brouhaha, the BangarangHeyawake: An Introductory PuzzleHeyawacky: Ace of CupsHeyacrazy: CareeningYajilin minicubes: the Poppycock, the Balderdash, the Gobbledygook
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ margin-bottom:0;
}
$begingroup$
These are three-dimensional Nurikabe puzzles. In each case, the four squares represent the layers of a $4times4times4$ cube. The goal is to shade some cells in each layer so that the resulting space satisfies the rules1 of Nurikabe:
- Numbered cells cannot be shaded.
- Unshaded cells are divided into regions, all of which contain exactly one number. The number indicates how many cells there are in that unshaded region.
- Regions of unshaded cells cannot be adjacent to one another, but they may touch at a corner or along an edge.
- Shaded cells must all be orthogonally connected in 3D space.
- There are no groups of shaded cells that form a $2times2times1$ cuboid in any dimension.
1 Paraphrased from the original rules on Nikoli
grid-deduction three-dimensional
asked 8 hours ago
jafejafe
36k5 gold badges99 silver badges359 bronze badges
$endgroup$
add a comment
|
$begingroup$
These are three-dimensional Nurikabe puzzles. In each case, the four squares represent the layers of a $4times4times4$ cube. The goal is to shade some cells in each layer so that the resulting space satisfies the rules1 of Nurikabe:
- Numbered cells cannot be shaded.
- Unshaded cells are divided into regions, all of which contain exactly one number. The number indicates how many cells there are in that unshaded region.
- Regions of unshaded cells cannot be adjacent to one another, but they may touch at a corner or along an edge.
- Shaded cells must all be orthogonally connected in 3D space.
- There are no groups of shaded cells that form a $2times2times1$ cuboid in any dimension.
1 Paraphrased from the original rules on Nikoli
grid-deduction three-dimensional
asked 8 hours ago
jafejafe
36k5 gold badges99 silver badges359 bronze badges
$endgroup$
add a comment
|
$begingroup$
These are three-dimensional Nurikabe puzzles. In each case, the four squares represent the layers of a $4times4times4$ cube. The goal is to shade some cells in each layer so that the resulting space satisfies the rules1 of Nurikabe:
- Numbered cells cannot be shaded.
- Unshaded cells are divided into regions, all of which contain exactly one number. The number indicates how many cells there are in that unshaded region.
- Regions of unshaded cells cannot be adjacent to one another, but they may touch at a corner or along an edge.
- Shaded cells must all be orthogonally connected in 3D space.
- There are no groups of shaded cells that form a $2times2times1$ cuboid in any dimension.
1 Paraphrased from the original rules on Nikoli
grid-deduction three-dimensional
asked 8 hours ago
jafejafe
36k5 gold badges99 silver badges359 bronze badges
$endgroup$
These are three-dimensional Nurikabe puzzles. In each case, the four squares represent the layers of a $4times4times4$ cube. The goal is to shade some cells in each layer so that the resulting space satisfies the rules1 of Nurikabe:
- Numbered cells cannot be shaded.
- Unshaded cells are divided into regions, all of which contain exactly one number. The number indicates how many cells there are in that unshaded region.
- Regions of unshaded cells cannot be adjacent to one another, but they may touch at a corner or along an edge.
- Shaded cells must all be orthogonally connected in 3D space.
- There are no groups of shaded cells that form a $2times2times1$ cuboid in any dimension.
1 Paraphrased from the original rules on Nikoli
grid-deduction three-dimensional
grid-deduction three-dimensional
asked 8 hours ago
jafejafe
36k5 gold badges99 silver badges359 bronze badges
asked 8 hours ago
jafejafe
36k5 gold badges99 silver badges359 bronze badges
asked 8 hours ago
jafejafe
36k5 gold badges99 silver badges359 bronze badges
asked 8 hours ago
jafejafe
36k5 gold badges99 silver badges359 bronze badges
asked 8 hours ago
jafejafe
36k5 gold badges99 silver badges359 bronze badges
36k5 gold badges99 silver badges359 bronze badges
add a comment
|
add a comment
|
1 Answer
1
active
oldest
votes
$begingroup$
In all three explanations, I'll use "LxRyCz" to refer to layer X, row Y, column Z (all counted starting from 1, left-to-right or top-to-bottom). The directions will be "left/right/up/down" within a layer, and "back/forward" between layers -- the first layer is the "front", and the last layer is the "back".
Puzzle 1
The obvious place to start is with the size-1 regions:
Some empty cells were formed because they would make 2x2x1 cuboids.
Next, some empty cells can only be accessed by certain regions:
specifically, the two in layer 3. This forces some more empty cells:
And we've completed more regions, and forced some more unshaded cells:
and the rest resolves with the same techniques.
Puzzle 2
Start with the same techniques as before: finish the size-1 regions, and mark walls in any cells that would connect two regions.
Some regions now have only one way to extend:
the 2 and 3 in the front layer, the 4 in the third layer, and the 3 in the back layer. Each of those regions can be finished off.
Now we've incidentally finished a region by forced empty cells: block it off and mark any newly arising almost-2×2×1s.
Finally, there's one last deduction to finish the puzzle off:
Something has to reach the bottom-left of the front layer. The only region that can do that is the 5, meaning it has to go up through L(2-3)R4C2. That takes up four of its five cells:
and the remaining one has to be used to block a 2x2x1 in the back-bottom-right.
Puzzle 3
Once again, finish off the 1-regions and shade any cell that would connect two rooms.
Some regions have only one way to extend now: do that.
Now, there's a...
cell that can't be reached: the very front-top-left cell. Once that is taken care of, and the front 3 extends upwards into L1R2C2, there are a few more unreachable cells in layer 1, and one in layer 2 at L2R2C3.
The last cell in the previous step forms another almost-2×2×1. This completes a region:
and another unshaded cell is forced, in the top right of the first layer.
The rest of the puzzle resolves just by repeatedly completing regions and checking for new unshaded cells.
answered 6 hours ago
Deusovi♦Deusovi
75.2k8 gold badges259 silver badges328 bronze badges
$endgroup$
$begingroup$
For puzzle 1, doesn't the $7$ region have $6+2 = 8$ cells? Also, the shaded cell in the upper left corner of the third layer doesn't seem connected to any other shaded cell.
$endgroup$
– Jens
6 hours ago
$begingroup$
@Jens Whoops, you're right - accidentally marked the top-left of the second layer unshaded instead of shaded. Thanks for pointing it out!
$endgroup$
– Deusovi♦
5 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%2f89110%2fnurikabe-minicubes-the-headache-the-panache-the-apache%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$
In all three explanations, I'll use "LxRyCz" to refer to layer X, row Y, column Z (all counted starting from 1, left-to-right or top-to-bottom). The directions will be "left/right/up/down" within a layer, and "back/forward" between layers -- the first layer is the "front", and the last layer is the "back".
Puzzle 1
The obvious place to start is with the size-1 regions:
Some empty cells were formed because they would make 2x2x1 cuboids.
Next, some empty cells can only be accessed by certain regions:
specifically, the two in layer 3. This forces some more empty cells:
And we've completed more regions, and forced some more unshaded cells:
and the rest resolves with the same techniques.
Puzzle 2
Start with the same techniques as before: finish the size-1 regions, and mark walls in any cells that would connect two regions.
Some regions now have only one way to extend:
the 2 and 3 in the front layer, the 4 in the third layer, and the 3 in the back layer. Each of those regions can be finished off.
Now we've incidentally finished a region by forced empty cells: block it off and mark any newly arising almost-2×2×1s.
Finally, there's one last deduction to finish the puzzle off:
Something has to reach the bottom-left of the front layer. The only region that can do that is the 5, meaning it has to go up through L(2-3)R4C2. That takes up four of its five cells:
and the remaining one has to be used to block a 2x2x1 in the back-bottom-right.
Puzzle 3
Once again, finish off the 1-regions and shade any cell that would connect two rooms.
Some regions have only one way to extend now: do that.
Now, there's a...
cell that can't be reached: the very front-top-left cell. Once that is taken care of, and the front 3 extends upwards into L1R2C2, there are a few more unreachable cells in layer 1, and one in layer 2 at L2R2C3.
The last cell in the previous step forms another almost-2×2×1. This completes a region:
and another unshaded cell is forced, in the top right of the first layer.
The rest of the puzzle resolves just by repeatedly completing regions and checking for new unshaded cells.
answered 6 hours ago
Deusovi♦Deusovi
75.2k8 gold badges259 silver badges328 bronze badges
$endgroup$
$begingroup$
For puzzle 1, doesn't the $7$ region have $6+2 = 8$ cells? Also, the shaded cell in the upper left corner of the third layer doesn't seem connected to any other shaded cell.
$endgroup$
– Jens
6 hours ago
$begingroup$
@Jens Whoops, you're right - accidentally marked the top-left of the second layer unshaded instead of shaded. Thanks for pointing it out!
$endgroup$
– Deusovi♦
5 hours ago
add a comment
|
$begingroup$
In all three explanations, I'll use "LxRyCz" to refer to layer X, row Y, column Z (all counted starting from 1, left-to-right or top-to-bottom). The directions will be "left/right/up/down" within a layer, and "back/forward" between layers -- the first layer is the "front", and the last layer is the "back".
Puzzle 1
The obvious place to start is with the size-1 regions:
Some empty cells were formed because they would make 2x2x1 cuboids.
Next, some empty cells can only be accessed by certain regions:
specifically, the two in layer 3. This forces some more empty cells:
And we've completed more regions, and forced some more unshaded cells:
and the rest resolves with the same techniques.
Puzzle 2
Start with the same techniques as before: finish the size-1 regions, and mark walls in any cells that would connect two regions.
Some regions now have only one way to extend:
the 2 and 3 in the front layer, the 4 in the third layer, and the 3 in the back layer. Each of those regions can be finished off.
Now we've incidentally finished a region by forced empty cells: block it off and mark any newly arising almost-2×2×1s.
Finally, there's one last deduction to finish the puzzle off:
Something has to reach the bottom-left of the front layer. The only region that can do that is the 5, meaning it has to go up through L(2-3)R4C2. That takes up four of its five cells:
and the remaining one has to be used to block a 2x2x1 in the back-bottom-right.
Puzzle 3
Once again, finish off the 1-regions and shade any cell that would connect two rooms.
Some regions have only one way to extend now: do that.
Now, there's a...
cell that can't be reached: the very front-top-left cell. Once that is taken care of, and the front 3 extends upwards into L1R2C2, there are a few more unreachable cells in layer 1, and one in layer 2 at L2R2C3.
The last cell in the previous step forms another almost-2×2×1. This completes a region:
and another unshaded cell is forced, in the top right of the first layer.
The rest of the puzzle resolves just by repeatedly completing regions and checking for new unshaded cells.
answered 6 hours ago
Deusovi♦Deusovi
75.2k8 gold badges259 silver badges328 bronze badges
$endgroup$
$begingroup$
For puzzle 1, doesn't the $7$ region have $6+2 = 8$ cells? Also, the shaded cell in the upper left corner of the third layer doesn't seem connected to any other shaded cell.
$endgroup$
– Jens
6 hours ago
$begingroup$
@Jens Whoops, you're right - accidentally marked the top-left of the second layer unshaded instead of shaded. Thanks for pointing it out!
$endgroup$
– Deusovi♦
5 hours ago
add a comment
|
$begingroup$
In all three explanations, I'll use "LxRyCz" to refer to layer X, row Y, column Z (all counted starting from 1, left-to-right or top-to-bottom). The directions will be "left/right/up/down" within a layer, and "back/forward" between layers -- the first layer is the "front", and the last layer is the "back".
Puzzle 1
The obvious place to start is with the size-1 regions:
Some empty cells were formed because they would make 2x2x1 cuboids.
Next, some empty cells can only be accessed by certain regions:
specifically, the two in layer 3. This forces some more empty cells:
And we've completed more regions, and forced some more unshaded cells:
and the rest resolves with the same techniques.
Puzzle 2
Start with the same techniques as before: finish the size-1 regions, and mark walls in any cells that would connect two regions.
Some regions now have only one way to extend:
the 2 and 3 in the front layer, the 4 in the third layer, and the 3 in the back layer. Each of those regions can be finished off.
Now we've incidentally finished a region by forced empty cells: block it off and mark any newly arising almost-2×2×1s.
Finally, there's one last deduction to finish the puzzle off:
Something has to reach the bottom-left of the front layer. The only region that can do that is the 5, meaning it has to go up through L(2-3)R4C2. That takes up four of its five cells:
and the remaining one has to be used to block a 2x2x1 in the back-bottom-right.
Puzzle 3
Once again, finish off the 1-regions and shade any cell that would connect two rooms.
Some regions have only one way to extend now: do that.
Now, there's a...
cell that can't be reached: the very front-top-left cell. Once that is taken care of, and the front 3 extends upwards into L1R2C2, there are a few more unreachable cells in layer 1, and one in layer 2 at L2R2C3.
The last cell in the previous step forms another almost-2×2×1. This completes a region:
and another unshaded cell is forced, in the top right of the first layer.
The rest of the puzzle resolves just by repeatedly completing regions and checking for new unshaded cells.
answered 6 hours ago
Deusovi♦Deusovi
75.2k8 gold badges259 silver badges328 bronze badges
$endgroup$
In all three explanations, I'll use "LxRyCz" to refer to layer X, row Y, column Z (all counted starting from 1, left-to-right or top-to-bottom). The directions will be "left/right/up/down" within a layer, and "back/forward" between layers -- the first layer is the "front", and the last layer is the "back".
Puzzle 1
The obvious place to start is with the size-1 regions:
Some empty cells were formed because they would make 2x2x1 cuboids.
Next, some empty cells can only be accessed by certain regions:
specifically, the two in layer 3. This forces some more empty cells:
And we've completed more regions, and forced some more unshaded cells:
and the rest resolves with the same techniques.
Puzzle 2
Start with the same techniques as before: finish the size-1 regions, and mark walls in any cells that would connect two regions.
Some regions now have only one way to extend:
the 2 and 3 in the front layer, the 4 in the third layer, and the 3 in the back layer. Each of those regions can be finished off.
Now we've incidentally finished a region by forced empty cells: block it off and mark any newly arising almost-2×2×1s.
Finally, there's one last deduction to finish the puzzle off:
Something has to reach the bottom-left of the front layer. The only region that can do that is the 5, meaning it has to go up through L(2-3)R4C2. That takes up four of its five cells:
and the remaining one has to be used to block a 2x2x1 in the back-bottom-right.
Puzzle 3
Once again, finish off the 1-regions and shade any cell that would connect two rooms.
Some regions have only one way to extend now: do that.
Now, there's a...
cell that can't be reached: the very front-top-left cell. Once that is taken care of, and the front 3 extends upwards into L1R2C2, there are a few more unreachable cells in layer 1, and one in layer 2 at L2R2C3.
The last cell in the previous step forms another almost-2×2×1. This completes a region:
and another unshaded cell is forced, in the top right of the first layer.
The rest of the puzzle resolves just by repeatedly completing regions and checking for new unshaded cells.
answered 6 hours ago
Deusovi♦Deusovi
75.2k8 gold badges259 silver badges328 bronze badges
edited 5 hours ago
answered 6 hours ago
Deusovi♦Deusovi
75.2k8 gold badges259 silver badges328 bronze badges
answered 6 hours ago
Deusovi♦Deusovi
75.2k8 gold badges259 silver badges328 bronze badges
answered 6 hours ago
Deusovi♦Deusovi
75.2k8 gold badges259 silver badges328 bronze badges
75.2k8 gold badges259 silver badges328 bronze badges
$begingroup$
For puzzle 1, doesn't the $7$ region have $6+2 = 8$ cells? Also, the shaded cell in the upper left corner of the third layer doesn't seem connected to any other shaded cell.
$endgroup$
– Jens
6 hours ago
$begingroup$
@Jens Whoops, you're right - accidentally marked the top-left of the second layer unshaded instead of shaded. Thanks for pointing it out!
$endgroup$
– Deusovi♦
5 hours ago
add a comment
|
$begingroup$
For puzzle 1, doesn't the $7$ region have $6+2 = 8$ cells? Also, the shaded cell in the upper left corner of the third layer doesn't seem connected to any other shaded cell.
$endgroup$
– Jens
6 hours ago
$begingroup$
@Jens Whoops, you're right - accidentally marked the top-left of the second layer unshaded instead of shaded. Thanks for pointing it out!
$endgroup$
– Deusovi♦
5 hours ago
$begingroup$
For puzzle 1, doesn't the $7$ region have $6+2 = 8$ cells? Also, the shaded cell in the upper left corner of the third layer doesn't seem connected to any other shaded cell.
$endgroup$
– Jens
6 hours ago
$begingroup$
For puzzle 1, doesn't the $7$ region have $6+2 = 8$ cells? Also, the shaded cell in the upper left corner of the third layer doesn't seem connected to any other shaded cell.
$endgroup$
– Jens
6 hours ago
$begingroup$
@Jens Whoops, you're right - accidentally marked the top-left of the second layer unshaded instead of shaded. Thanks for pointing it out!
$endgroup$
– Deusovi♦
5 hours ago
$begingroup$
@Jens Whoops, you're right - accidentally marked the top-left of the second layer unshaded instead of shaded. Thanks for pointing it out!
$endgroup$
– Deusovi♦
5 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%2f89110%2fnurikabe-minicubes-the-headache-the-panache-the-apache%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
