Well, finding the best word for a given tile rack played on a given position can be expressed staggeringly simply in Haskell. I'm just wondering if there's som

Well, finding the best word for a given tile rack played on a given position can be expressed staggeringly simply in Haskell. I'm just wondering if there's some clever way to store and search a whole board without getting into something messy and halfway-imperative. Something that can be expressed as mostly a composition of simple library functions. Plus, I've always had issues with multidimensional structures -- I can never quite settle on what's the most intuitive way to express them.