Hendrik, There is also the all too often forgotten iterative deepening depth-first search algorithm: https://en.wikipedia.org/wiki/Iterative_deepening_depth-first_search which has the advantages of both, at a very small cost in search time compared to doing depth-first search with the right cut-off depth bound from the start.
There are several other considerations to ponder regarding which algorithm is the right one (backward model, state size, duplicate checking, cost of continuations, size growth of the search tree, etc.), but I'll abstain for now unless you want more details. -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/racket-users/CABNTSaG0QVorRohByDurLjU__2z%3DSgkCzOjz5C5Q9DYTVRZiwQ%40mail.gmail.com.
