Times reported in this maze are not in any way 'to scale'. The car takes 2 time units to traverse a road, and lights stay on red (or green) for 7 time units. The REQ. IN (required) times are feasible. Solutions somewhat less than these have been found. But they are not minimal. There is a mathematical technique for finding minimal times based on the now defunct 'Moore's Algorithm' for minimal paths in static networks, but this requires programming (as I did for the Snakepit Maze).