https://github.com/drmikecrowe/wordle-blog

Code for my wordle blog post
https://github.com/drmikecrowe/wordle-blog

Last synced: 13 days ago
JSON representation

Code for my wordle blog post

• Host: GitHub
• URL: https://github.com/drmikecrowe/wordle-blog
• Owner: drmikecrowe
• Created: 2022-03-06T15:36:17.000Z (almost 3 years ago)
• Default Branch: master
• Last Pushed: 2022-03-07T17:51:08.000Z (almost 3 years ago)
• Last Synced: 2024-11-05T21:14:13.416Z (2 months ago)
• Language: TypeScript
• Size: 1.22 MB
• Stars: 0
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Objectives

1.  Identify the 15 most common letters in the list

2.  Find all words that use all 15 letters in the list

## Ideas

* Rank of a word is the sum of the offsets of each letter in the list of 15 words.  Example:

  * Best letters:

    * s - 0

    * e - 1

    * a - 2

    * o - 3

    * r - 4

    * i - 5

    * l - 6

    * t - 7

    * n - 8

    * u - 9

    * d - 10

    * c - 11

    * y - 12

    * p - 13

    * m - 14

  * Word:  `abase` would have rank:

    * a: 2

    * b: 100

    * a: 2

    * s: 0

    * e: 1

    * total: 105

* Find potential words recursively

  * Start with all words from the letter `s`

  * Find all words in letter `e`, then `a` that don't have an `s` in them

  * Recurse finding all words that have unique letters and use all 15 of the best letters