Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/23541
Appears in Collections:Computing Science and Mathematics Conference Papers and Proceedings
Peer Review Status: Refereed
Author(s): Enright, Jessica
Faben, John D
Contact Email: jae@maths.stir.ac.uk
Title: Building a Better Mouse Maze
Editor(s): Demaine ED, ED
Grandoni, F
Citation: Enright J & Faben JD (2016) Building a Better Mouse Maze. In: Demaine ED E & Grandoni F (eds.) 8th International Conference on Fun with Algorithms, FUN 2016, June 8–10, 2016, La Maddalena, Italy. LIPIcs: Leibniz International Proceedings in Informatics. 8th International Conference on Fun with Algorithms, La Maddalena, Italy, 08.06.2016-10.06.2016. Saarbrucken/Wadern, Germany: Dagstuhl Publishing, pp. 15:1-15:12. http://www2.idsia.ch/cms/fun16/; https://doi.org/10.4230/LIPIcs.FUN.2016.15
Issue Date: 2016
Date Deposited: 4-Jul-2016
Series/Report no.: LIPIcs: Leibniz International Proceedings in Informatics
Conference Name: 8th International Conference on Fun with Algorithms
Conference Dates: 2016-06-08 - 2016-06-10
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: VoR - Version of Record
Rights: © Jessica Enright and John Faben; licensed under Creative Commons License CC-BY
URL: http://www2.idsia.ch/cms/fun16/
Licence URL(s): http://creativecommons.org/licenses/by/4.0/

Files in This Item:
File Description SizeFormat 
EnrightFabenLIPIcsJune2016.pdfFulltext - Published Version530.34 kBAdobe PDFView/Open



This item is protected by original copyright



A file in this item is licensed under a Creative Commons License Creative Commons

Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.