It can catch all solutions where one of the words is a permutation of another without any significant overhead by mapping a word to all of its permutations - wh

It can catch all solutions where one of the words is a permutation of another without any significant overhead by mapping a word to all of its permutations - which is more or less already there. Besides that, we will have to rerun without one of the matched words to see other non-permutation solutions. From what I have seen only by removing "m" there is a solution. > The fastest solutions out there today are capable of reading in the file, and finding all 538 solutions from words_alpha.txt in around 0.002s for multiple threads, and around 0.010s for a single thread. Language? Edit: If we have access to the solution and use the simplex method, we can actually find all combinations with no real overhead. The simplex method essentially jumps from vertex to vertex in the polyhedra, when it can't produce a better solution, it will terminate. Thus, given one solution we have access to all of them since they are available on the same plane and all vertices have the same value. It's just that we will have to do discrete jumps which is not necessarily difficult to do.