Building a Better Mouse Maze

Enright, J. and Faben, J. D. (2016) Building a Better Mouse Maze. In: 8th International Conference on Fun with Algorithms (FUN 2016), La Maddalena, Italy, 08-10 Jun 2016, 15:1-15:12. ISBN 9783959770057 (doi: 10.4230/LIPIcs.FUN.2016.15)

203101.pdf - Published Version
Available under License Creative Commons Attribution.



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.

Item Type:Conference Proceedings
Glasgow Author(s) Enlighten ID:Enright, Dr Jessica
Authors: Enright, J., and Faben, J. D.
College/School:College of Science and Engineering > School of Computing Science
Copyright Holders:Copyright © 2016 Jessica Enright and John Faben
First Published:First published in Proceedings of the 8th International Conference on Fun with Algorithms (FUN 2016): 15:1-15:12
Publisher Policy:Reproduced under a Creative Commons License

University Staff: Request a correction | Enlighten Editors: Update this record