In conventional computer-aided synthetic route design, only a single-chain linear reaction is considered as a design target, but branching routes, the width and depth of networks, and the number of leaf nodes should also be included in the design variable. Therefore, it is necessary to solve the intractable combinatorial problem defined over an extremely vast search space.