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.
YouTube Encyclopedic
-
1/2Views:77 4931 047 650
-
What's Your Worst Fear? Thomas Brodie-Sangster - Dylan O'Brien - Maze Runner Halloween Special
-
Maze Runner Cast Challenge - with Dylan O'Brien and Thomas Brodie-Sangster
Transcription
See also
References
- 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. |
This page was last edited on 7 July 2023, at 21:51