pat browne wrote:

Hi, Does anyone know where there are any Haskell implementations of the the River Crossing puzzle (AKA Farmer/Fox/Goose/Grain).

I wrote some code to generate a map of some version of the game: https://code.goto10.org/svn/maximus/2009/boatman/BoatMan.hs ghc -O2 --make BoatMan.hs && ./BoatMan | neato -Tpng | display Claude -- http://claudiusmaximus.goto10.org

Or you could look at my blog posts describing the implementation of the Cannibals and Missionaries variant step by step. First a naive approach and secondly using a state monad solution. http://adoseoflogic.blogspot.com/2009/07/cannibals-missionaries-and-state-mo... Cheers, Bas 2009/9/28 pat browne

Hi, Does anyone know where there are any Haskell implementations of the the River Crossing puzzle (AKA Farmer/Fox/Goose/Grain). There are several variations but the general ideas are explained at: http://en.wikipedia.org/wiki/River_crossing_puzzle http://en.wikipedia.org/wiki/Fox,_goose_and_bag_of_beans_puzzle

I have found one at: http://www.shido.info/hs/haskell9.html

Thanks, Pat

_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

-- http://adoseoflogic.blogspot.com/