![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
Maze Generation AlgorithmsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Matthew Ireland. I shall talk on a selection of methods for generating random 2D mazes, exploring and comparing the complexities and traits of various algorithms, including Aldous-Broder’s, Recursive Subdivision, Recursive Backtracking, Kruskal’s and more. I shall comment on how to adapt these algorithms for producing mazes with specific textures, and briefly touch on some solving methods. During this exploration, I shall also look at possible applications of the algorithms outside of maze generation. I shall lastly look at how generation algorithms might be extended into higher dimensions, such as a 3D maze (easily pictured as a cube, or a series of 2D ‘floors’), or 4D or higher (less easy to picture, but can still be represented); and whether such generalisations come at an infeasible complexity cost. This talk is part of the Churchill CompSci Talks series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsICT4D: ICT for Development The Abdus Salam Lecture Fluid Mechanics (CUED) Cambridge University Medical Humanities Society Cambridge Biomedical Research Centre "Distinguished Visitors" 2015 Lecture Series CUQM LecturesOther talksPolynomial approximation of high-dimensional functions on irregular domains Public innovation: can innovation methods help solve social challenges? Academic CV Workshop NatHistFest: the 99th Conversazione and exhibition on the wonders of the natural world. How India Became Democratic: Comparative Perspectives (Panel discussion led by Gary Gerstle and Tim Harper) A domain-decomposition-based model reduction method for convection-diffusion equations with random coefficients |