I brute-forced my way through a solution to the Solitaire cipher quiz challenge last night:
http://mult.ifario.us/articles/2006/10/25/solitaire-cipher-in-haskell Full source is linked from the entry, or look here: http://mult.ifario.us/files/solitaire.hs I think (i.e., know) that my list-based implementation of the shuffling is somewhat inelegant, and I can imagine one that uses a monad to encapsulate the state of the deck. Nonetheless, I think I'm happy with the data structure for the deck. Comments / criticism welcome. --- Paul R Brown [EMAIL PROTECTED] http://mult.ifario.us/ _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
