By: admin on: Jun 20,2008
In: countdown
The Countdown code I showed you isn't really taking advantage of Haskell's laziness.
We should only have to check entries up until the point that we have enough matches
(in the current code 'take 4 $ getAnagrams') and that's good. However, we
have to generate the whole powerset first, so that we can sort it in reverse [...]
By: admin on: Jun 18,2008
In: countdown, haskell
Will on #geekup has been working on a
Countdown
letters and numbers game
solver written in Python. I thought it'd be fun to try to do it in Haskell,
and started with the letters game (anagram) solver.
Starting with a string of jumbled letters, the goal is to make the longest possible
anagram. I remember the first time [...]