Closed durka closed 2 years ago
This assumes each guess clears a maximum of one word. How would one model the automatic solving of every word all of whose positions have been guessed, which is Kilordle's mechanic?
Nice, though I think it should be 1000, as the number is more beautiful; and only 0.5% less than the calculated 1005.
Also, the number of guess isn't really 1005, considering the mechanic. I believe if all rows are green at some point, it will all be marked as correct anyway. (so multiple words solved at the same time.)
As a matter of fact, it can also be made a arbitrary number of 300, 150 or 100, for no real reasons. Otherwise, you can collect data from real players. On the first finish, I got 114. Some other people got 91, 111, 119, 126.
According to international law of n-ordles, the number of guesses is
n + 5
. See the following data:Therefore, this game should put the player out of their misery after 1005 guesses.
Here is a test using a limit of 5 to show the effect:
As I mostly added conditionals, it may be easiest to review using "hide whitespace".