In this paper we present a new approach to the synthesis of combinational circuits and the mapping of standard gates like nand, nor, aoi and oai with arbitrary number of inputs. Our method is based on the provable optimal synthesis of the fanoutfree regions of a circuit, represented as normal and-or-trees. Normal and-or-trees enable TROY to rebalance the regions with respect to delay without loosing area and lead to a much larger search space than that used by Tree Matching. Fast heuristics derived from the optimal approach yield significantly faster results than SIS on many standard benchmark circuits.