NOTE: The engine is not perfect yet, if a word has more than 1 of the same letter in it, it won't be able to detect it. It does not change the results, it just means some of the possible options are not correct. (Ex. 2 yellow "L"s or 1 green and 1 yellow). It's pretty self-explanatory... I don't know how helpful this will be, but the engine can still work without a full word or a word that doesn't exist.
Here's a link to a random site to test the engine: https://wordleunlimited.org/ For info on the way this engine calculates results, here you go: The engine uses an imported dictionary to check for words. If your result does not appear, it either isn't in the dictionary or there was user error. The possible list simply finds words from the dictionary that could match. When calculating the best option, the engine assigns each word a score and finds which one has the highest. The score is calculated through a list that has sorted through the dictionary for every occurrence that a single letter has appeared in a word (Ex. apple adds 1 to a, 1 to p, 1 to l, and 1 to e). This list is then re-organized and orders the letters by their totals, with the highest total giving 26 score (26 letters in alphabet), with the lowest giving 1. All of this data was collected with one-time code and is not run IN the engine itself, but a separate engine simply to get these results. With this data, the engine sums up the letters in each word with the list scoring (DUPLICATE LETTERS GIVE NO SCORE BECAUSE THEY GIVE LESS INFO THAN A LETTER WITH A LOW SCORE). Once again, another engine... Pretty interesting one. Of the 3 I have made recently, probably the most advanced as well.
