in reply to Re: How implement AMB in perl?
in thread How implement AMB in perl?

...we perform a depth-first search of the amb choice tree, and whenever we brush against failure, we backtrack to the most recent node of the tree that offers a further choice

That statement screams, regexes, or rather a creative use of them, akin to:

The N-queens problem using pure regexes
Pure regex Hamiltonian Circuit solution


Replies are listed 'Best First'.
Re^3: How implement AMB in perl?
by dk (Chaplain) on Apr 29, 2007 at 09:40 UTC
    That'd be also interesting indeed, except that regexes should operate on the OP-tree, not a string. Shouldn't be a too big problem with (??{}) and friends though.
      I tried hard to use a regex (??{}) solution for my Pentominos Solving Quine, but in a recursion scenario, there are some issues with re-entrancy which can cause (at least some versions of) perl's interpreter to crash.

      If you don't have to recurse, then by all means, any backtracking problem you can implement in the regex engine is fiendishly clever. Of course, "clever code" is for fun, not generally for maintainable code.

      [ e d @ h a l l e y . c c ]