Conference Paper (in Formal Publication) ()
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.
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.
graph; evolutionary; genetic algorithm; traversal
|Editor||Demaine ED, Grandoni F|
|Authors||Enright Jessica, Faben John D|
|Title of series||LIPIcs: Leibniz International Proceedings in Informatics|
|Date of public distribution||06/2016|
|Date accepted by journal||01/04/2016|
|Place of publication||Saarbrucken/Wadern, Germany|
|ISSN of series||1868-8969|