Uniqueness of spanning tree on a grid.












2












$begingroup$


When I was at the Graduate Student Combinatorics Conference earlier this month, someone introduced me to a puzzle game called Noodles!.



The game starts with a collection of "pipes" on a grid (centered on each vertex), clicking on a piece rotates it $90^circ$, and a piece can be rotated any number of times. The goal is to turn the final configuration of pipes into a spanning tree (of the grid graph), as shown in the screenshots below.



Example



An example of Noodles!



Question



We left the conference with an unsolved question:
Are solutions to this puzzle always unique? Or is it possible to come up with a starting configuration (on any size grid) that has multiple trees as solutions?



(The prevailing guess is that solutions are unique, but nobody could manage to prove it.)






combinatorics graph-theory puzzle trees







share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    This genre of logic puzzle is known originally as Netwalk.
    $endgroup$
    – Mike Earnest
    4 hours ago










  • $begingroup$
    @MikeEarnest, thanks for the reference. Based on this picture from this Reddit thread, it looks like (some versions of) Netwalk are on a torus instead of a grid—although that presents an interesting generalization of this question.
    $endgroup$
    – Peter Kagey
    4 hours ago


















2












$begingroup$


When I was at the Graduate Student Combinatorics Conference earlier this month, someone introduced me to a puzzle game called Noodles!.



The game starts with a collection of "pipes" on a grid (centered on each vertex), clicking on a piece rotates it $90^circ$, and a piece can be rotated any number of times. The goal is to turn the final configuration of pipes into a spanning tree (of the grid graph), as shown in the screenshots below.



Example



An example of Noodles!



Question



We left the conference with an unsolved question:
Are solutions to this puzzle always unique? Or is it possible to come up with a starting configuration (on any size grid) that has multiple trees as solutions?



(The prevailing guess is that solutions are unique, but nobody could manage to prove it.)






combinatorics graph-theory puzzle trees







share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    This genre of logic puzzle is known originally as Netwalk.
    $endgroup$
    – Mike Earnest
    4 hours ago










  • $begingroup$
    @MikeEarnest, thanks for the reference. Based on this picture from this Reddit thread, it looks like (some versions of) Netwalk are on a torus instead of a grid—although that presents an interesting generalization of this question.
    $endgroup$
    – Peter Kagey
    4 hours ago
















2












2








2


1



$begingroup$


When I was at the Graduate Student Combinatorics Conference earlier this month, someone introduced me to a puzzle game called Noodles!.



The game starts with a collection of "pipes" on a grid (centered on each vertex), clicking on a piece rotates it $90^circ$, and a piece can be rotated any number of times. The goal is to turn the final configuration of pipes into a spanning tree (of the grid graph), as shown in the screenshots below.



Example



An example of Noodles!



Question



We left the conference with an unsolved question:
Are solutions to this puzzle always unique? Or is it possible to come up with a starting configuration (on any size grid) that has multiple trees as solutions?



(The prevailing guess is that solutions are unique, but nobody could manage to prove it.)






combinatorics graph-theory puzzle trees







share|cite|improve this question









$endgroup$




When I was at the Graduate Student Combinatorics Conference earlier this month, someone introduced me to a puzzle game called Noodles!.



The game starts with a collection of "pipes" on a grid (centered on each vertex), clicking on a piece rotates it $90^circ$, and a piece can be rotated any number of times. The goal is to turn the final configuration of pipes into a spanning tree (of the grid graph), as shown in the screenshots below.



Example



An example of Noodles!



Question



We left the conference with an unsolved question:
Are solutions to this puzzle always unique? Or is it possible to come up with a starting configuration (on any size grid) that has multiple trees as solutions?



(The prevailing guess is that solutions are unique, but nobody could manage to prove it.)






combinatorics graph-theory puzzle trees




combinatorics graph-theory puzzle trees






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked 5 hours ago









Peter KageyPeter Kagey

1,61772053




1,61772053








  • 1




    $begingroup$
    This genre of logic puzzle is known originally as Netwalk.
    $endgroup$
    – Mike Earnest
    4 hours ago










  • $begingroup$
    @MikeEarnest, thanks for the reference. Based on this picture from this Reddit thread, it looks like (some versions of) Netwalk are on a torus instead of a grid—although that presents an interesting generalization of this question.
    $endgroup$
    – Peter Kagey
    4 hours ago
















  • 1




    $begingroup$
    This genre of logic puzzle is known originally as Netwalk.
    $endgroup$
    – Mike Earnest
    4 hours ago










  • $begingroup$
    @MikeEarnest, thanks for the reference. Based on this picture from this Reddit thread, it looks like (some versions of) Netwalk are on a torus instead of a grid—although that presents an interesting generalization of this question.
    $endgroup$
    – Peter Kagey
    4 hours ago










1




1




$begingroup$
This genre of logic puzzle is known originally as Netwalk.
$endgroup$
– Mike Earnest
4 hours ago




$begingroup$
This genre of logic puzzle is known originally as Netwalk.
$endgroup$
– Mike Earnest
4 hours ago












$begingroup$
@MikeEarnest, thanks for the reference. Based on this picture from this Reddit thread, it looks like (some versions of) Netwalk are on a torus instead of a grid—although that presents an interesting generalization of this question.
$endgroup$
– Peter Kagey
4 hours ago






$begingroup$
@MikeEarnest, thanks for the reference. Based on this picture from this Reddit thread, it looks like (some versions of) Netwalk are on a torus instead of a grid—although that presents an interesting generalization of this question.
$endgroup$
– Peter Kagey
4 hours ago












1 Answer
1






active

oldest

votes


















4












$begingroup$

No, solutions are not unique. The four "T" shaped pieces in the grid below can be rotated into either of two configurations:



┏━━━┓

┗┓╻╻┃

╺┫┣┛┃

┏┫┣╸┃

╹╹┗━┛

┏━━━┓

┗┓╻╻┃

╺┻┻┛┃

┏┳┳╸┃

╹╹┗━┛





share|cite|improve this answer








New contributor




edderiofer is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






$endgroup$













  • $begingroup$
    Based on the picture in the question, all three ends of the T shapes have to connect to an adjacent piece; you can't have one end of the T run directly into the flat side of a | piece.
    $endgroup$
    – Misha Lavrov
    3 hours ago










  • $begingroup$
    It doesn't "run directly into the flat side of a | piece". There's actually a dead end "╸" piece in between, so this satisfies all the rules.
    $endgroup$
    – edderiofer
    3 hours ago










  • $begingroup$
    Oh, I see. I couldn't quite read it in your answer, but it showed up when I highlighted it and now everything makes sense.
    $endgroup$
    – Misha Lavrov
    2 hours ago






  • 1




    $begingroup$
    Here is an interactive illustration of the solution: chiark.greenend.org.uk/~sgtatham/puzzles/js/…
    $endgroup$
    – Mike Earnest
    2 hours ago












Your Answer








StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
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: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3191645%2funiqueness-of-spanning-tree-on-a-grid%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









4












$begingroup$

No, solutions are not unique. The four "T" shaped pieces in the grid below can be rotated into either of two configurations:



┏━━━┓

┗┓╻╻┃

╺┫┣┛┃

┏┫┣╸┃

╹╹┗━┛

┏━━━┓

┗┓╻╻┃

╺┻┻┛┃

┏┳┳╸┃

╹╹┗━┛





share|cite|improve this answer








New contributor




edderiofer is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






$endgroup$













  • $begingroup$
    Based on the picture in the question, all three ends of the T shapes have to connect to an adjacent piece; you can't have one end of the T run directly into the flat side of a | piece.
    $endgroup$
    – Misha Lavrov
    3 hours ago










  • $begingroup$
    It doesn't "run directly into the flat side of a | piece". There's actually a dead end "╸" piece in between, so this satisfies all the rules.
    $endgroup$
    – edderiofer
    3 hours ago










  • $begingroup$
    Oh, I see. I couldn't quite read it in your answer, but it showed up when I highlighted it and now everything makes sense.
    $endgroup$
    – Misha Lavrov
    2 hours ago






  • 1




    $begingroup$
    Here is an interactive illustration of the solution: chiark.greenend.org.uk/~sgtatham/puzzles/js/…
    $endgroup$
    – Mike Earnest
    2 hours ago
















4












$begingroup$

No, solutions are not unique. The four "T" shaped pieces in the grid below can be rotated into either of two configurations:



┏━━━┓

┗┓╻╻┃

╺┫┣┛┃

┏┫┣╸┃

╹╹┗━┛

┏━━━┓

┗┓╻╻┃

╺┻┻┛┃

┏┳┳╸┃

╹╹┗━┛





share|cite|improve this answer








New contributor




edderiofer is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






$endgroup$













  • $begingroup$
    Based on the picture in the question, all three ends of the T shapes have to connect to an adjacent piece; you can't have one end of the T run directly into the flat side of a | piece.
    $endgroup$
    – Misha Lavrov
    3 hours ago










  • $begingroup$
    It doesn't "run directly into the flat side of a | piece". There's actually a dead end "╸" piece in between, so this satisfies all the rules.
    $endgroup$
    – edderiofer
    3 hours ago










  • $begingroup$
    Oh, I see. I couldn't quite read it in your answer, but it showed up when I highlighted it and now everything makes sense.
    $endgroup$
    – Misha Lavrov
    2 hours ago






  • 1




    $begingroup$
    Here is an interactive illustration of the solution: chiark.greenend.org.uk/~sgtatham/puzzles/js/…
    $endgroup$
    – Mike Earnest
    2 hours ago














4












4








4





$begingroup$

No, solutions are not unique. The four "T" shaped pieces in the grid below can be rotated into either of two configurations:



┏━━━┓

┗┓╻╻┃

╺┫┣┛┃

┏┫┣╸┃

╹╹┗━┛

┏━━━┓

┗┓╻╻┃

╺┻┻┛┃

┏┳┳╸┃

╹╹┗━┛





share|cite|improve this answer








New contributor




edderiofer is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






$endgroup$



No, solutions are not unique. The four "T" shaped pieces in the grid below can be rotated into either of two configurations:



┏━━━┓

┗┓╻╻┃

╺┫┣┛┃

┏┫┣╸┃

╹╹┗━┛

┏━━━┓

┗┓╻╻┃

╺┻┻┛┃

┏┳┳╸┃

╹╹┗━┛






share|cite|improve this answer








New contributor




edderiofer is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|cite|improve this answer



share|cite|improve this answer






New contributor




edderiofer is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









answered 3 hours ago









edderioferedderiofer

1561




1561




New contributor




edderiofer is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





edderiofer is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






edderiofer is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.












  • $begingroup$
    Based on the picture in the question, all three ends of the T shapes have to connect to an adjacent piece; you can't have one end of the T run directly into the flat side of a | piece.
    $endgroup$
    – Misha Lavrov
    3 hours ago










  • $begingroup$
    It doesn't "run directly into the flat side of a | piece". There's actually a dead end "╸" piece in between, so this satisfies all the rules.
    $endgroup$
    – edderiofer
    3 hours ago










  • $begingroup$
    Oh, I see. I couldn't quite read it in your answer, but it showed up when I highlighted it and now everything makes sense.
    $endgroup$
    – Misha Lavrov
    2 hours ago






  • 1




    $begingroup$
    Here is an interactive illustration of the solution: chiark.greenend.org.uk/~sgtatham/puzzles/js/…
    $endgroup$
    – Mike Earnest
    2 hours ago


















  • $begingroup$
    Based on the picture in the question, all three ends of the T shapes have to connect to an adjacent piece; you can't have one end of the T run directly into the flat side of a | piece.
    $endgroup$
    – Misha Lavrov
    3 hours ago










  • $begingroup$
    It doesn't "run directly into the flat side of a | piece". There's actually a dead end "╸" piece in between, so this satisfies all the rules.
    $endgroup$
    – edderiofer
    3 hours ago










  • $begingroup$
    Oh, I see. I couldn't quite read it in your answer, but it showed up when I highlighted it and now everything makes sense.
    $endgroup$
    – Misha Lavrov
    2 hours ago






  • 1




    $begingroup$
    Here is an interactive illustration of the solution: chiark.greenend.org.uk/~sgtatham/puzzles/js/…
    $endgroup$
    – Mike Earnest
    2 hours ago
















$begingroup$
Based on the picture in the question, all three ends of the T shapes have to connect to an adjacent piece; you can't have one end of the T run directly into the flat side of a | piece.
$endgroup$
– Misha Lavrov
3 hours ago




$begingroup$
Based on the picture in the question, all three ends of the T shapes have to connect to an adjacent piece; you can't have one end of the T run directly into the flat side of a | piece.
$endgroup$
– Misha Lavrov
3 hours ago












$begingroup$
It doesn't "run directly into the flat side of a | piece". There's actually a dead end "╸" piece in between, so this satisfies all the rules.
$endgroup$
– edderiofer
3 hours ago




$begingroup$
It doesn't "run directly into the flat side of a | piece". There's actually a dead end "╸" piece in between, so this satisfies all the rules.
$endgroup$
– edderiofer
3 hours ago












$begingroup$
Oh, I see. I couldn't quite read it in your answer, but it showed up when I highlighted it and now everything makes sense.
$endgroup$
– Misha Lavrov
2 hours ago




$begingroup$
Oh, I see. I couldn't quite read it in your answer, but it showed up when I highlighted it and now everything makes sense.
$endgroup$
– Misha Lavrov
2 hours ago




1




1




$begingroup$
Here is an interactive illustration of the solution: chiark.greenend.org.uk/~sgtatham/puzzles/js/…
$endgroup$
– Mike Earnest
2 hours ago




$begingroup$
Here is an interactive illustration of the solution: chiark.greenend.org.uk/~sgtatham/puzzles/js/…
$endgroup$
– Mike Earnest
2 hours ago


















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics 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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3191645%2funiqueness-of-spanning-tree-on-a-grid%23new-answer', 'question_page');
}
);

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







-

Popular posts from this blog

What other Star Trek series did the main TNG cast show up in?

Image
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ margin-bottom:0; } 4 I'm referring to Picard, Riker, Data, Worf, Geordi, Dr. Crusher, Wesley Crusher, Chief O'Brien and family, Deanna Troi, Guinan. I know Picard and Worf show up on DS9, though I haven't seen it myself. I'm curious what happened to the characters after that last episode of TNG? star-trek star-trek-tng share | improve this question edited 10 hours ago Ham Sandwich 6,051 2 25 75 ...
Read more

Berlina muro

Image
La berlina muro ĉe Bethaniendamm, 1986 La berlina muro aŭ simple la muro [1] , nomita ankaŭ "kontraŭfaŝisma remparo" en propaganda lingvo de la iama Germana Demokratia Respubliko, estis parto de la interngermana limo, kiu dividis de la 13-a de aŭgusto 1961 ĝis la 9-a de novembro 1989 okcidentan Berlinon de la orienta parto de la urbo kaj de la ĉirkaŭa tereno de la GDR. Ĝi estis unu el la plej famaj simboloj de la malvarma milito kaj de la disdivido de Germanio. Pli ol simpla muro, la berlina muro estis fakte tuta defendokonstruaĵo kun du muroj, ena malplena strio, rondirvojo, gardturoj kaj alarmsistemoj. Dum la provo transiri la severe garditan limon al okcidenta Berlino multaj homoj estis mortigitaj. La preciza nombro de viktimoj estas pridisputita kaj ne certa; la nombroj anoncataj varias inter 86 kaj 238 mortintoj. La malplifortiĝo de Sovetunio kaj la politiko de liberigo gvidita de Miĥail Gorbaĉov ebligis al la orientgermanoj faligi la 9-an de novembro 1989 l...
Read more

Berlina aerponto

Image
Flugkoridoroj dum la blokado de Berlino La Berlina aerponto estas la provizigo de okcidenta Berlino per aviadiloj fare de la aliancanoj inter la 23-a de junio 1948 kaj la 12-a de majo 1949 dum la blokado de Berlino fare de la sovetia armeo. Enhavo 1 Historio 1.1 La aerkoridoroj 1.2 Unuaj flugoj 1.3 Plibonigo de la aerponto 1.4 Fino de la aerponto 1.5 Rozinbombiloj 1.6 Bilanco 2 Flughavenoj 2.1 Berlino 2.2 Okcidenta Germanio 3 Aviadiloj de la berlina aerponto 4 15-a datreveno de la aerponto 5 Bibliografio 6 Referencoj 7 Eksteraj ligiloj Historio | General Lucius D. Clay, militguberniestro de la usona okupadzono Jam antaŭ la berlina aerponto estiĝis la malgranda aerponto . La estro de la sovetia militadministracio en Germanio, Vasili Daniloviĉ Sokolovski, ordonis la 1-an de aprilo 1948, kiel reago al la konferenco de Londono inter britoj, francoj kaj reprezentantoj de Benelukso pri aligo de Germa...
Read more