[Haskell-cafe] Re: Newbie: Project: Missionary and Cannibal
paul at cogito.org.uk
Tue Jan 16 14:54:16 EST 2007
This is presumably your homework. See
This kind of problem is often solved by using the List monad, so try
looking at that first.
Failing that, have a list of moves to make a sequence. Then make a list
of all possible sequences. Then filter out the ones that break the
rules. Whatever is left is the answer you want.
More information about the Haskell-Cafe