Optimising zig-zags in maze-routing algorithm

Lee´s algorithm (1961) for routing always finds a minimum length path, if one exists. We discuss an enhancement to an earlier maze-routing algorithm to reduce the number of zig-zag line segments in the routing path. This method would find a path between two points, if one exists, on a rectangular grid of cells. A line search method using efficient data structures has been applied that would reduce the number of line segments in the path. Blocking cells are introduced as obstacles in finding the path. All line segments are considered as horizontal and vertical only. An implementation of the method and its experimental results are reported