Quick Moon-or-Sun Puzzles: 2x1-Dominoes and 1x1-CheckerboardsA Total Masyu puzzleMove the coin in the color gridOriental House: An original grid-deduction challengeMasyu jigsaw puzzleSto-stone puzzleMasyu puzzles with many circlesI'm Bad at Naming Things, so Just Try to Solve this Patterned Masyu Puzzle!IBaNTsJTtStPMP! #2(2 of 11: Moon-or-Sun) What is Pyramid Cult's Favorite Camera?(6 of 11: Yajilin) What is Pyramid Cult's Favorite Places?
In chocolate terminology, what is the name of thinly sliced leaf-shaped toppings made from hot, smooth chocolate, used to form flower petals?
Can an intercepting fighter jet force a small propeller aircraft down without completely destroying it?
Is there anything in the universe that cannot be compressed?
Why is k-means used for non normally distributed data?
What is the converted mana cost of land cards?
Calculate Landau's function
Playing boules... IN SPACE!
A question about dihedral group
IEEE Registration Authority mac prefix
Which is the best password hashing algorithm in .NET Core?
Are there any writings by blinded and/or exiled Byzantine emperors?
Is torque as fundamental a concept as force?
Why don't they build airplanes from 3D printer plastic?
Sum of Infinite series with a Geometric series in multiply
Can a country avoid prosecution for crimes against humanity by denying it happened?
How Total raw is calculated for Science pack 2?
Using GNU screen, I get raw prompt with backslashes
My boss says "This will help us better view the utilization of your services." Does this mean my job is ending in this organisation?
Why not use futuristic pavise ballistic shields for protection?
When making yogurt, why doesn't bad bacteria grow as well?
Can there be plants on the dark side of a tidally locked world?
Why didn't Thatcher give Hong Kong to Taiwan?
Why do modes sound so different, although they are basically the same as a mode of another scale?
Using font to highlight a god's speech in dialogue
Quick Moon-or-Sun Puzzles: 2x1-Dominoes and 1x1-Checkerboards
A Total Masyu puzzleMove the coin in the color gridOriental House: An original grid-deduction challengeMasyu jigsaw puzzleSto-stone puzzleMasyu puzzles with many circlesI'm Bad at Naming Things, so Just Try to Solve this Patterned Masyu Puzzle!IBaNTsJTtStPMP! #2(2 of 11: Moon-or-Sun) What is Pyramid Cult's Favorite Camera?(6 of 11: Yajilin) What is Pyramid Cult's Favorite Places?
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;
$begingroup$
Moon-or-Sun (adapted from Nikoli)
- Draw a line to make a single loop.
- Lines pass through the centers of cells, horizontally, vertically, or turning. The loop never crosses itself, branches off, or goes through the same cell twice.
- A rectangle, bordered by bold lines, is called a "room".
- Color each room blue or yellow.
- The loop must visit each room once, alternating between blue and yellow rooms.
- In a blue room, you must visit all of the moons and none of the suns; in a yellow room, you must visit all of the suns and none of the moons.
logical-deduction grid-deduction
asked 10 hours ago
athinathin
13.4k3 gold badges41 silver badges109 bronze badges
$endgroup$
add a comment |
$begingroup$
Moon-or-Sun (adapted from Nikoli)
- Draw a line to make a single loop.
- Lines pass through the centers of cells, horizontally, vertically, or turning. The loop never crosses itself, branches off, or goes through the same cell twice.
- A rectangle, bordered by bold lines, is called a "room".
- Color each room blue or yellow.
- The loop must visit each room once, alternating between blue and yellow rooms.
- In a blue room, you must visit all of the moons and none of the suns; in a yellow room, you must visit all of the suns and none of the moons.
logical-deduction grid-deduction
asked 10 hours ago
athinathin
13.4k3 gold badges41 silver badges109 bronze badges
$endgroup$
$begingroup$
Seeing the misunderstanding and all that, I'd like to ask clearly: passing through a room WITHOUT a sun or moon counts as part of the sequence? (Ex: Can't go moon-moon but can go moon-blank-moon?)
$endgroup$
– Belhenix
6 hours ago
1
$begingroup$
A suggestion for rephrasing the rules to account for empty rooms: "Color each room blue or yellow. Draw a loop visiting each room once, alternating between blue and yellow rooms. In a blue room, you must visit all of the moons and none of the sums; in a yellow room, you must visit all of the suns and none of the moons."
$endgroup$
– Deusovi♦
4 hours ago
1
$begingroup$
Welp, got to admit that indeed the original rules may confuse the solver when they are given empty room. For @Belhenix , that's correct: can't go moon-moon but moon-blank-moon is okay (if the second room doesn't contain any sun). And Deusovi , I like and agree with the suggestion, will update the rules accordingly.
$endgroup$
– athin
1 hour ago
add a comment |
$begingroup$
Moon-or-Sun (adapted from Nikoli)
- Draw a line to make a single loop.
- Lines pass through the centers of cells, horizontally, vertically, or turning. The loop never crosses itself, branches off, or goes through the same cell twice.
- A rectangle, bordered by bold lines, is called a "room".
- Color each room blue or yellow.
- The loop must visit each room once, alternating between blue and yellow rooms.
- In a blue room, you must visit all of the moons and none of the suns; in a yellow room, you must visit all of the suns and none of the moons.
logical-deduction grid-deduction
asked 10 hours ago
athinathin
13.4k3 gold badges41 silver badges109 bronze badges
$endgroup$
Moon-or-Sun (adapted from Nikoli)
- Draw a line to make a single loop.
- Lines pass through the centers of cells, horizontally, vertically, or turning. The loop never crosses itself, branches off, or goes through the same cell twice.
- A rectangle, bordered by bold lines, is called a "room".
- Color each room blue or yellow.
- The loop must visit each room once, alternating between blue and yellow rooms.
- In a blue room, you must visit all of the moons and none of the suns; in a yellow room, you must visit all of the suns and none of the moons.
logical-deduction grid-deduction
logical-deduction grid-deduction
asked 10 hours ago
athinathin
13.4k3 gold badges41 silver badges109 bronze badges
asked 10 hours ago
athinathin
13.4k3 gold badges41 silver badges109 bronze badges
edited 1 hour ago
athin
asked 10 hours ago
athinathin
13.4k3 gold badges41 silver badges109 bronze badges
asked 10 hours ago
athinathin
13.4k3 gold badges41 silver badges109 bronze badges
asked 10 hours ago
athinathin
13.4k3 gold badges41 silver badges109 bronze badges
13.4k3 gold badges41 silver badges109 bronze badges
$begingroup$
Seeing the misunderstanding and all that, I'd like to ask clearly: passing through a room WITHOUT a sun or moon counts as part of the sequence? (Ex: Can't go moon-moon but can go moon-blank-moon?)
$endgroup$
– Belhenix
6 hours ago
1
$begingroup$
A suggestion for rephrasing the rules to account for empty rooms: "Color each room blue or yellow. Draw a loop visiting each room once, alternating between blue and yellow rooms. In a blue room, you must visit all of the moons and none of the sums; in a yellow room, you must visit all of the suns and none of the moons."
$endgroup$
– Deusovi♦
4 hours ago
1
$begingroup$
Welp, got to admit that indeed the original rules may confuse the solver when they are given empty room. For @Belhenix , that's correct: can't go moon-moon but moon-blank-moon is okay (if the second room doesn't contain any sun). And Deusovi , I like and agree with the suggestion, will update the rules accordingly.
$endgroup$
– athin
1 hour ago
add a comment |
$begingroup$
Seeing the misunderstanding and all that, I'd like to ask clearly: passing through a room WITHOUT a sun or moon counts as part of the sequence? (Ex: Can't go moon-moon but can go moon-blank-moon?)
$endgroup$
– Belhenix
6 hours ago
1
$begingroup$
A suggestion for rephrasing the rules to account for empty rooms: "Color each room blue or yellow. Draw a loop visiting each room once, alternating between blue and yellow rooms. In a blue room, you must visit all of the moons and none of the sums; in a yellow room, you must visit all of the suns and none of the moons."
$endgroup$
– Deusovi♦
4 hours ago
1
$begingroup$
Welp, got to admit that indeed the original rules may confuse the solver when they are given empty room. For @Belhenix , that's correct: can't go moon-moon but moon-blank-moon is okay (if the second room doesn't contain any sun). And Deusovi , I like and agree with the suggestion, will update the rules accordingly.
$endgroup$
– athin
1 hour ago
$begingroup$
Seeing the misunderstanding and all that, I'd like to ask clearly: passing through a room WITHOUT a sun or moon counts as part of the sequence? (Ex: Can't go moon-moon but can go moon-blank-moon?)
$endgroup$
– Belhenix
6 hours ago
$begingroup$
Seeing the misunderstanding and all that, I'd like to ask clearly: passing through a room WITHOUT a sun or moon counts as part of the sequence? (Ex: Can't go moon-moon but can go moon-blank-moon?)
$endgroup$
– Belhenix
6 hours ago
1
1
$begingroup$
A suggestion for rephrasing the rules to account for empty rooms: "Color each room blue or yellow. Draw a loop visiting each room once, alternating between blue and yellow rooms. In a blue room, you must visit all of the moons and none of the sums; in a yellow room, you must visit all of the suns and none of the moons."
$endgroup$
– Deusovi♦
4 hours ago
$begingroup$
A suggestion for rephrasing the rules to account for empty rooms: "Color each room blue or yellow. Draw a loop visiting each room once, alternating between blue and yellow rooms. In a blue room, you must visit all of the moons and none of the sums; in a yellow room, you must visit all of the suns and none of the moons."
$endgroup$
– Deusovi♦
4 hours ago
1
1
$begingroup$
Welp, got to admit that indeed the original rules may confuse the solver when they are given empty room. For @Belhenix , that's correct: can't go moon-moon but moon-blank-moon is okay (if the second room doesn't contain any sun). And Deusovi , I like and agree with the suggestion, will update the rules accordingly.
$endgroup$
– athin
1 hour ago
$begingroup$
Welp, got to admit that indeed the original rules may confuse the solver when they are given empty room. For @Belhenix , that's correct: can't go moon-moon but moon-blank-moon is okay (if the second room doesn't contain any sun). And Deusovi , I like and agree with the suggestion, will update the rules accordingly.
$endgroup$
– athin
1 hour ago
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
I think this is the answer to the first one
And here is the second one
answered 9 hours ago
hexominohexomino
60.5k5 gold badges174 silver badges274 bronze badges
$endgroup$
add a comment |
$begingroup$
Right-hand puzzle
This one is fairly easy: since almost all the rooms are just one cell, we simply have to find a grid-filling curve which alternates between suns and moons. The key fact is that
we have rows of alternating suns and moons near the top and bottom, then in the middle we have suns above and moons below, so we need to go up and down in the middle and across at the top and bottom.
The solution is:
Left-hand puzzle
Here I seem to be finding myself proving that it's impossible, as follows:
Consider the top left room (suns). The loop must pass through this room horizontally.
From the left-hand end of that horizontal line segment (top left corner), the loop must go down, entering the room of moons just below. It must then pass horizontally through this room too.
From the right-hand end of the first horizontal line segment, the loop must go to find another room of moons. Since crossing itself is disallowed, the only option is to head down and pass horizontally through the second highest room of moons.
From the right-hand end of the second horizontal line segment (highest room of moons), the loop must go to find another room of suns. Since crossing itself is disallowed, again the only option is to head down.
But now the leftmost room of moons is isolated!
Is there a mistake in the puzzle, my proof, or have I misunderstood the rules?
answered 9 hours ago
Rand al'ThorRand al'Thor
74.8k15 gold badges248 silver badges496 bronze badges
$endgroup$
1
$begingroup$
I think you've misunderstood the rules. "After the loop goes through the moons in one room it has to go through all the suns in the next room it enters and visa versa." This includes rooms which have no suns or moons.
$endgroup$
– hexomino
9 hours ago
add a comment |
$begingroup$
2 seems to be ill-defined, as almost anything goes:
answered 7 hours ago
JMPJMP
25.4k6 gold badges49 silver badges110 bronze badges
$endgroup$
1
$begingroup$
I think you've misunderstood the rules. See my comment on Rand al'Thor's answer.
$endgroup$
– hexomino
7 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/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%2f87638%2fquick-moon-or-sun-puzzles-2x1-dominoes-and-1x1-checkerboards%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
I think this is the answer to the first one
And here is the second one
answered 9 hours ago
hexominohexomino
60.5k5 gold badges174 silver badges274 bronze badges
$endgroup$
add a comment |
$begingroup$
I think this is the answer to the first one
And here is the second one
answered 9 hours ago
hexominohexomino
60.5k5 gold badges174 silver badges274 bronze badges
$endgroup$
add a comment |
$begingroup$
I think this is the answer to the first one
And here is the second one
answered 9 hours ago
hexominohexomino
60.5k5 gold badges174 silver badges274 bronze badges
$endgroup$
I think this is the answer to the first one
And here is the second one
answered 9 hours ago
hexominohexomino
60.5k5 gold badges174 silver badges274 bronze badges
edited 7 hours ago
answered 9 hours ago
hexominohexomino
60.5k5 gold badges174 silver badges274 bronze badges
answered 9 hours ago
hexominohexomino
60.5k5 gold badges174 silver badges274 bronze badges
answered 9 hours ago
hexominohexomino
60.5k5 gold badges174 silver badges274 bronze badges
60.5k5 gold badges174 silver badges274 bronze badges
add a comment |
add a comment |
$begingroup$
Right-hand puzzle
This one is fairly easy: since almost all the rooms are just one cell, we simply have to find a grid-filling curve which alternates between suns and moons. The key fact is that
we have rows of alternating suns and moons near the top and bottom, then in the middle we have suns above and moons below, so we need to go up and down in the middle and across at the top and bottom.
The solution is:
Left-hand puzzle
Here I seem to be finding myself proving that it's impossible, as follows:
Consider the top left room (suns). The loop must pass through this room horizontally.
From the left-hand end of that horizontal line segment (top left corner), the loop must go down, entering the room of moons just below. It must then pass horizontally through this room too.
From the right-hand end of the first horizontal line segment, the loop must go to find another room of moons. Since crossing itself is disallowed, the only option is to head down and pass horizontally through the second highest room of moons.
From the right-hand end of the second horizontal line segment (highest room of moons), the loop must go to find another room of suns. Since crossing itself is disallowed, again the only option is to head down.
But now the leftmost room of moons is isolated!
Is there a mistake in the puzzle, my proof, or have I misunderstood the rules?
answered 9 hours ago
Rand al'ThorRand al'Thor
74.8k15 gold badges248 silver badges496 bronze badges
$endgroup$
1
$begingroup$
I think you've misunderstood the rules. "After the loop goes through the moons in one room it has to go through all the suns in the next room it enters and visa versa." This includes rooms which have no suns or moons.
$endgroup$
– hexomino
9 hours ago
add a comment |
$begingroup$
Right-hand puzzle
This one is fairly easy: since almost all the rooms are just one cell, we simply have to find a grid-filling curve which alternates between suns and moons. The key fact is that
we have rows of alternating suns and moons near the top and bottom, then in the middle we have suns above and moons below, so we need to go up and down in the middle and across at the top and bottom.
The solution is:
Left-hand puzzle
Here I seem to be finding myself proving that it's impossible, as follows:
Consider the top left room (suns). The loop must pass through this room horizontally.
From the left-hand end of that horizontal line segment (top left corner), the loop must go down, entering the room of moons just below. It must then pass horizontally through this room too.
From the right-hand end of the first horizontal line segment, the loop must go to find another room of moons. Since crossing itself is disallowed, the only option is to head down and pass horizontally through the second highest room of moons.
From the right-hand end of the second horizontal line segment (highest room of moons), the loop must go to find another room of suns. Since crossing itself is disallowed, again the only option is to head down.
But now the leftmost room of moons is isolated!
Is there a mistake in the puzzle, my proof, or have I misunderstood the rules?
answered 9 hours ago
Rand al'ThorRand al'Thor
74.8k15 gold badges248 silver badges496 bronze badges
$endgroup$
1
$begingroup$
I think you've misunderstood the rules. "After the loop goes through the moons in one room it has to go through all the suns in the next room it enters and visa versa." This includes rooms which have no suns or moons.
$endgroup$
– hexomino
9 hours ago
add a comment |
$begingroup$
Right-hand puzzle
This one is fairly easy: since almost all the rooms are just one cell, we simply have to find a grid-filling curve which alternates between suns and moons. The key fact is that
we have rows of alternating suns and moons near the top and bottom, then in the middle we have suns above and moons below, so we need to go up and down in the middle and across at the top and bottom.
The solution is:
Left-hand puzzle
Here I seem to be finding myself proving that it's impossible, as follows:
Consider the top left room (suns). The loop must pass through this room horizontally.
From the left-hand end of that horizontal line segment (top left corner), the loop must go down, entering the room of moons just below. It must then pass horizontally through this room too.
From the right-hand end of the first horizontal line segment, the loop must go to find another room of moons. Since crossing itself is disallowed, the only option is to head down and pass horizontally through the second highest room of moons.
From the right-hand end of the second horizontal line segment (highest room of moons), the loop must go to find another room of suns. Since crossing itself is disallowed, again the only option is to head down.
But now the leftmost room of moons is isolated!
Is there a mistake in the puzzle, my proof, or have I misunderstood the rules?
answered 9 hours ago
Rand al'ThorRand al'Thor
74.8k15 gold badges248 silver badges496 bronze badges
$endgroup$
Right-hand puzzle
This one is fairly easy: since almost all the rooms are just one cell, we simply have to find a grid-filling curve which alternates between suns and moons. The key fact is that
we have rows of alternating suns and moons near the top and bottom, then in the middle we have suns above and moons below, so we need to go up and down in the middle and across at the top and bottom.
The solution is:
Left-hand puzzle
Here I seem to be finding myself proving that it's impossible, as follows:
Consider the top left room (suns). The loop must pass through this room horizontally.
From the left-hand end of that horizontal line segment (top left corner), the loop must go down, entering the room of moons just below. It must then pass horizontally through this room too.
From the right-hand end of the first horizontal line segment, the loop must go to find another room of moons. Since crossing itself is disallowed, the only option is to head down and pass horizontally through the second highest room of moons.
From the right-hand end of the second horizontal line segment (highest room of moons), the loop must go to find another room of suns. Since crossing itself is disallowed, again the only option is to head down.
But now the leftmost room of moons is isolated!
Is there a mistake in the puzzle, my proof, or have I misunderstood the rules?
answered 9 hours ago
Rand al'ThorRand al'Thor
74.8k15 gold badges248 silver badges496 bronze badges
edited 9 hours ago
answered 9 hours ago
Rand al'ThorRand al'Thor
74.8k15 gold badges248 silver badges496 bronze badges
answered 9 hours ago
Rand al'ThorRand al'Thor
74.8k15 gold badges248 silver badges496 bronze badges
answered 9 hours ago
Rand al'ThorRand al'Thor
74.8k15 gold badges248 silver badges496 bronze badges
74.8k15 gold badges248 silver badges496 bronze badges
1
$begingroup$
I think you've misunderstood the rules. "After the loop goes through the moons in one room it has to go through all the suns in the next room it enters and visa versa." This includes rooms which have no suns or moons.
$endgroup$
– hexomino
9 hours ago
add a comment |
1
$begingroup$
I think you've misunderstood the rules. "After the loop goes through the moons in one room it has to go through all the suns in the next room it enters and visa versa." This includes rooms which have no suns or moons.
$endgroup$
– hexomino
9 hours ago
1
1
$begingroup$
I think you've misunderstood the rules. "After the loop goes through the moons in one room it has to go through all the suns in the next room it enters and visa versa." This includes rooms which have no suns or moons.
$endgroup$
– hexomino
9 hours ago
$begingroup$
I think you've misunderstood the rules. "After the loop goes through the moons in one room it has to go through all the suns in the next room it enters and visa versa." This includes rooms which have no suns or moons.
$endgroup$
– hexomino
9 hours ago
add a comment |
$begingroup$
2 seems to be ill-defined, as almost anything goes:
answered 7 hours ago
JMPJMP
25.4k6 gold badges49 silver badges110 bronze badges
$endgroup$
1
$begingroup$
I think you've misunderstood the rules. See my comment on Rand al'Thor's answer.
$endgroup$
– hexomino
7 hours ago
add a comment |
$begingroup$
2 seems to be ill-defined, as almost anything goes:
answered 7 hours ago
JMPJMP
25.4k6 gold badges49 silver badges110 bronze badges
$endgroup$
1
$begingroup$
I think you've misunderstood the rules. See my comment on Rand al'Thor's answer.
$endgroup$
– hexomino
7 hours ago
add a comment |
$begingroup$
2 seems to be ill-defined, as almost anything goes:
answered 7 hours ago
JMPJMP
25.4k6 gold badges49 silver badges110 bronze badges
$endgroup$
2 seems to be ill-defined, as almost anything goes:
answered 7 hours ago
JMPJMP
25.4k6 gold badges49 silver badges110 bronze badges
answered 7 hours ago
JMPJMP
25.4k6 gold badges49 silver badges110 bronze badges
answered 7 hours ago
JMPJMP
25.4k6 gold badges49 silver badges110 bronze badges
answered 7 hours ago
JMPJMP
25.4k6 gold badges49 silver badges110 bronze badges
25.4k6 gold badges49 silver badges110 bronze badges
1
$begingroup$
I think you've misunderstood the rules. See my comment on Rand al'Thor's answer.
$endgroup$
– hexomino
7 hours ago
add a comment |
1
$begingroup$
I think you've misunderstood the rules. See my comment on Rand al'Thor's answer.
$endgroup$
– hexomino
7 hours ago
1
1
$begingroup$
I think you've misunderstood the rules. See my comment on Rand al'Thor's answer.
$endgroup$
– hexomino
7 hours ago
$begingroup$
I think you've misunderstood the rules. See my comment on Rand al'Thor's answer.
$endgroup$
– hexomino
7 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%2f87638%2fquick-moon-or-sun-puzzles-2x1-dominoes-and-1x1-checkerboards%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
$begingroup$
Seeing the misunderstanding and all that, I'd like to ask clearly: passing through a room WITHOUT a sun or moon counts as part of the sequence? (Ex: Can't go moon-moon but can go moon-blank-moon?)
$endgroup$
– Belhenix
6 hours ago
1
$begingroup$
A suggestion for rephrasing the rules to account for empty rooms: "Color each room blue or yellow. Draw a loop visiting each room once, alternating between blue and yellow rooms. In a blue room, you must visit all of the moons and none of the sums; in a yellow room, you must visit all of the suns and none of the moons."
$endgroup$
– Deusovi♦
4 hours ago
1
$begingroup$
Welp, got to admit that indeed the original rules may confuse the solver when they are given empty room. For @Belhenix , that's correct: can't go moon-moon but moon-blank-moon is okay (if the second room doesn't contain any sun). And Deusovi , I like and agree with the suggestion, will update the rules accordingly.
$endgroup$
– athin
1 hour ago