The Terrible Twos of Slitherlink
$begingroup$
This question is aimed at people who have a really good grasp of standard Slitherlink puzzles.
This is a standard, square cell, 10x10 Slitherlink puzzle I designed. It isn't what I would call a "true" Slitherlink puzzle, though.
A true Slitherlink puzzle has as its solution exactly one closed, non-intersecting "loop" that goes along the grid lines between the numbers, and satisfies the numbers in the cells: each number has the loop bordering its square on exactly that many sides. It may surprise you to find out that this puzzle can become a true Slitherlink puzzle by removing some of the "2"s from the board.
What is the least number of twos that need to be removed in order for this Slitherlink to have exactly one solution? Anybody could stumble upon the answer, so if you post an answer below, you must explain why it cannot be less than the number you found.
The above image was taken from this website which contains a powerful SAT solver for Slitherlink puzzles. I consider it fair to use such a solver for this question, but you still have to explain what is going on.
There are more questions I can ask on the topic of Slitherlink puzzles made just from twos, so if there is interest... there's more where this came from.
grid-deduction slitherlink
edited Jan 31 at 19:48
Bass
30k472185
asked Jan 31 at 15:32
Dark ThunderDark Thunder
3549
$endgroup$
add a comment |
$begingroup$
This question is aimed at people who have a really good grasp of standard Slitherlink puzzles.
This is a standard, square cell, 10x10 Slitherlink puzzle I designed. It isn't what I would call a "true" Slitherlink puzzle, though.
A true Slitherlink puzzle has as its solution exactly one closed, non-intersecting "loop" that goes along the grid lines between the numbers, and satisfies the numbers in the cells: each number has the loop bordering its square on exactly that many sides. It may surprise you to find out that this puzzle can become a true Slitherlink puzzle by removing some of the "2"s from the board.
What is the least number of twos that need to be removed in order for this Slitherlink to have exactly one solution? Anybody could stumble upon the answer, so if you post an answer below, you must explain why it cannot be less than the number you found.
The above image was taken from this website which contains a powerful SAT solver for Slitherlink puzzles. I consider it fair to use such a solver for this question, but you still have to explain what is going on.
There are more questions I can ask on the topic of Slitherlink puzzles made just from twos, so if there is interest... there's more where this came from.
grid-deduction slitherlink
edited Jan 31 at 19:48
Bass
30k472185
asked Jan 31 at 15:32
Dark ThunderDark Thunder
3549
$endgroup$
1
$begingroup$
Welcome to Puzzling SE! Also, I don't think I've seen that many twos in one puzzle! XD
$endgroup$
– North
Jan 31 at 15:34
add a comment |
$begingroup$
This question is aimed at people who have a really good grasp of standard Slitherlink puzzles.
This is a standard, square cell, 10x10 Slitherlink puzzle I designed. It isn't what I would call a "true" Slitherlink puzzle, though.
A true Slitherlink puzzle has as its solution exactly one closed, non-intersecting "loop" that goes along the grid lines between the numbers, and satisfies the numbers in the cells: each number has the loop bordering its square on exactly that many sides. It may surprise you to find out that this puzzle can become a true Slitherlink puzzle by removing some of the "2"s from the board.
What is the least number of twos that need to be removed in order for this Slitherlink to have exactly one solution? Anybody could stumble upon the answer, so if you post an answer below, you must explain why it cannot be less than the number you found.
The above image was taken from this website which contains a powerful SAT solver for Slitherlink puzzles. I consider it fair to use such a solver for this question, but you still have to explain what is going on.
There are more questions I can ask on the topic of Slitherlink puzzles made just from twos, so if there is interest... there's more where this came from.
grid-deduction slitherlink
edited Jan 31 at 19:48
Bass
30k472185
asked Jan 31 at 15:32
Dark ThunderDark Thunder
3549
$endgroup$
This question is aimed at people who have a really good grasp of standard Slitherlink puzzles.
This is a standard, square cell, 10x10 Slitherlink puzzle I designed. It isn't what I would call a "true" Slitherlink puzzle, though.
A true Slitherlink puzzle has as its solution exactly one closed, non-intersecting "loop" that goes along the grid lines between the numbers, and satisfies the numbers in the cells: each number has the loop bordering its square on exactly that many sides. It may surprise you to find out that this puzzle can become a true Slitherlink puzzle by removing some of the "2"s from the board.
What is the least number of twos that need to be removed in order for this Slitherlink to have exactly one solution? Anybody could stumble upon the answer, so if you post an answer below, you must explain why it cannot be less than the number you found.
The above image was taken from this website which contains a powerful SAT solver for Slitherlink puzzles. I consider it fair to use such a solver for this question, but you still have to explain what is going on.
There are more questions I can ask on the topic of Slitherlink puzzles made just from twos, so if there is interest... there's more where this came from.
grid-deduction slitherlink
grid-deduction slitherlink
edited Jan 31 at 19:48
Bass
30k472185
asked Jan 31 at 15:32
Dark ThunderDark Thunder
3549
edited Jan 31 at 19:48
Bass
30k472185
asked Jan 31 at 15:32
Dark ThunderDark Thunder
3549
edited Jan 31 at 19:48
Bass
30k472185
edited Jan 31 at 19:48
Bass
30k472185
edited Jan 31 at 19:48
Bass
30k472185
30k472185
asked Jan 31 at 15:32
Dark ThunderDark Thunder
3549
asked Jan 31 at 15:32
Dark ThunderDark Thunder
3549
asked Jan 31 at 15:32
Dark ThunderDark Thunder
3549
3549
1
$begingroup$
Welcome to Puzzling SE! Also, I don't think I've seen that many twos in one puzzle! XD
$endgroup$
– North
Jan 31 at 15:34
add a comment |
1
$begingroup$
Welcome to Puzzling SE! Also, I don't think I've seen that many twos in one puzzle! XD
$endgroup$
– North
Jan 31 at 15:34
1
1
$begingroup$
Welcome to Puzzling SE! Also, I don't think I've seen that many twos in one puzzle! XD
$endgroup$
– North
Jan 31 at 15:34
$begingroup$
Welcome to Puzzling SE! Also, I don't think I've seen that many twos in one puzzle! XD
$endgroup$
– North
Jan 31 at 15:34
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
The minimum number of twos that need to be removed is:
Three
Explanation:
In Slitherlink, there are two ways to have two edges on a square: two parallel lines or a single corner. Because of this, the optimal way to hit as many squares with two lines is to use a spiral:
Now, obviously the above example isn't going to work as it's 11x10, but it's a good visual for what's required of the spiral, namely two things:
1. The outside loop end will require a square with three sides, and
2. The inside loop end will require one square to have three sides, and another to have either one or three sides (one side would mean that the center loop will be bigger).
Because of the grid size being a square, the inner loop will need to have one square with only one side, as you can see from the failed example above.
As an aside, I would posit that any Slitherlink puzzle of this type withxrows andycolumns would have a inner loop with two three-sided squares wherex = y, and one of each of one-sided and three-sided squares ifx = y + 1ory = x + 1.
Here are two examples that will work with the constraints given:
As for the rules as to where the twos will be removed from:
There are two ways a two can be removed from the outside:
1. Remove from a corner
- In this case, move diagonally from that corner inwards to the fifth two, and remove it. Then, move diagonally one square towards either corner not opposite the beginning square, and remove the two there.
- This method produces eight possible answers, two for each corner.
2. Remove from a space adjacent to a corner (not diagonally).
- Move diagonally from the square you've removed a two from towards the center to the fourth two, and remove it. Then, move one diagonal space towards the closer non-opposite corner, and remove the two there.
- This method will produce eight answers as well, one for each space adjacent to the corner, with two of those spaces available for each.
answered Jan 31 at 16:00
MeerkatMeerkat
500112
$endgroup$
1
$begingroup$
Have you run across this before? I'm surprised how fast you got that, and knew exactly what was going on. I guess a bonus question for you (although you basically already know), can you give a set of rules for where those twos must be removed from?
$endgroup$
– Dark Thunder
Jan 31 at 16:16
1
$begingroup$
I actually never have! I have done Slitherlinks in the past, so a quick bit of logic from my memory gave me the idea of the optimal pattern. As for the rules, I've edited them to the bottom of the post.
$endgroup$
– Meerkat
Jan 31 at 16:30
1
$begingroup$
@DarkThunder Never underestimate the combined genious of PuzzlingSE followers! If you hang around a bit, you'll be astonished how fast some impossible looking puzzle get a good answer! If a question remains unanswered for long, it's most often a fault of the question: Either it's too boring or doesn't have a single, logical solution. Anyway: I thoroughly enjoyed your question and Meerkat's answer. So thanks and welcome!
$endgroup$
– BmyGuest
Jan 31 at 18:40
add a comment |
$begingroup$
Meerkat gave the answer but I just had some additional observations:
The removed twos follow some oddly specific rules. The first one, I think, is fairly obvious to anyone who solved the question. The second rule is stranger and I can't really claim to understand it.
The three removed twos each need to be inside their own "zone" as shown here. The puzzle with all twos wants to make concentric rings, so I think of it as disrupting different levels, thus allowing the lines to connect into a single loop.
If you start by removing the two that is one of the four center cells(shown in the previous image in green), the remaining twos must be taken on the two diagonals(shown in yellow and purple below).
Using those two rules it doesn't always get you a solution, but all solutions follow those rules, so far as I can tell. I assume there's a good reason, so that's another question anybody could feel free to tackle.
answered Feb 1 at 22:47
Dark ThunderDark Thunder
3549
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
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/3.0/"u003ecc by-sa 3.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%2f79119%2fthe-terrible-twos-of-slitherlink%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
The minimum number of twos that need to be removed is:
Three
Explanation:
In Slitherlink, there are two ways to have two edges on a square: two parallel lines or a single corner. Because of this, the optimal way to hit as many squares with two lines is to use a spiral:
Now, obviously the above example isn't going to work as it's 11x10, but it's a good visual for what's required of the spiral, namely two things:
1. The outside loop end will require a square with three sides, and
2. The inside loop end will require one square to have three sides, and another to have either one or three sides (one side would mean that the center loop will be bigger).
Because of the grid size being a square, the inner loop will need to have one square with only one side, as you can see from the failed example above.
As an aside, I would posit that any Slitherlink puzzle of this type withxrows andycolumns would have a inner loop with two three-sided squares wherex = y, and one of each of one-sided and three-sided squares ifx = y + 1ory = x + 1.
Here are two examples that will work with the constraints given:
As for the rules as to where the twos will be removed from:
There are two ways a two can be removed from the outside:
1. Remove from a corner
- In this case, move diagonally from that corner inwards to the fifth two, and remove it. Then, move diagonally one square towards either corner not opposite the beginning square, and remove the two there.
- This method produces eight possible answers, two for each corner.
2. Remove from a space adjacent to a corner (not diagonally).
- Move diagonally from the square you've removed a two from towards the center to the fourth two, and remove it. Then, move one diagonal space towards the closer non-opposite corner, and remove the two there.
- This method will produce eight answers as well, one for each space adjacent to the corner, with two of those spaces available for each.
answered Jan 31 at 16:00
MeerkatMeerkat
500112
$endgroup$
1
$begingroup$
Have you run across this before? I'm surprised how fast you got that, and knew exactly what was going on. I guess a bonus question for you (although you basically already know), can you give a set of rules for where those twos must be removed from?
$endgroup$
– Dark Thunder
Jan 31 at 16:16
1
$begingroup$
I actually never have! I have done Slitherlinks in the past, so a quick bit of logic from my memory gave me the idea of the optimal pattern. As for the rules, I've edited them to the bottom of the post.
$endgroup$
– Meerkat
Jan 31 at 16:30
1
$begingroup$
@DarkThunder Never underestimate the combined genious of PuzzlingSE followers! If you hang around a bit, you'll be astonished how fast some impossible looking puzzle get a good answer! If a question remains unanswered for long, it's most often a fault of the question: Either it's too boring or doesn't have a single, logical solution. Anyway: I thoroughly enjoyed your question and Meerkat's answer. So thanks and welcome!
$endgroup$
– BmyGuest
Jan 31 at 18:40
add a comment |
$begingroup$
The minimum number of twos that need to be removed is:
Three
Explanation:
In Slitherlink, there are two ways to have two edges on a square: two parallel lines or a single corner. Because of this, the optimal way to hit as many squares with two lines is to use a spiral:
Now, obviously the above example isn't going to work as it's 11x10, but it's a good visual for what's required of the spiral, namely two things:
1. The outside loop end will require a square with three sides, and
2. The inside loop end will require one square to have three sides, and another to have either one or three sides (one side would mean that the center loop will be bigger).
Because of the grid size being a square, the inner loop will need to have one square with only one side, as you can see from the failed example above.
As an aside, I would posit that any Slitherlink puzzle of this type withxrows andycolumns would have a inner loop with two three-sided squares wherex = y, and one of each of one-sided and three-sided squares ifx = y + 1ory = x + 1.
Here are two examples that will work with the constraints given:
As for the rules as to where the twos will be removed from:
There are two ways a two can be removed from the outside:
1. Remove from a corner
- In this case, move diagonally from that corner inwards to the fifth two, and remove it. Then, move diagonally one square towards either corner not opposite the beginning square, and remove the two there.
- This method produces eight possible answers, two for each corner.
2. Remove from a space adjacent to a corner (not diagonally).
- Move diagonally from the square you've removed a two from towards the center to the fourth two, and remove it. Then, move one diagonal space towards the closer non-opposite corner, and remove the two there.
- This method will produce eight answers as well, one for each space adjacent to the corner, with two of those spaces available for each.
answered Jan 31 at 16:00
MeerkatMeerkat
500112
$endgroup$
1
$begingroup$
Have you run across this before? I'm surprised how fast you got that, and knew exactly what was going on. I guess a bonus question for you (although you basically already know), can you give a set of rules for where those twos must be removed from?
$endgroup$
– Dark Thunder
Jan 31 at 16:16
1
$begingroup$
I actually never have! I have done Slitherlinks in the past, so a quick bit of logic from my memory gave me the idea of the optimal pattern. As for the rules, I've edited them to the bottom of the post.
$endgroup$
– Meerkat
Jan 31 at 16:30
1
$begingroup$
@DarkThunder Never underestimate the combined genious of PuzzlingSE followers! If you hang around a bit, you'll be astonished how fast some impossible looking puzzle get a good answer! If a question remains unanswered for long, it's most often a fault of the question: Either it's too boring or doesn't have a single, logical solution. Anyway: I thoroughly enjoyed your question and Meerkat's answer. So thanks and welcome!
$endgroup$
– BmyGuest
Jan 31 at 18:40
add a comment |
$begingroup$
The minimum number of twos that need to be removed is:
Three
Explanation:
In Slitherlink, there are two ways to have two edges on a square: two parallel lines or a single corner. Because of this, the optimal way to hit as many squares with two lines is to use a spiral:
Now, obviously the above example isn't going to work as it's 11x10, but it's a good visual for what's required of the spiral, namely two things:
1. The outside loop end will require a square with three sides, and
2. The inside loop end will require one square to have three sides, and another to have either one or three sides (one side would mean that the center loop will be bigger).
Because of the grid size being a square, the inner loop will need to have one square with only one side, as you can see from the failed example above.
As an aside, I would posit that any Slitherlink puzzle of this type withxrows andycolumns would have a inner loop with two three-sided squares wherex = y, and one of each of one-sided and three-sided squares ifx = y + 1ory = x + 1.
Here are two examples that will work with the constraints given:
As for the rules as to where the twos will be removed from:
There are two ways a two can be removed from the outside:
1. Remove from a corner
- In this case, move diagonally from that corner inwards to the fifth two, and remove it. Then, move diagonally one square towards either corner not opposite the beginning square, and remove the two there.
- This method produces eight possible answers, two for each corner.
2. Remove from a space adjacent to a corner (not diagonally).
- Move diagonally from the square you've removed a two from towards the center to the fourth two, and remove it. Then, move one diagonal space towards the closer non-opposite corner, and remove the two there.
- This method will produce eight answers as well, one for each space adjacent to the corner, with two of those spaces available for each.
answered Jan 31 at 16:00
MeerkatMeerkat
500112
$endgroup$
The minimum number of twos that need to be removed is:
Three
Explanation:
In Slitherlink, there are two ways to have two edges on a square: two parallel lines or a single corner. Because of this, the optimal way to hit as many squares with two lines is to use a spiral:
Now, obviously the above example isn't going to work as it's 11x10, but it's a good visual for what's required of the spiral, namely two things:
1. The outside loop end will require a square with three sides, and
2. The inside loop end will require one square to have three sides, and another to have either one or three sides (one side would mean that the center loop will be bigger).
Because of the grid size being a square, the inner loop will need to have one square with only one side, as you can see from the failed example above.
As an aside, I would posit that any Slitherlink puzzle of this type withxrows andycolumns would have a inner loop with two three-sided squares wherex = y, and one of each of one-sided and three-sided squares ifx = y + 1ory = x + 1.
Here are two examples that will work with the constraints given:
As for the rules as to where the twos will be removed from:
There are two ways a two can be removed from the outside:
1. Remove from a corner
- In this case, move diagonally from that corner inwards to the fifth two, and remove it. Then, move diagonally one square towards either corner not opposite the beginning square, and remove the two there.
- This method produces eight possible answers, two for each corner.
2. Remove from a space adjacent to a corner (not diagonally).
- Move diagonally from the square you've removed a two from towards the center to the fourth two, and remove it. Then, move one diagonal space towards the closer non-opposite corner, and remove the two there.
- This method will produce eight answers as well, one for each space adjacent to the corner, with two of those spaces available for each.
answered Jan 31 at 16:00
MeerkatMeerkat
500112
edited Jan 31 at 16:30
answered Jan 31 at 16:00
MeerkatMeerkat
500112
answered Jan 31 at 16:00
MeerkatMeerkat
500112
answered Jan 31 at 16:00
MeerkatMeerkat
500112
500112
1
$begingroup$
Have you run across this before? I'm surprised how fast you got that, and knew exactly what was going on. I guess a bonus question for you (although you basically already know), can you give a set of rules for where those twos must be removed from?
$endgroup$
– Dark Thunder
Jan 31 at 16:16
1
$begingroup$
I actually never have! I have done Slitherlinks in the past, so a quick bit of logic from my memory gave me the idea of the optimal pattern. As for the rules, I've edited them to the bottom of the post.
$endgroup$
– Meerkat
Jan 31 at 16:30
1
$begingroup$
@DarkThunder Never underestimate the combined genious of PuzzlingSE followers! If you hang around a bit, you'll be astonished how fast some impossible looking puzzle get a good answer! If a question remains unanswered for long, it's most often a fault of the question: Either it's too boring or doesn't have a single, logical solution. Anyway: I thoroughly enjoyed your question and Meerkat's answer. So thanks and welcome!
$endgroup$
– BmyGuest
Jan 31 at 18:40
add a comment |
1
$begingroup$
Have you run across this before? I'm surprised how fast you got that, and knew exactly what was going on. I guess a bonus question for you (although you basically already know), can you give a set of rules for where those twos must be removed from?
$endgroup$
– Dark Thunder
Jan 31 at 16:16
1
$begingroup$
I actually never have! I have done Slitherlinks in the past, so a quick bit of logic from my memory gave me the idea of the optimal pattern. As for the rules, I've edited them to the bottom of the post.
$endgroup$
– Meerkat
Jan 31 at 16:30
1
$begingroup$
@DarkThunder Never underestimate the combined genious of PuzzlingSE followers! If you hang around a bit, you'll be astonished how fast some impossible looking puzzle get a good answer! If a question remains unanswered for long, it's most often a fault of the question: Either it's too boring or doesn't have a single, logical solution. Anyway: I thoroughly enjoyed your question and Meerkat's answer. So thanks and welcome!
$endgroup$
– BmyGuest
Jan 31 at 18:40
1
1
$begingroup$
Have you run across this before? I'm surprised how fast you got that, and knew exactly what was going on. I guess a bonus question for you (although you basically already know), can you give a set of rules for where those twos must be removed from?
$endgroup$
– Dark Thunder
Jan 31 at 16:16
$begingroup$
Have you run across this before? I'm surprised how fast you got that, and knew exactly what was going on. I guess a bonus question for you (although you basically already know), can you give a set of rules for where those twos must be removed from?
$endgroup$
– Dark Thunder
Jan 31 at 16:16
1
1
$begingroup$
I actually never have! I have done Slitherlinks in the past, so a quick bit of logic from my memory gave me the idea of the optimal pattern. As for the rules, I've edited them to the bottom of the post.
$endgroup$
– Meerkat
Jan 31 at 16:30
$begingroup$
I actually never have! I have done Slitherlinks in the past, so a quick bit of logic from my memory gave me the idea of the optimal pattern. As for the rules, I've edited them to the bottom of the post.
$endgroup$
– Meerkat
Jan 31 at 16:30
1
1
$begingroup$
@DarkThunder Never underestimate the combined genious of PuzzlingSE followers! If you hang around a bit, you'll be astonished how fast some impossible looking puzzle get a good answer! If a question remains unanswered for long, it's most often a fault of the question: Either it's too boring or doesn't have a single, logical solution. Anyway: I thoroughly enjoyed your question and Meerkat's answer. So thanks and welcome!
$endgroup$
– BmyGuest
Jan 31 at 18:40
$begingroup$
@DarkThunder Never underestimate the combined genious of PuzzlingSE followers! If you hang around a bit, you'll be astonished how fast some impossible looking puzzle get a good answer! If a question remains unanswered for long, it's most often a fault of the question: Either it's too boring or doesn't have a single, logical solution. Anyway: I thoroughly enjoyed your question and Meerkat's answer. So thanks and welcome!
$endgroup$
– BmyGuest
Jan 31 at 18:40
add a comment |
$begingroup$
Meerkat gave the answer but I just had some additional observations:
The removed twos follow some oddly specific rules. The first one, I think, is fairly obvious to anyone who solved the question. The second rule is stranger and I can't really claim to understand it.
The three removed twos each need to be inside their own "zone" as shown here. The puzzle with all twos wants to make concentric rings, so I think of it as disrupting different levels, thus allowing the lines to connect into a single loop.
If you start by removing the two that is one of the four center cells(shown in the previous image in green), the remaining twos must be taken on the two diagonals(shown in yellow and purple below).
Using those two rules it doesn't always get you a solution, but all solutions follow those rules, so far as I can tell. I assume there's a good reason, so that's another question anybody could feel free to tackle.
answered Feb 1 at 22:47
Dark ThunderDark Thunder
3549
$endgroup$
add a comment |
$begingroup$
Meerkat gave the answer but I just had some additional observations:
The removed twos follow some oddly specific rules. The first one, I think, is fairly obvious to anyone who solved the question. The second rule is stranger and I can't really claim to understand it.
The three removed twos each need to be inside their own "zone" as shown here. The puzzle with all twos wants to make concentric rings, so I think of it as disrupting different levels, thus allowing the lines to connect into a single loop.
If you start by removing the two that is one of the four center cells(shown in the previous image in green), the remaining twos must be taken on the two diagonals(shown in yellow and purple below).
Using those two rules it doesn't always get you a solution, but all solutions follow those rules, so far as I can tell. I assume there's a good reason, so that's another question anybody could feel free to tackle.
answered Feb 1 at 22:47
Dark ThunderDark Thunder
3549
$endgroup$
add a comment |
$begingroup$
Meerkat gave the answer but I just had some additional observations:
The removed twos follow some oddly specific rules. The first one, I think, is fairly obvious to anyone who solved the question. The second rule is stranger and I can't really claim to understand it.
The three removed twos each need to be inside their own "zone" as shown here. The puzzle with all twos wants to make concentric rings, so I think of it as disrupting different levels, thus allowing the lines to connect into a single loop.
If you start by removing the two that is one of the four center cells(shown in the previous image in green), the remaining twos must be taken on the two diagonals(shown in yellow and purple below).
Using those two rules it doesn't always get you a solution, but all solutions follow those rules, so far as I can tell. I assume there's a good reason, so that's another question anybody could feel free to tackle.
answered Feb 1 at 22:47
Dark ThunderDark Thunder
3549
$endgroup$
Meerkat gave the answer but I just had some additional observations:
The removed twos follow some oddly specific rules. The first one, I think, is fairly obvious to anyone who solved the question. The second rule is stranger and I can't really claim to understand it.
The three removed twos each need to be inside their own "zone" as shown here. The puzzle with all twos wants to make concentric rings, so I think of it as disrupting different levels, thus allowing the lines to connect into a single loop.
If you start by removing the two that is one of the four center cells(shown in the previous image in green), the remaining twos must be taken on the two diagonals(shown in yellow and purple below).
Using those two rules it doesn't always get you a solution, but all solutions follow those rules, so far as I can tell. I assume there's a good reason, so that's another question anybody could feel free to tackle.
answered Feb 1 at 22:47
Dark ThunderDark Thunder
3549
answered Feb 1 at 22:47
Dark ThunderDark Thunder
3549
answered Feb 1 at 22:47
Dark ThunderDark Thunder
3549
answered Feb 1 at 22:47
Dark ThunderDark Thunder
3549
3549
add a comment |
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%2f79119%2fthe-terrible-twos-of-slitherlink%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
1
$begingroup$
Welcome to Puzzling SE! Also, I don't think I've seen that many twos in one puzzle! XD
$endgroup$
– North
Jan 31 at 15:34