Skip to content

A Wordle solver classic desk accessory for the Apple IIGS

License

Notifications You must be signed in to change notification settings

jeremysrand/wordlesolve

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

27 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Wordle Solver

This is a classic desk accessory for the Apple IIgs which solves Wordle puzzles for you. Rather than being the game, this can be used to solve the puzzle for you by telling you the best guesses (hopefully).

Wordle Solver Screenshot

It will give you its first guess of a five letter word. Then, you are prompted to indicate which letters are correct. You do so by typing a character for each letter:

  • If the letter is in the correct position, then use a '^' character to indicate that letter is right.
  • If the letter exists in the word somewhere else but is in the wrong position, use a '?' character to indicate this.
  • If the letter does not exist in the word at all, use a 'x' or 'X' character to indicate this.

Note that if the letter appears multiple times in the solution, then it is possible to have multiple letters marked as correct or correct and in the wrong position. If the guess has more letters of that type in it, then one should be marked as wrong.

YouTube video demo on real HW

Download a disk image

Download a SHK archive

Also, this solver does seem to be able to solve puzzles in WordleGS by Dan Malec. However, using a classic desk accessory for the solver makes this pretty inconvenient on a single GS. For each guess, you have to exit the CDA and go back to the puzzle. And on return to the CDA, it is starting from the first guess again so you have to re-enter everything to get to the next guess. But as described in the section below, if I implement this as a new desk accessory, then it should be more convenient to solve a wordle puzzle on a single GS.

Implementation

In terms of implementation, this is a brute force approach that was done quickly during KansasFest 2022. The algorithm could almost definitely be made better by being smart about how words are represented in memory and eliminating large sets of words as impossible in bulk rather than one at a time. But it does work and that was my goal.

With the brute force implementation, it does take a few seconds for an unaccelerated GS to make its guess. It may take about 15 seconds for it to make its second guess. A more efficient algorithm would bring this down and maybe make it more or less instantaneous. This is an exercise left to the reader.

Also, if you give bad feedback to the solver, perhaps saying a letter is present and then later say that it isn't present, the solver will behave oddly and likely fail to find a solution. There is no checking to see if you are inconsistent in the feedback but in theory, there could be a check for that.

Future

I would like to turn this into a desktop application or new desk accessory. Probably a new desk accessory. The text based input is prone to user error. But if this was a GUI, then once you mark a letter as correct, then the GUI could automatically lock that character in as correct. That way you wouldn't have to keep telling the solver over and over stuff it already knows and you don't run the risk of contradicting yourself.