This article is about the electronic design routing method. For the novel by James Dashner, see The Maze Runner. For the film adaptation of the novel, see The Maze Runner (film).
In electronic design automation, maze runner is a connection routing method that represents the entire routing space as a grid. Parts of this grid are blocked by components, specialised areas, or already present wiring. The grid size corresponds to the wiring pitch of the area. The goal is to find a chain of grid cells that go from point A to point B.
A maze runner may use the Lee algorithm. It uses a wave propagation style (a wave are all cells that can be reached in n steps) throughout the routing space. The wave stops when the target is reached, and the path is determined by backtracking through the cells.
Lee, C. Y. (1961), "An Algorithm for Path Connections and Its Applications", IRE Transactions on Electronic Computers, EC-10 (2): 346–365, doi:10.1109/TEC.1961.5219222. One of the first descriptions of a maze router.
This electronics-related article is a stub. You can help Wikipedia by expanding it.
maze, runner, this, article, about, electronic, design, routing, method, novel, james, dashner, maze, runner, film, adaptation, novel, maze, runner, film, this, article, needs, additional, citations, verification, please, help, improve, this, article, adding, . This article is about the electronic design routing method For the novel by James Dashner see The Maze Runner For the film adaptation of the novel see The Maze Runner film This article needs additional citations for verification Please help improve this article by adding citations to reliable sources Unsourced material may be challenged and removed Find sources Maze runner news newspapers books scholar JSTOR December 2006 Learn how and when to remove this template message In electronic design automation maze runner is a connection routing method that represents the entire routing space as a grid Parts of this grid are blocked by components specialised areas or already present wiring The grid size corresponds to the wiring pitch of the area The goal is to find a chain of grid cells that go from point A to point B A maze runner may use the Lee algorithm It uses a wave propagation style a wave are all cells that can be reached in n steps throughout the routing space The wave stops when the target is reached and the path is determined by backtracking through the cells See also editAutorouterReferences editLee C Y 1961 An Algorithm for Path Connections and Its Applications IRE Transactions on Electronic Computers EC 10 2 346 365 doi 10 1109 TEC 1961 5219222 One of the first descriptions of a maze router nbsp This electronics related article is a stub You can help Wikipedia by expanding it vte Retrieved from https en wikipedia org w index php title Maze runner amp oldid 1164085855, wikipedia, wiki, book, books, library,
