This is great! A few days ago, I wrote a Wordle solver in C. It selects a word to minimize the number of words assuming the worst-case green/yellow. So, it sounds like these two are in direct conflict. My solver is deterministic, and it looks like the adversarial is too, so they always play the same game: S E R A I (0 green, 0 yellow, 429 words remain) M O L D Y (1 green, 0 yellow, 35 words remain) C E N T U (0 greem…
Are you using the same dictionary? I used the same technique, and got: NARES DOILY TOUCH And then VOUCH / COUCH / POUCH / GOUCH / MOUCH.
I found my code a bit difficult to debug at the end because it's still halfway decent at playing wordle. So, I fully admit I might not be doing it right!
But one thing I also did was allow it to pick a word it knew wasn't possible but could eliminate a lot of possibilities quickly.