|Appears in Collections:||Computing Science and Mathematics Conference Papers and Proceedings|
|Peer Review Status:||Refereed|
Faben, John D
|Title:||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.|
|Series/Report no.:||LIPIcs: Leibniz International Proceedings in Informatics|
|Conference Name:||8th International Conference on Fun with Algorithms|
|Conference Location:||La Maddalena, Italy|
|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.|
|Status:||Publisher version (final published refereed version)|
|Rights:||© Jessica Enright and John Faben; licensed under Creative Commons License CC-BY|
|EnrightFabenLIPIcsJune2016.pdf||530.34 kB||Adobe PDF||View/Open|
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact email@example.com providing details and we will remove the Work from public display in STORRE and investigate your claim.