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-monad.html
Cheers,
Bas
2009/9/28
pat browne-2 wrote:
Hi,
Does anyone know where there are any Haskell implementations of the the
River Crossing puzzle (AKA Farmer/Fox/Goose/Grain).
Here is an implementation of the similar problem with good explanation (see
PDF): http://web.engr.oregonstate.edu/~erwig/zurg/
It isn't
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
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
