Micromouse is an event where small robot mice solve a 16x16 maze. A robot is a mechanical or Virtual Artificial agent In practice it is usually an electro-mechanical system which by its appearance or movements A mouse (plural mice) is a small Animal that belongs to one A maze is a complex Tour puzzle in the form of a complex branching passage through which the solver must find a route It began in late 1970s, although there is some indication of events in 1950. This article is about the Decade 1970-1979 For the Year 1970 see 1970. Events are held worldwide, and are most popular in the UK, U.S., Japan, Singapore and South Korea. The United Kingdom of Great Britain and Northern Ireland, commonly known as the United Kingdom, the UK or Britain,is a Sovereign state located The United States of America —commonly referred to as the For a topic outline on this subject see List of basic Japan topics. Singapore South Korea, officially the Republic of Korea and often referred to as Korea ( Korean: 대한민국 tɛː
The maze is made up of a 16 by 16 grid of cells, each 180 mm square with walls 50 mm high. The mice are completely autonomous robots that must find their way from a predetermined starting position to the central area of the maze unaided. Autonomous robots are Robots which can perform desired tasks in unstructured environments without continuous human guidance The mouse will need to keep track of where it is, discover walls as it explores, map out the maze and detect when it has reached the goal. Having reached the goal, the mouse will typically perform additional searches of the maze until it has found an optimal route from the start to the center. Once the optimal route has been found, the mouse will run that route in the shortest possible time.
Mice can run at up to three meters per second, with current world records around 6~7 seconds, depending on the maze design.
Mice can use various searching algorithms. In Computer science, a search algorithm, broadly speaking is an Algorithm that takes a problem as Input and returns a solution to the problem usually One of the more popular ones is A*. In Computer science, A* (pronounced "A star" is a best-first, Graph search algorithm that finds the least-cost path from a given initial