Or you could look at my blog posts describing the implementation of the Cannibals and Missionaries variant step by step.<br>First a naive approach and secondly using a state monad solution.<br><br><a href="http://adoseoflogic.blogspot.com/2009/07/cannibals-missionaries-and-state-monad.html">http://adoseoflogic.blogspot.com/2009/07/cannibals-missionaries-and-state-monad.html</a><br>
<br>Cheers,<br><br>Bas<br><br><div class="gmail_quote">2009/9/28 pat browne <span dir="ltr">&lt;<a href="mailto:Patrick.Browne@comp.dit.ie">Patrick.Browne@comp.dit.ie</a>&gt;</span><br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
Hi,<br>
Does anyone know where there are any Haskell implementations of the the<br>
River Crossing  puzzle (AKA Farmer/Fox/Goose/Grain).<br>
There are several variations but the general ideas are explained at:<br>
<a href="http://en.wikipedia.org/wiki/River_crossing_puzzle" target="_blank">http://en.wikipedia.org/wiki/River_crossing_puzzle</a><br>
<a href="http://en.wikipedia.org/wiki/Fox,_goose_and_bag_of_beans_puzzle" target="_blank">http://en.wikipedia.org/wiki/Fox,_goose_and_bag_of_beans_puzzle</a><br>
<br>
I have found one at:<br>
<a href="http://www.shido.info/hs/haskell9.html" target="_blank">http://www.shido.info/hs/haskell9.html</a><br>
<br>
<br>
Thanks,<br>
Pat<br>
<br>
_______________________________________________<br>
Haskell-Cafe mailing list<br>
<a href="mailto:Haskell-Cafe@haskell.org">Haskell-Cafe@haskell.org</a><br>
<a href="http://www.haskell.org/mailman/listinfo/haskell-cafe" target="_blank">http://www.haskell.org/mailman/listinfo/haskell-cafe</a><br>
</blockquote></div><br><br clear="all"><br>-- <br><a href="http://adoseoflogic.blogspot.com/">http://adoseoflogic.blogspot.com/</a><br><br>