I love trying to find anagrams, but sometimes (especially with long phrases), trying to keep track of letters you already used and letters still available can be a pain, so I wanted to make a small tool to do this for me.
This was also the occasion for me to try a more formal way to do some JavaScript, with automation, unit testing, and so on.
This JavaScript allows you to find which anagrams can or cannot be made using a set of letters, provided you do the search.
It is not a script running automatically through a dictionary to find the possible rearrangements. You will find plenty of those already, and though it is funny, it is not in the current scope of this project.