References about the mathematics of mazes or labyrinths












2












$begingroup$


I am looking for references on mazes or labyrinths. I prefer books, but research articles are welcome, too. I am looking for the mathematical point of view of mazes, not their history or development.



Any book that has a chapter about mazes is welcome, too (for example, a graph theory book with a chapter about mazes).



So far, I've found Mazes for Programmers, which talks about how to code mazes.










share|cite|improve this question











$endgroup$












  • $begingroup$
    For me its hard to point you a deep reference, because mathematically a labyrinth usually is considered as a plane graph. We may look for paths in this graph: Eulerian, Hamiltonian, a shortest path between two given vertices.Less abstract consideration of labyrinths is in recreational mathematics.
    $endgroup$
    – Alex Ravsky
    Jan 14 at 5:57












  • $begingroup$
    For instance, in Martin Garnder’s “Mathematical puzzles and diversions” is a small chapter devoted to them, but I have only a Russian translation of this book.
    $endgroup$
    – Alex Ravsky
    Jan 14 at 5:58










  • $begingroup$
    The Wolfram Demonstrations Project has a few dozen entries for "maze". I don't know how deep any of them goes into theory (that's not really what the Demonstrations are for), but Demonstrations often include citations that could be helpful. You might also search Ed Pegg's MathPuzzle.com for entries about mazes. I agree that Martin Gardner is also a good source for this kind of thing.
    $endgroup$
    – Blue
    Jan 14 at 6:12


















2












$begingroup$


I am looking for references on mazes or labyrinths. I prefer books, but research articles are welcome, too. I am looking for the mathematical point of view of mazes, not their history or development.



Any book that has a chapter about mazes is welcome, too (for example, a graph theory book with a chapter about mazes).



So far, I've found Mazes for Programmers, which talks about how to code mazes.










share|cite|improve this question











$endgroup$












  • $begingroup$
    For me its hard to point you a deep reference, because mathematically a labyrinth usually is considered as a plane graph. We may look for paths in this graph: Eulerian, Hamiltonian, a shortest path between two given vertices.Less abstract consideration of labyrinths is in recreational mathematics.
    $endgroup$
    – Alex Ravsky
    Jan 14 at 5:57












  • $begingroup$
    For instance, in Martin Garnder’s “Mathematical puzzles and diversions” is a small chapter devoted to them, but I have only a Russian translation of this book.
    $endgroup$
    – Alex Ravsky
    Jan 14 at 5:58










  • $begingroup$
    The Wolfram Demonstrations Project has a few dozen entries for "maze". I don't know how deep any of them goes into theory (that's not really what the Demonstrations are for), but Demonstrations often include citations that could be helpful. You might also search Ed Pegg's MathPuzzle.com for entries about mazes. I agree that Martin Gardner is also a good source for this kind of thing.
    $endgroup$
    – Blue
    Jan 14 at 6:12
















2












2








2





$begingroup$


I am looking for references on mazes or labyrinths. I prefer books, but research articles are welcome, too. I am looking for the mathematical point of view of mazes, not their history or development.



Any book that has a chapter about mazes is welcome, too (for example, a graph theory book with a chapter about mazes).



So far, I've found Mazes for Programmers, which talks about how to code mazes.










share|cite|improve this question











$endgroup$




I am looking for references on mazes or labyrinths. I prefer books, but research articles are welcome, too. I am looking for the mathematical point of view of mazes, not their history or development.



Any book that has a chapter about mazes is welcome, too (for example, a graph theory book with a chapter about mazes).



So far, I've found Mazes for Programmers, which talks about how to code mazes.







graph-theory reference-request recreational-mathematics puzzle






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 14 at 6:05









Blue

48.4k870154




48.4k870154










asked Jan 12 at 16:36









aaaaaaaaaaaa

538




538












  • $begingroup$
    For me its hard to point you a deep reference, because mathematically a labyrinth usually is considered as a plane graph. We may look for paths in this graph: Eulerian, Hamiltonian, a shortest path between two given vertices.Less abstract consideration of labyrinths is in recreational mathematics.
    $endgroup$
    – Alex Ravsky
    Jan 14 at 5:57












  • $begingroup$
    For instance, in Martin Garnder’s “Mathematical puzzles and diversions” is a small chapter devoted to them, but I have only a Russian translation of this book.
    $endgroup$
    – Alex Ravsky
    Jan 14 at 5:58










  • $begingroup$
    The Wolfram Demonstrations Project has a few dozen entries for "maze". I don't know how deep any of them goes into theory (that's not really what the Demonstrations are for), but Demonstrations often include citations that could be helpful. You might also search Ed Pegg's MathPuzzle.com for entries about mazes. I agree that Martin Gardner is also a good source for this kind of thing.
    $endgroup$
    – Blue
    Jan 14 at 6:12




















  • $begingroup$
    For me its hard to point you a deep reference, because mathematically a labyrinth usually is considered as a plane graph. We may look for paths in this graph: Eulerian, Hamiltonian, a shortest path between two given vertices.Less abstract consideration of labyrinths is in recreational mathematics.
    $endgroup$
    – Alex Ravsky
    Jan 14 at 5:57












  • $begingroup$
    For instance, in Martin Garnder’s “Mathematical puzzles and diversions” is a small chapter devoted to them, but I have only a Russian translation of this book.
    $endgroup$
    – Alex Ravsky
    Jan 14 at 5:58










  • $begingroup$
    The Wolfram Demonstrations Project has a few dozen entries for "maze". I don't know how deep any of them goes into theory (that's not really what the Demonstrations are for), but Demonstrations often include citations that could be helpful. You might also search Ed Pegg's MathPuzzle.com for entries about mazes. I agree that Martin Gardner is also a good source for this kind of thing.
    $endgroup$
    – Blue
    Jan 14 at 6:12


















$begingroup$
For me its hard to point you a deep reference, because mathematically a labyrinth usually is considered as a plane graph. We may look for paths in this graph: Eulerian, Hamiltonian, a shortest path between two given vertices.Less abstract consideration of labyrinths is in recreational mathematics.
$endgroup$
– Alex Ravsky
Jan 14 at 5:57






$begingroup$
For me its hard to point you a deep reference, because mathematically a labyrinth usually is considered as a plane graph. We may look for paths in this graph: Eulerian, Hamiltonian, a shortest path between two given vertices.Less abstract consideration of labyrinths is in recreational mathematics.
$endgroup$
– Alex Ravsky
Jan 14 at 5:57














$begingroup$
For instance, in Martin Garnder’s “Mathematical puzzles and diversions” is a small chapter devoted to them, but I have only a Russian translation of this book.
$endgroup$
– Alex Ravsky
Jan 14 at 5:58




$begingroup$
For instance, in Martin Garnder’s “Mathematical puzzles and diversions” is a small chapter devoted to them, but I have only a Russian translation of this book.
$endgroup$
– Alex Ravsky
Jan 14 at 5:58












$begingroup$
The Wolfram Demonstrations Project has a few dozen entries for "maze". I don't know how deep any of them goes into theory (that's not really what the Demonstrations are for), but Demonstrations often include citations that could be helpful. You might also search Ed Pegg's MathPuzzle.com for entries about mazes. I agree that Martin Gardner is also a good source for this kind of thing.
$endgroup$
– Blue
Jan 14 at 6:12






$begingroup$
The Wolfram Demonstrations Project has a few dozen entries for "maze". I don't know how deep any of them goes into theory (that's not really what the Demonstrations are for), but Demonstrations often include citations that could be helpful. You might also search Ed Pegg's MathPuzzle.com for entries about mazes. I agree that Martin Gardner is also a good source for this kind of thing.
$endgroup$
– Blue
Jan 14 at 6:12












0






active

oldest

votes











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: "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%2f3071093%2freferences-about-the-mathematics-of-mazes-or-labyrinths%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















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%2f3071093%2freferences-about-the-mathematics-of-mazes-or-labyrinths%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

Can a sorcerer learn a 5th-level spell early by creating spell slots using the Font of Magic feature?

Does disintegrating a polymorphed enemy still kill it after the 2018 errata?

A Topological Invariant for $pi_3(U(n))$