[helicon]

Posts like this are why I love HN. I recently wrote a program to find anagrams of a given string (a Countdown solver if you live in the UK).

It includes a really naive method for generating all possible permutations of the string, but reading this post I can immediately see a far better way to do it.

That's my weekend taken care of! thanks to the poster and author.

[wyldfire]

"Good morning, that's a nice tnettenba." [1]

[1] https://www.youtube.com/watch?v=lsFAokXCxTI

[forinti]

There was a recent post about anagrams and the author just put all the letters in alphabetical order and then compared the words, which was more efficient than generating permutations.

[Johnny_Brahms]

I ran an anagram website in the 90s, and that was what we did. We stored word lists with a key of all their letters sorted. We then calculated anagram scores on demand because I couldn't work out a nice enough way to store those.

We had about 300 hits/day so it didn't matter.

[hfsktr]

That is what I did for this challenge: https://www.reddit.com/r/dailyprogrammer/comments/52enht/201...

https://github.com/Rhebel/DailyProgrammer/blob/master/DailyP...

I know my code is super verbose compared to other people's but I'd rather be understood than clever.

[NegativeLatency]

Sounds interesting, do you have a link?

[forinti]

http://blog.plover.com/lang/anagram-scoring.html