[Haskell-cafe] combinatorial search with running bound

Henning Thielemann lemming at henning-thielemann.de
Mon Sep 28 17:24:39 EDT 2009

On Sat, 26 Sep 2009, 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.

Sometimes the omega monad can help by searching the space in a diagonal 

More information about the Haskell-Cafe mailing list