wordle: find top words per letter position frequency

Author: mckelveygreg

README.md

@@ -1 +1,102 @@
-# fun
+# Typescript playground
+
+## Wordle
+
+Letter Count:
+┬─────┬──────┐
+│ 0 │ 1 │
+┼─────┼──────┤
+│ 'a' │ 975 │
+│ 'b' │ 280 │
+│ 'c' │ 475 │
+│ 'd' │ 393 │
+│ 'e' │ 1230 │
+│ 'f' │ 229 │
+│ 'g' │ 310 │
+│ 'h' │ 387 │
+│ 'i' │ 670 │
+│ 'j' │ 27 │
+│ 'k' │ 210 │
+│ 'l' │ 716 │
+│ 'm' │ 316 │
+│ 'n' │ 573 │
+│ 'o' │ 753 │
+│ 'p' │ 365 │
+│ 'q' │ 29 │
+│ 'r' │ 897 │
+│ 's' │ 668 │
+│ 't' │ 729 │
+│ 'u' │ 466 │
+│ 'v' │ 152 │
+│ 'w' │ 194 │
+│ 'x' │ 37 │
+│ 'y' │ 424 │
+│ 'z' │ 40 │
+┴─────┴──────┘
+Letter Rank:
+┌─────────┬────────┬───────┐
+│ (index) │ Letter │ Count │
+├─────────┼────────┼───────┤
+│ 0 │ 'e' │ 1230 │
+│ 1 │ 'a' │ 975 │
+│ 2 │ 'r' │ 897 │
+│ 3 │ 'o' │ 753 │
+│ 4 │ 't' │ 729 │
+│ 5 │ 'l' │ 716 │
+│ 6 │ 'i' │ 670 │
+│ 7 │ 's' │ 668 │
+│ 8 │ 'n' │ 573 │
+│ 9 │ 'c' │ 475 │
+│ 10 │ 'u' │ 466 │
+│ 11 │ 'y' │ 424 │
+│ 12 │ 'd' │ 393 │
+│ 13 │ 'h' │ 387 │
+│ 14 │ 'p' │ 365 │
+│ 15 │ 'm' │ 316 │
+│ 16 │ 'g' │ 310 │
+│ 17 │ 'b' │ 280 │
+│ 18 │ 'f' │ 229 │
+│ 19 │ 'k' │ 210 │
+│ 20 │ 'w' │ 194 │
+│ 21 │ 'v' │ 152 │
+│ 22 │ 'z' │ 40 │
+│ 23 │ 'x' │ 37 │
+│ 24 │ 'q' │ 29 │
+│ 25 │ 'j' │ 27 │
+└─────────┴────────┴───────┘
+All words with the 7 top letters (and no duplicated letters):
+┌─────────┬─────────┐
+│ (index) │ Word │
+├─────────┼─────────┤
+│ 0 │ 'irate' │
+│ 1 │ 'later' │
+│ 2 │ 'trial' │
+│ 3 │ 'alter' │
+│ 4 │ 'alert' │
+│ 5 │ 'ratio' │
+│ 6 │ 'trail' │
+└─────────┴─────────┘
+
+Top 3 letters per position
+┌─────────┬──────────────┬──────────────┬──────────────┐
+│ (index) │ 0 │ 1 │ 2 │
+├─────────┼──────────────┼──────────────┼──────────────┤
+│ 0 │ [ 's', 365 ] │ [ 'c', 198 ] │ [ 'b', 173 ] │
+│ 1 │ [ 'a', 304 ] │ [ 'o', 279 ] │ [ 'r', 267 ] │
+│ 2 │ [ 'a', 306 ] │ [ 'i', 266 ] │ [ 'o', 243 ] │
+│ 3 │ [ 'e', 318 ] │ [ 'n', 182 ] │ [ 's', 171 ] │
+│ 4 │ [ 'e', 422 ] │ [ 'y', 364 ] │ [ 't', 253 ] │
+└─────────┴──────────────┴──────────────┴──────────────┘
+All words with the top 3 letters for each position (and no duplicated letters):
+┌─────────┬─────────┐
+│ (index) │ Word │
+├─────────┼─────────┤
+│ 0 │ 'coast' │
+│ 1 │ 'brine' │
+│ 2 │ 'saint' │
+│ 3 │ 'briny' │
+│ 4 │ 'crane' │
+│ 5 │ 'boast' │
+│ 6 │ 'crony' │
+│ 7 │ 'crone' │
+└─────────┴─────────┘

dist/index.cjs

@@ -2338,6 +2338,34 @@ var topWords = wordlist.filter((word) => {
 });
 console.log("All words with the 7 top letters (and no duplicated letters):");
 console.table(topWords.map((word) => ({ Word: word })));
+var countByIndex = wordlist.reduce((all, curr) => {
+  curr.split("").forEach((letter, index) => {
+    all[index] = all[index] || {};
+    all[index][letter] = (all[index][letter] || 0) + 1;
+  });
+  return all;
+}, {});
+var countByIndexArr = Object.entries(countByIndex);
+console.log("");
+countByIndexArr.forEach((arr) => {
+  console.log(Object.entries(arr[1]).sort((a, b) => a[0].localeCompare(b[0])).map((letter) => ({
+    [letter[0]]: letter[1]
+  })));
+});
+var countByIndexRank = countByIndexArr.map((position) => {
+  return Object.entries(position[1]).sort((a, b) => b[1] - a[1]).slice(0, 3);
+});
+console.log("Top 3 letters per position");
+console.table(countByIndexRank);
+var topWordsByIndex = wordlist.filter((word) => {
+  return word.split("").every((c, i) => {
+    return countByIndexRank[i].some(([topLetter]) => {
+      return topLetter === c;
+    });
+  }) && (/* @__PURE__ */ new Set([...word.split("")])).size === 5;
+});
+console.log("All words with the top 3 letters for each position (and no duplicated letters):");
+console.table(topWordsByIndex.map((word) => ({ Word: word })));
 var wordle = "wordle";
 
 // src/index.ts

src/wordle/wordle.ts

@@ -44,4 +44,52 @@ const topWords = wordlist.filter((word) => {
 console.log("All words with the 7 top letters (and no duplicated letters):")
 console.table(topWords.map((word) => ({ Word: word })))
 
+// count letters per index position
+const countByIndex = wordlist.reduce(
+	(all: Record<number, LetterCount>, curr) => {
+		curr.split("").forEach((letter, index) => {
+			all[index] = all[index] || {}
+			all[index][letter] = (all[index][letter] || 0) + 1
+		})
+		return all
+	},
+	{}
+)
+const countByIndexArr = Object.entries(countByIndex)
+console.log("")
+
+countByIndexArr.forEach((arr) => {
+	console.log(
+		Object.entries(arr[1])
+			.sort((a, b) => a[0].localeCompare(b[0]))
+			.map((letter) => ({
+				[letter[0]]: letter[1],
+			}))
+	)
+})
+
+const countByIndexRank = countByIndexArr.map((position) => {
+	return Object.entries(position[1])
+		.sort((a, b) => b[1] - a[1])
+		.slice(0, 3)
+})
+console.log("Top 3 letters per position")
+console.table(countByIndexRank)
+
+// filter list to only words that have letters in the top letters for each index
+const topWordsByIndex = wordlist.filter((word) => {
+	return (
+		word.split("").every((c, i) => {
+			return countByIndexRank[i].some(([topLetter]) => {
+				return topLetter === c
+			})
+		}) && new Set([...word.split("")]).size === 5
+	)
+})
+console.log(
+	"All words with the top 3 letters for each position (and no duplicated letters):"
+)
+console.table(topWordsByIndex.map((word) => ({ Word: word })))
+// const commonWords = topWordsByIndex.filter((word) => topWords.includes(word))
+// console.table(commonWords.map((word) => ({ Word: word })))
 export const wordle = "wordle"