Rose, Kevin, Ethan Burns, and Wheeler Ruml. “Best-First Search for Bounded-Depth Trees”. Proceedings of the International Symposium on Combinatorial Search 2, no. 1 (July 15, 2011): 134–141. Accessed July 18, 2026. https://ojs.aaai.org/index.php/SOCS/article/view/18206.