Suppose you have a number of anagrams for the same letters, for example:alertingalteringintegralrelatingtriangleSuppose you have a game where you must find all the anagrams, by placing letters one at a time in a grid. If you place a in the first column in two different rows, then a is no longer valid in any other row, because there all the words that start with a have already been accounted for.a.......a.......However, if you place a in the first position in one row and l in the second position in another, then a in the first position and l in the second position is no longer possible in any of the other rows.a........l......Even more complex, this arrangement ...a........l.............g... means that i and n cannot be placed in the last positions 6 and 7 for either of the remaining two rows, even though no i's or n's have been placed yet.Is there already an algorithm that I can follow to determine which letters are possible in which places, as the game progresses?
Filtering algorithm for word game
algorithms;language agnostic;filtering