Rose, Kevin, Ethan Burns, and Wheeler Ruml. 2021. “Best-First Search for Bounded-Depth Trees”. Proceedings of the International Symposium on Combinatorial Search 2 (1):134-41. https://doi.org/10.1609/socs.v2i1.18206.