The document describes a method for routing nets within standard cells using Boolean satisfiability (SAT). It outlines the stages of generating candidate routes, pruning redundant and conflicting routes, and formulating the routing problem as a SAT instance. The SAT instance models each possible route as a variable and encodes connectivity and quality constraints as clauses. Solving the SAT problem produces a legal routing that satisfies all constraints. Experimental results showed the SAT-based approach could route standard cells faster than traditional methods while meeting design rules.