Four ways of implementing a backtrack search

This is a stub article.
By now I have known four ways of implementing a backtrack search.
1.Using a recursive function. This is the plain vanilla way, which I learnt from "Programming Abstractions in C".
2.Explicitly managing the stack.
3.Using "amb" to employ non-deterministic computation, and
4.Using streams. The SICP implements the "control" aspect in Prolog with streams.