When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FUN.2016.15
URN: urn:nbn:de:0030-drops-58743
Go to the corresponding LIPIcs Volume Portal

Enright, Jessica ; Faben, John D.

Building a Better Mouse Maze

14.pdf (0.5 MB)


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.

BibTeX - Entry

  author =	{Jessica Enright and John D. Faben},
  title =	{{Building a Better Mouse Maze}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{15:1--15:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Erik D. Demaine and Fabrizio Grandoni},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-58743},
  doi =		{10.4230/LIPIcs.FUN.2016.15},
  annote =	{Keywords: graph, evolutionary, genetic algorithm, traversal}

Keywords: graph, evolutionary, genetic algorithm, traversal
Seminar: 8th International Conference on Fun with Algorithms (FUN 2016)
Issue Date: 2016
Date of publication: 25.05.2016

DROPS-Home | Fulltext Search | Imprint Published by LZI