Rose, K., Burns, E., & Ruml, W. (2021). Best-First Search for Bounded-Depth Trees. Proceedings of the International Symposium on Combinatorial Search, 2(1), 134–141. https://doi.org/10.1609/socs.v2i1.18206