[Haskell-cafe] combinatorial search with running bound

[Michael Mossey]

I made some mistakes in editing this code before posting it. I wrote 
BoxBounds in a couple places when I meant Box. Also made calls to boxesSep' 
when I meant boxesSep2'. Hopefully should all be obvious from context.

Michael Mossey wrote:
> 
> I have a combinatorial search problem that requires a
> running lower bound to be tracked in order to prune the search. I have enough
> Haskell experience to know how to do a combinatorial search, for example with
> list compresions or the list monad, but I don't know how to keep a running
> lower bound.