- Introduction
- Download
- Quick Start
- Mouse API
- Scorekeeping
- Cell Walls
- Cell Color
- Cell Text
- Reset Button
- Maze Files
- Building From Source
- Related Projects
- Citations
- Acknowledgements
mms is a Micromouse simulator.
It makes it easy to write and test maze-solving code without a physical robot.
With it, you can:
- Test how your robot would behave in a real maze
- Visualize what your robot is thinking
- Show known/unknown walls
- Set the color of the cells
- Display ASCII text on the cells
- Simulate a crash-and-reset scenario
- Test your algorithm on custom maze files
- Write code in any language you want
Previous versions of mms exist in the old/ directory.
For information about Micromouse, see the Micromouse Wikipedia page.
You can download pre-compiled binaries from the releases page. Simply download the asset corresponding to your platform:
-
Windows: Download and unzip
windows.zipand run the "mms" exe- Note: you may get a warning like "Microsoft Defender SmartScreen prevented an unrecognized app from starting. Running this app might put your PC at risk." To get past that warning, click "More info" and then "Run anyway"
-
macOS: Download and unzip
macos.zipand run the "mms" app- Note: you may get warnings about running an application from an unidentified developer. To get past those warnings, control-click on the app and select "Open" (as opposed to simply double-clicking on the app).
If pre-compiled binaries for your platform are unavailable, you'll have to build from source.
Writing a Micromouse algorithm is easy! Here are some available templates:
| Language | Repo |
|---|---|
| Arduino | mackorone/mms-arduino |
| C | mackorone/mms-c |
| C++ | mackorone/mms-cpp |
| Java | mackorone/mms-java |
| JavaScript | mackorone/mms-javascript |
| Python | mackorone/mms-python |
| Rust | hardliner66/mms-rs |
If a template for a particular language is missing, don't fret! Writing your own template is as easy as writing to stdout, reading from stdin, and implementing the mouse API below. If you have a template you'd like to share, please make a pull request!
Algorithms communicate with the simulator via stdin/stdout. To issue a command, simply print to stdout. To read a response, simply read from stdin. All valid commands are listed below. Invalid commands are simply ignored.
For commands that return a response, it's recommended to wait for the response before issuing additional commands.
int mazeWidth();
int mazeHeight();
bool wallFront();
bool wallRight();
bool wallLeft();
// Both of these commands can result in "crash"
void moveForward(int distance = 1);
void moveForwardHalf(int numHalfSteps = 1);
void turnRight();
void turnLeft();
void turnRight45();
void turnLeft45();
void setWall(int x, int y, char direction);
void clearWall(int x, int y, char direction);
void setColor(int x, int y, char color);
void clearColor(int x, int y);
void clearAllColor();
void setText(int x, int y, string text);
void clearText(int x, int y);
void clearAllText();
bool wasReset();
void ackReset();
int/float getStat(string stat);- Args: None
- Action: None
- Response: The height of the maze
- Args: None
- Action: None
- Response: The width of the maze
- Args: None
- Action: None
- Response:
trueif there is a wall in front of the robot, elsefalse
- Args: None
- Action: None
- Response:
trueif there is a wall to the right of the robot, elsefalse
- Args: None
- Action: None
- Response:
trueif there is a wall to the left of the robot, elsefalse
- Args:
N- (optional) The number of full steps to move forward, default1
- Action: Move the robot forward the specified number of full-steps
- Response:
crashifN < 1or the mouse cannot complete the movement- else
ackonce the movement completes
- Args:
N- (optional) The number of half steps to move forward, default1
- Action: Move the robot forward the specified number of half-steps
- Response:
crashifN < 1or the mouse cannot complete the movement- else
ackonce the movement completes
- Args: None
- Action: Turn the robot ninty degrees to the right
- Response:
ackonce the movement completes
- Args: None
- Action: Turn the robot ninty degrees to the left
- Response:
ackonce the movement completes
- Args: None
- Action: Turn the robot forty-five degrees to the right
- Response:
ackonce the movement completes
- Args: None
- Action: Turn the robot forty-five degrees to the left
- Response:
ackonce the movement completes
- Args:
X- The X coordinate of the cellY- The Y coordinate of the cellD- The direction of the wall:n,e,s, orw
- Action: Display a wall at the given position
- Response: None
- Args:
X- The X coordinate of the cellY- The Y coordinate of the cellD- The direction of the wall:n,e,s, orw
- Action: Clear the wall at the given position
- Response: None
- Args:
X- The X coordinate of the cellY- The Y coordinate of the cellC- The character of the desired color
- Action: Set the color of the cell at the given position
- Response: None
- Args:
X- The X coordinate of the cellY- The Y coordinate of the cell
- Action: Clear the color of the cell at the given position
- Response: None
- Args: None
- Action: Clear the color of all cells
- Response: None
- Args:
X- The X coordinate of the cellY- The Y coordinate of the cellTEXT- The desired text, max length 10
- Action: Set the text of the cell at the given position
- Response: None
- Args:
X- The X coordinate of the cellY- The Y coordinate of the cell
- Action: Clear the text of the cell at the given position
- Response: None
- Args: None
- Action: Clear the text of all cells
- Response: None
- Args: None
- Action: None
- Response:
trueif the reset button was pressed, elsefalse
- Args: None
- Action: Allow the mouse to be moved back to the start of the maze
- Response:
ackonce the movement completes
- Args:
stat: A string representing the stat to query. Available stats are:total-distance (int)total-turns (int)best-run-distance (int)best-run-turns (int)current-run-distance (int)current-run-turns (int)total-effective-distance (float)best-run-effective-distance (float)current-run-effective-distance (float)score (float)
- Action: None
- Response: The value of the stat, or
-1if no value exists yet. The value will either be a float or integer, according to the types listed above.
Algorithm Request (stdout) Simulator Response (stdin)
-------------------------- --------------------------
mazeWidth 16
mazeWidth 16
wallLeft true
setWall 0 0 W <NO RESPONSE>
wallFront false
moveForward ack
turnLeft ack
wallFront true
moveForward crash
setColor 0 1 r <NO RESPONSE>
setText 0 1 whoops <NO RESPONSE>
wasReset false
...
wasReset true
clearAllColor <NO RESPONSE>
clearAllText <NO RESPONSE>
ackReset ackThe Stats tab displays information that can be used to score an algorithm's efficiency. This tab displays stats such as the total distance and total number of turns. It also displays the distance and number of turns for the algorithm's best start-to-finish run, if the algorithm makes multiple runs from the start tile to the goal. The distance and number of turns for the current start-to-finish run is also displayed.
There is another value displayed, called Effective Distance. This number may
differ from Distance if moveForward is called with the optional distance
parameter. If moveForward is called with an integer greater than 2, each tile
after the second tile will add only half a point to the effective distance. This
simulates a mouse driving faster if it can drive in a straight line for more
than a few tiles. For example, moveForward(5) will increase the distance by 5
but will increase the effective distance by only 3.5. A mouse will incur a
15-point penalty on its next run's Effective Distance if it uses ackReset to
return to the start tile.
A final score is computed for the algorithm after it terminates. A lower score is better. The final score depends on the best start-to-finish run and on the overall run, according to the following equation.
score = best run turns + best run effective distance + 0.1 * (total turns + total effective distance)
The mouse must reach the goal to receive a score. If the mouse never reaches the goal, the score will be 2000.
Cell walls allow the robot to diplay where it thinks walls exist, and where it thinks they don't. At the beginning of each run, all walls are assumed non-existent. By default, the simulator will display walls that haven't been discovered as dark red. As the robot explores the maze, it should set walls as it discovers them.
The available colors are as follows:
| Char | Color |
|---|---|
| k | Black |
| b | Blue |
| a | Gray |
| c | Cyan |
| g | Green |
| o | Orange |
| r | Red |
| w | White |
| y | Yellow |
| B | Dark Blue |
| C | Dark Cyan |
| A | Dark Gray |
| G | Dark Green |
| R | Dark Red |
| Y | Dark Yellow |
All printable ASCII characters,
except for <DEL>, can be used as cell text. Any invalid characters, such as a
newline or tab, will be replaced with ?.
When no algorithm is running, the simulator displays the distance of each cell from the center of the maze.
The reset button makes it possible to test crash handling code. Press the
button to simulate a crash. Your algorithm should periodically check if the
button was pressed via wasReset. If so, your algorithm should reset any
internal state and then call ackReset to send the robot back to the beginning
of the maze.
The simulator supports a few different maze file formats, as specified below. If your format isn't supported, feel free to put up a pull request.
Note that, in order to use a maze in the simulator, it must be:
- Nonempty
- Rectangular
- Fully enclosed
Also note that official Micromouse mazes have additional requirements:
- No inaccessible locations
- Exactly three starting walls
- Only one entrance to the center
- Has a hollow center, i.e., the center peg has no walls attached to it
- Has walls attached to every peg except the center peg
- Is unsolvable by a wall-following robot
Here are some links to collections of maze files:
Example:
+---+---+---+
| | |
+ + + +
| | |
+---+---+---+
- Each cell is 5 spaces wide and 3 spaces tall
- All characters besides spaces count as walls
- Walls are determined by checking the locations marked with an "x":
+ x +
x x
+ x +
Format:
X Y N E S W
- X: The X coordinate of the cell
- Y: The Y coordinate of the cell
- N:
1if there is a wall on the north side, else0 - S:
1if there is a wall on the east side, else0 - E:
1if there is a wall on the south side, else0 - W:
1if there is a wall on the west side, else0
Example:
0 0 0 1 1 1
0 1 1 0 0 1
1 0 0 0 1 1
1 1 1 1 0 0
2 0 0 1 1 0
2 1 1 1 0 1
Result:
+---+---+---+
| | |
+ + + +
| | |
+---+---+---+
If you want to write code for the simulator itself, you'll need to build the project from source. Below are some OS-specific instructions. If instructions for your platform are unavailable, you can probably still run the simulator, you'll just have to figure it out on your own for now.
Install Qt:
- Download the Qt open source installer: https://www.qt.io/download-qt-installer-oss
- If you don't already have a Qt account, you'll need to make one
- When prompted to select components, choose "MinGW"
Build the project using QtCreator:
- Download or clone mms
- Run QtCreator and open
mms/src/mms.pro - Configure the project to use "MinGW"
- Build and run the project
Install Xcode: https://developer.apple.com/xcode/
Install Qt:
- Download the Qt open source installer: https://www.qt.io/download-qt-installer-oss
- If you don't already have a Qt account, you'll need to make one
- When prompted to select components, choose "macOS"
Build the project using QtCreator:
- Download or clone mms
- Run QtCreator and open
mms/src/mms.pro - Configure the project to use "clang 64bit"
- Build and run the project
Install Qt:
- Download the Qt open source installer: https://www.qt.io/download-qt-installer-oss
- Make the installer executable:
chmod +x qt-unified-linux-x64-3.0.6-online.run - Run the installer executable:
./qt-unified-linux-x64-3.0.6-online.run - If you don't already have a Qt account, you'll need to make one
- When prompted to select components, choose "Desktop gcc 64-bit"
- Once the installer finishes, the
qmakebinary can be found in the installation directory
Clone, build, and run the project:
# Clone the repo
git clone git@github.com:mackorone/mms.git
# Build the simulator
cd mms/src
qmake && make
# Run the simulator
../../bin/mms- @zdasaro wrote a proxy for the Priceton University Robotics Club: mms-competition-proxy
- @P1n3appl3 created an Arch Linux package: mms-git
Feel free to open a pull request if you want your work listed here!
- https://link.springer.com/article/10.1007/s42452-021-04239-7
- https://ictaes.org/wp-content/uploads/2020/09/IJAE-2020-Vol.03-No.02/7_Sanjaya_Vol3_No2.pdf
- https://www.researchgate.net/publication/361212084_International_Journal_of_Advanced_Engineering_Optimizing_Tremaux_Algorithm_in_Micromouse_Using_Potential_Values
- https://medium.com/@minikiraniamayadharmasiri/micromouse-from-scratch-algorithm-maze-traversal-shortest-path-floodfill-741242e8510
- https://www.technologyx2.com/proj_robot_rover/2020/6/15/project-micromouse-robot-simulator
- http://iamsudharsan.com/maze-solver-robot/
- https://www.instructables.com/Micro-Mouse-for-Beginnersth/
- http://micromouseusa.com/?p=2288
- https://github.com/sohamroy19/a-maze-jerry
- https://github.com/Madhunc5229/MicroMouse_MazeSolver
- https://github.com/Karansutradhar/Maze-Solver-Robot-Depth-First-Search
- https://github.com/nalindas9/enpm809y-final-project
- https://github.com/james-ralph8555/DrexelMicromouse2020
- https://github.com/darshit-desai/Maze-Solver-simulation-using-Wall-Following-Algorithm-OOP
| Name | Author | Used For |
|---|---|---|
| polypartition | Ivan Fratric | Polygon Triangulation |
| Qt | The Qt Company | Framework and GUI |
