The goal of any retrosynthesis algorithm is to find routes where all the starting material is known, i.e., solved routes. In Table , we list the number of targets for which at least one solution has been found. For the set-n1 routes, both MCTS and Retro* find solutions to about 97% of the targets, and the small difference is probably not statistically significant. However, DFPN only manages to find solutions for 85% of the targets, a significant decrease in performance. It is unclear how many iterations are necessary to reach the performance of MCTS and Retro*, but the extra search time is most likely not warranted.