Building a Better Mouse Maze

Authors Jessica Enright, John D. Faben

Thumbnail PDF


  • Filesize: 0.51 MB
  • 12 pages

Document Identifiers

Author Details

Jessica Enright
John D. Faben

Cite AsGet BibTex

Jessica Enright and John D. Faben. Building a Better Mouse Maze. In 8th International Conference on Fun with Algorithms (FUN 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 49, pp. 15:1-15:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)


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


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Bilgehan Çavdaroğlu and Fuat Balcı. Mice can count and optimize count-based decisions. Psychonomic Bulletin &Review, pages 1-6, 2015. URL:
  2. Andrew Drizen. private communication, 2016. Google Scholar
  3. Jane Green, editor. Personal Computer World: Best of PCW Software for the Commodore 64. Century Communications, 1984. Google Scholar
  4. Zbigniew Michalewicz and David B. Fogel. How to Solve It: Modern Heuristics. Springer, 2000. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail