Hexagonal Grid FillingA Trip to Ripple IslandsA spartan skeleton SudokuSkeleton sudoku, the secondA Knight's KuromasuThe Ludicrous Loop: over a thousand cells of circular logic!RPS Trinity - Teddy and Her RibbonHow does one go about creating a new grid-deduction puzzle?The Terrible Twos of Slitherlink Part DeuxFixing a Binairo MistakeIntersection Puzzle
Why is unzipped directory exactly 4.0K (much smaller than zipped file)?
'Select @VAR =' and 'Set @VAR =' behaving unexpectedly
resolution bandwidth
Negative impact of having the launch pad away from the Equator
Using too much dialogue?
Toxic, harassing lab environment
Prince of Darkness goes cryptic
Are there any German nonsense poems (Jabberwocky)?
How did the Allies achieve air superiority on Sicily?
Are there historical examples of audiences drawn to a work that was "so bad it's good"?
What happened to the Dothraki in S08E06?
Is it normal to "extract a paper" from a master thesis?
Piping the output of comand columns
(For training purposes) Are there any openings with rook pawns that are more effective than others (and if so, what are they)?
What is the limit to a Glyph of Warding's trigger?
Is keeping the forking link on a true fork necessary (Github/GPL)?
Unary Enumeration
Are PMR446 walkie-talkies legal in Switzerland?
What is to the west of Westeros?
How does Dreadhorde Arcanist interact with split cards?
How to teach an undergraduate course without having taken that course formally before?
How does the Earth's center produce heat?
How would a developer who mostly fixed bugs for years at a company call out their contributions in their CV?
Why'd a rational buyer offer to buy with no conditions precedent?
Hexagonal Grid Filling
A Trip to Ripple IslandsA spartan skeleton SudokuSkeleton sudoku, the secondA Knight's KuromasuThe Ludicrous Loop: over a thousand cells of circular logic!RPS Trinity - Teddy and Her RibbonHow does one go about creating a new grid-deduction puzzle?The Terrible Twos of Slitherlink Part DeuxFixing a Binairo MistakeIntersection Puzzle
$begingroup$
Fill in each blank white hexagon with a digit from 1 to 9. Each of the grey hexagons is the sum of the white hexagons around it, and all of the white hexagons that are around the same grey hexagon must be distinct.

The answer's already available, but I would like to see how people would logically solve this.
Source: USAMTS
grid-deduction
$endgroup$
add a comment |
$begingroup$
Fill in each blank white hexagon with a digit from 1 to 9. Each of the grey hexagons is the sum of the white hexagons around it, and all of the white hexagons that are around the same grey hexagon must be distinct.

The answer's already available, but I would like to see how people would logically solve this.
Source: USAMTS
grid-deduction
$endgroup$
add a comment |
$begingroup$
Fill in each blank white hexagon with a digit from 1 to 9. Each of the grey hexagons is the sum of the white hexagons around it, and all of the white hexagons that are around the same grey hexagon must be distinct.

The answer's already available, but I would like to see how people would logically solve this.
Source: USAMTS
grid-deduction
$endgroup$
Fill in each blank white hexagon with a digit from 1 to 9. Each of the grey hexagons is the sum of the white hexagons around it, and all of the white hexagons that are around the same grey hexagon must be distinct.

The answer's already available, but I would like to see how people would logically solve this.
Source: USAMTS
grid-deduction
grid-deduction
asked May 9 at 2:21
Jason KimJason Kim
37110
37110
add a comment |
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
Building on shoover's answer, solving it step by step:
$30$ has 3 options, $[9, 8, colorgray5, 4, colorgray3, 1]$, $[9, 7, colorgray5, 4, colorgray3, 2]$ and $[8, 7, 6, colorgray5, colorgray3, 1]$ (with gray indicating already known). As $4$ and $6$ already exist around $21$, the box shared by $21$ and $30$ must be either $1$ or $2$.
$26_top$ has 3 options, $[9, colorgray6, 5, 3, 2, 1]$, $[8, colorgray6, 5, 4, 2, 1]$ and $[7, colorgray6, 5, 4, 3, 1]$. Because $5$ already exists around $39$ the first option isn't applicable, and the two shared boxes with $39$ must be $4$ and $8/7$.
This means that the bottom of $39$ must be $9 + (8/7)$, depending on which one is around $26_top$. There is no solution for $26_bottom$ if it is $9 + 8$, so it must be $9 + 7$. This means that $8$ is around $26_top$, and $26_bottom$ is $[9, 7, 4, 3, colorgray2, 1]$.
In all solutions for $30$ at this point, the only value it can share with $26_bottom$ beyond $9/7$ is $4$.
Since $32$ already has a $1$, we can place the remaining numbers around $26_bottom$.
Looking at the empty shared box between $32$ and $26_top$, the solution for $26_top$ dictates that this must be $5/2$. No solution exists for $32$ if its top-left box is $4$, so we can now place the $8/4$'s.
There's no solution for $32$ if it is $9 + 2$, $7 + 5$ or $7 + 2$, so it must be $9 + 5$ with a solution of $[9, colorgray8, 6, 5, colorgray3, 1]$. This also places the $9/7$'s and the remaining around $32$.
The remaining boxes around $26_top$ are $2 + 1$. The only solution for $29$ is $[9, colorgray6, 5, 4, 3, 2]$, so their shared box must be $2$. This places the remaining around $26_top$.
The remaining around $29$ are $9 + 3$. As $21$ cannot have a $9$, their shared box must be $3$. This places the remaining around $29$.
- The remaining around $30$ are $9 + 2$. As $21$ cannot have $9$, this places the remaining blocks.
$endgroup$
add a comment |
$begingroup$
To get it started:
$21$ has to be $1+2+3+4+5+6$
$39$ has to be $9+8+7+6+5+4$
$21$ already has a $4$, so the overlap between $21$ and $39$ has to be $5$ and $6$, but $29$ already has a $5$, so it must get the $6$, while $30$ shares the $5$. (The hex shared by $21$, $30$, and $39$ is $5$, and the hex shared by $21$, $29$, and $39$ is $6$.)
$endgroup$
add a comment |
$begingroup$
This was really fun! After working it process of elimination after identifying max and min sums you can get from 6 digits 1-9, I was indeed able to solve.
I solved by saving image and notating like I would a Sudoku puzzle with possible choices. When in doubt, I would take combinations and choose absolute smallest or largest combinations between two hexagons and see if the rest of the cells were workable. This eliminated quite a few possibilities.
https://imgur.com/a/aIH1VLw
$endgroup$
$begingroup$
My apologies if you were asking for a mathematical proof, btw!
$endgroup$
– Carley
May 9 at 9:15
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%2f83776%2fhexagonal-grid-filling%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$
Building on shoover's answer, solving it step by step:
$30$ has 3 options, $[9, 8, colorgray5, 4, colorgray3, 1]$, $[9, 7, colorgray5, 4, colorgray3, 2]$ and $[8, 7, 6, colorgray5, colorgray3, 1]$ (with gray indicating already known). As $4$ and $6$ already exist around $21$, the box shared by $21$ and $30$ must be either $1$ or $2$.
$26_top$ has 3 options, $[9, colorgray6, 5, 3, 2, 1]$, $[8, colorgray6, 5, 4, 2, 1]$ and $[7, colorgray6, 5, 4, 3, 1]$. Because $5$ already exists around $39$ the first option isn't applicable, and the two shared boxes with $39$ must be $4$ and $8/7$.
This means that the bottom of $39$ must be $9 + (8/7)$, depending on which one is around $26_top$. There is no solution for $26_bottom$ if it is $9 + 8$, so it must be $9 + 7$. This means that $8$ is around $26_top$, and $26_bottom$ is $[9, 7, 4, 3, colorgray2, 1]$.
In all solutions for $30$ at this point, the only value it can share with $26_bottom$ beyond $9/7$ is $4$.
Since $32$ already has a $1$, we can place the remaining numbers around $26_bottom$.
Looking at the empty shared box between $32$ and $26_top$, the solution for $26_top$ dictates that this must be $5/2$. No solution exists for $32$ if its top-left box is $4$, so we can now place the $8/4$'s.
There's no solution for $32$ if it is $9 + 2$, $7 + 5$ or $7 + 2$, so it must be $9 + 5$ with a solution of $[9, colorgray8, 6, 5, colorgray3, 1]$. This also places the $9/7$'s and the remaining around $32$.
The remaining boxes around $26_top$ are $2 + 1$. The only solution for $29$ is $[9, colorgray6, 5, 4, 3, 2]$, so their shared box must be $2$. This places the remaining around $26_top$.
The remaining around $29$ are $9 + 3$. As $21$ cannot have a $9$, their shared box must be $3$. This places the remaining around $29$.
- The remaining around $30$ are $9 + 2$. As $21$ cannot have $9$, this places the remaining blocks.
$endgroup$
add a comment |
$begingroup$
Building on shoover's answer, solving it step by step:
$30$ has 3 options, $[9, 8, colorgray5, 4, colorgray3, 1]$, $[9, 7, colorgray5, 4, colorgray3, 2]$ and $[8, 7, 6, colorgray5, colorgray3, 1]$ (with gray indicating already known). As $4$ and $6$ already exist around $21$, the box shared by $21$ and $30$ must be either $1$ or $2$.
$26_top$ has 3 options, $[9, colorgray6, 5, 3, 2, 1]$, $[8, colorgray6, 5, 4, 2, 1]$ and $[7, colorgray6, 5, 4, 3, 1]$. Because $5$ already exists around $39$ the first option isn't applicable, and the two shared boxes with $39$ must be $4$ and $8/7$.
This means that the bottom of $39$ must be $9 + (8/7)$, depending on which one is around $26_top$. There is no solution for $26_bottom$ if it is $9 + 8$, so it must be $9 + 7$. This means that $8$ is around $26_top$, and $26_bottom$ is $[9, 7, 4, 3, colorgray2, 1]$.
In all solutions for $30$ at this point, the only value it can share with $26_bottom$ beyond $9/7$ is $4$.
Since $32$ already has a $1$, we can place the remaining numbers around $26_bottom$.
Looking at the empty shared box between $32$ and $26_top$, the solution for $26_top$ dictates that this must be $5/2$. No solution exists for $32$ if its top-left box is $4$, so we can now place the $8/4$'s.
There's no solution for $32$ if it is $9 + 2$, $7 + 5$ or $7 + 2$, so it must be $9 + 5$ with a solution of $[9, colorgray8, 6, 5, colorgray3, 1]$. This also places the $9/7$'s and the remaining around $32$.
The remaining boxes around $26_top$ are $2 + 1$. The only solution for $29$ is $[9, colorgray6, 5, 4, 3, 2]$, so their shared box must be $2$. This places the remaining around $26_top$.
The remaining around $29$ are $9 + 3$. As $21$ cannot have a $9$, their shared box must be $3$. This places the remaining around $29$.
- The remaining around $30$ are $9 + 2$. As $21$ cannot have $9$, this places the remaining blocks.
$endgroup$
add a comment |
$begingroup$
Building on shoover's answer, solving it step by step:
$30$ has 3 options, $[9, 8, colorgray5, 4, colorgray3, 1]$, $[9, 7, colorgray5, 4, colorgray3, 2]$ and $[8, 7, 6, colorgray5, colorgray3, 1]$ (with gray indicating already known). As $4$ and $6$ already exist around $21$, the box shared by $21$ and $30$ must be either $1$ or $2$.
$26_top$ has 3 options, $[9, colorgray6, 5, 3, 2, 1]$, $[8, colorgray6, 5, 4, 2, 1]$ and $[7, colorgray6, 5, 4, 3, 1]$. Because $5$ already exists around $39$ the first option isn't applicable, and the two shared boxes with $39$ must be $4$ and $8/7$.
This means that the bottom of $39$ must be $9 + (8/7)$, depending on which one is around $26_top$. There is no solution for $26_bottom$ if it is $9 + 8$, so it must be $9 + 7$. This means that $8$ is around $26_top$, and $26_bottom$ is $[9, 7, 4, 3, colorgray2, 1]$.
In all solutions for $30$ at this point, the only value it can share with $26_bottom$ beyond $9/7$ is $4$.
Since $32$ already has a $1$, we can place the remaining numbers around $26_bottom$.
Looking at the empty shared box between $32$ and $26_top$, the solution for $26_top$ dictates that this must be $5/2$. No solution exists for $32$ if its top-left box is $4$, so we can now place the $8/4$'s.
There's no solution for $32$ if it is $9 + 2$, $7 + 5$ or $7 + 2$, so it must be $9 + 5$ with a solution of $[9, colorgray8, 6, 5, colorgray3, 1]$. This also places the $9/7$'s and the remaining around $32$.
The remaining boxes around $26_top$ are $2 + 1$. The only solution for $29$ is $[9, colorgray6, 5, 4, 3, 2]$, so their shared box must be $2$. This places the remaining around $26_top$.
The remaining around $29$ are $9 + 3$. As $21$ cannot have a $9$, their shared box must be $3$. This places the remaining around $29$.
- The remaining around $30$ are $9 + 2$. As $21$ cannot have $9$, this places the remaining blocks.
$endgroup$
Building on shoover's answer, solving it step by step:
$30$ has 3 options, $[9, 8, colorgray5, 4, colorgray3, 1]$, $[9, 7, colorgray5, 4, colorgray3, 2]$ and $[8, 7, 6, colorgray5, colorgray3, 1]$ (with gray indicating already known). As $4$ and $6$ already exist around $21$, the box shared by $21$ and $30$ must be either $1$ or $2$.
$26_top$ has 3 options, $[9, colorgray6, 5, 3, 2, 1]$, $[8, colorgray6, 5, 4, 2, 1]$ and $[7, colorgray6, 5, 4, 3, 1]$. Because $5$ already exists around $39$ the first option isn't applicable, and the two shared boxes with $39$ must be $4$ and $8/7$.
This means that the bottom of $39$ must be $9 + (8/7)$, depending on which one is around $26_top$. There is no solution for $26_bottom$ if it is $9 + 8$, so it must be $9 + 7$. This means that $8$ is around $26_top$, and $26_bottom$ is $[9, 7, 4, 3, colorgray2, 1]$.
In all solutions for $30$ at this point, the only value it can share with $26_bottom$ beyond $9/7$ is $4$.
Since $32$ already has a $1$, we can place the remaining numbers around $26_bottom$.
Looking at the empty shared box between $32$ and $26_top$, the solution for $26_top$ dictates that this must be $5/2$. No solution exists for $32$ if its top-left box is $4$, so we can now place the $8/4$'s.
There's no solution for $32$ if it is $9 + 2$, $7 + 5$ or $7 + 2$, so it must be $9 + 5$ with a solution of $[9, colorgray8, 6, 5, colorgray3, 1]$. This also places the $9/7$'s and the remaining around $32$.
The remaining boxes around $26_top$ are $2 + 1$. The only solution for $29$ is $[9, colorgray6, 5, 4, 3, 2]$, so their shared box must be $2$. This places the remaining around $26_top$.
The remaining around $29$ are $9 + 3$. As $21$ cannot have a $9$, their shared box must be $3$. This places the remaining around $29$.
- The remaining around $30$ are $9 + 2$. As $21$ cannot have $9$, this places the remaining blocks.
edited May 9 at 10:48
answered May 9 at 9:44
BirjolaxewBirjolaxew
1963
1963
add a comment |
add a comment |
$begingroup$
To get it started:
$21$ has to be $1+2+3+4+5+6$
$39$ has to be $9+8+7+6+5+4$
$21$ already has a $4$, so the overlap between $21$ and $39$ has to be $5$ and $6$, but $29$ already has a $5$, so it must get the $6$, while $30$ shares the $5$. (The hex shared by $21$, $30$, and $39$ is $5$, and the hex shared by $21$, $29$, and $39$ is $6$.)
$endgroup$
add a comment |
$begingroup$
To get it started:
$21$ has to be $1+2+3+4+5+6$
$39$ has to be $9+8+7+6+5+4$
$21$ already has a $4$, so the overlap between $21$ and $39$ has to be $5$ and $6$, but $29$ already has a $5$, so it must get the $6$, while $30$ shares the $5$. (The hex shared by $21$, $30$, and $39$ is $5$, and the hex shared by $21$, $29$, and $39$ is $6$.)
$endgroup$
add a comment |
$begingroup$
To get it started:
$21$ has to be $1+2+3+4+5+6$
$39$ has to be $9+8+7+6+5+4$
$21$ already has a $4$, so the overlap between $21$ and $39$ has to be $5$ and $6$, but $29$ already has a $5$, so it must get the $6$, while $30$ shares the $5$. (The hex shared by $21$, $30$, and $39$ is $5$, and the hex shared by $21$, $29$, and $39$ is $6$.)
$endgroup$
To get it started:
$21$ has to be $1+2+3+4+5+6$
$39$ has to be $9+8+7+6+5+4$
$21$ already has a $4$, so the overlap between $21$ and $39$ has to be $5$ and $6$, but $29$ already has a $5$, so it must get the $6$, while $30$ shares the $5$. (The hex shared by $21$, $30$, and $39$ is $5$, and the hex shared by $21$, $29$, and $39$ is $6$.)
answered May 9 at 3:18
shoovershoover
2,170615
2,170615
add a comment |
add a comment |
$begingroup$
This was really fun! After working it process of elimination after identifying max and min sums you can get from 6 digits 1-9, I was indeed able to solve.
I solved by saving image and notating like I would a Sudoku puzzle with possible choices. When in doubt, I would take combinations and choose absolute smallest or largest combinations between two hexagons and see if the rest of the cells were workable. This eliminated quite a few possibilities.
https://imgur.com/a/aIH1VLw
$endgroup$
$begingroup$
My apologies if you were asking for a mathematical proof, btw!
$endgroup$
– Carley
May 9 at 9:15
add a comment |
$begingroup$
This was really fun! After working it process of elimination after identifying max and min sums you can get from 6 digits 1-9, I was indeed able to solve.
I solved by saving image and notating like I would a Sudoku puzzle with possible choices. When in doubt, I would take combinations and choose absolute smallest or largest combinations between two hexagons and see if the rest of the cells were workable. This eliminated quite a few possibilities.
https://imgur.com/a/aIH1VLw
$endgroup$
$begingroup$
My apologies if you were asking for a mathematical proof, btw!
$endgroup$
– Carley
May 9 at 9:15
add a comment |
$begingroup$
This was really fun! After working it process of elimination after identifying max and min sums you can get from 6 digits 1-9, I was indeed able to solve.
I solved by saving image and notating like I would a Sudoku puzzle with possible choices. When in doubt, I would take combinations and choose absolute smallest or largest combinations between two hexagons and see if the rest of the cells were workable. This eliminated quite a few possibilities.
https://imgur.com/a/aIH1VLw
$endgroup$
This was really fun! After working it process of elimination after identifying max and min sums you can get from 6 digits 1-9, I was indeed able to solve.
I solved by saving image and notating like I would a Sudoku puzzle with possible choices. When in doubt, I would take combinations and choose absolute smallest or largest combinations between two hexagons and see if the rest of the cells were workable. This eliminated quite a few possibilities.
https://imgur.com/a/aIH1VLw
edited May 9 at 9:07
answered May 9 at 8:56
CarleyCarley
45810
45810
$begingroup$
My apologies if you were asking for a mathematical proof, btw!
$endgroup$
– Carley
May 9 at 9:15
add a comment |
$begingroup$
My apologies if you were asking for a mathematical proof, btw!
$endgroup$
– Carley
May 9 at 9:15
$begingroup$
My apologies if you were asking for a mathematical proof, btw!
$endgroup$
– Carley
May 9 at 9:15
$begingroup$
My apologies if you were asking for a mathematical proof, btw!
$endgroup$
– Carley
May 9 at 9:15
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%2f83776%2fhexagonal-grid-filling%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



