A recursive router with 100% completion

The necessary and sufficient condition for routability of a special class of routing problems is provided. The proof is based on mathematical induction. A recursive maze router has been developed based on the necessary and sufficient condition, and 100% completion is guaranteed, provided that the original routing problem is routable.<
>