Research output

Conference Paper (in Formal Publication) ()

Building a Better Mouse Maze

Citation
Enright J & Faben JD (2016) Building a Better Mouse Maze In: Demaine ED, Grandoni F (ed.) 8th International Conference on Fun with Algorithms, FUN 2016, June 8–10, 2016, La Maddalena, Italy, Saarbrucken/Wadern, Germany: Dagstuhl Publishing. 8th International Conference on Fun with Algorithms, 8.6.2016 - 10.6.2016, La Maddalena, Italy, pp. 15:1-15:12.

Abstract
Mouse Maze is a Flash game about Squeaky, a mouse who has to navigate a subset of the grid using a simple deterministic rule, which naturally generalises to a game on arbitrary graphs with some interesting chaotic dynamics. We present the results of some evolutionary algorithms which generate graphs which effectively trap Squeaky in the maze for long periods of time, and some theoretical results on how long he can be trapped. We then discuss what would happen to Squeaky if he couldn’t count, and present some open problems in the area.

Keywords
graph; evolutionary; genetic algorithm; traversal

StatusPublished
EditorDemaine ED, Grandoni F
AuthorsEnright Jessica, Faben John D
Title of seriesLIPIcs: Leibniz International Proceedings in Informatics
Publication date2016
Date of public distribution06/2016
Date accepted by journal01/04/2016
URLhttp://drops.dagstuhl.de/…ete.pdf#page=243
PublisherDagstuhl Publishing
Place of publicationSaarbrucken/Wadern, Germany
ISSN of series 1868-8969
ISBN 978-3-95977-005-7
LanguageEnglish
© University of Stirling FK9 4LA Scotland UK • Telephone +44 1786 473171 • Scottish Charity No SC011159
My Portal