LispForum

Backtracking in C (or C++) is significantly harder than it would be in Lisp, so even if you know C++ writing requirements in it might influences your thoughts. I'm not entirely sure what you mean by valuations. I mean that every continuation is assigned a valuation to, and if this valuation is < th...

How do I have to modify this source code so that a) every continuation is valuated and discarded if the valuation is too low b) there is an evaluation of the whole sequence at the end. c) the valuations of each step are remembered (C++-Code: void backtrack(T& sequence, int cumulated_valuation) {...

Thank you very much, Warren, I'll try this out!

Thanks.

I *do* own PAIP. Which chapter should I look at?

Hi,

I am new to Common Lisp and looking for a CL implementation of the backtracking algorithm described in here: http://en.wikipedia.org/wiki/Backtracking

Can someone help me?