Re: [racket-users] continuations for search

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-of

Re: [racket-users] continuations for search

I don't recall seeing that implemented in Racket/Scheme, but, in class, years ago, Leslie Kaelbling mentioned using Scheme captured continuations for AI search backtracking, as I mentioned (and Matthias has good comments in that thread): https://groups.google.com/d/msg/racket-users/jHPtw3Gzqk4/

[racket-users] continuations for search

Depth-first searches are easy to code by simple recursion. Breadth-first searches are good for finding short solutions and not getting caught in infinite recursions. Are there any ready-made tools in Racket for turning depth-first search code into breadth-first by strategic use of continuatio