25:["$","title",null,{"children":"Kendall's Wordle solver | Kendall Leonard | Observable"}] 49:Td0b,

Wordle Helper

Guess

Feedback (Click the squares to change colors)

Previously Ruled Out Letters

Recommended Words

Guessed Words

Letter Frequency in Possible Answers

4a:T2964,setTimeout(() => { //here we have a timeout so that the html setup can load before any of the javascript kicks in (this prevents errors) let guessedWords = []; //defining an empty array for words we have already guessed let yellowLetterPositions = {}; //creating an empty object for yellow letter positions, whose name is self explanitory let feedbackArray = ["X", "X", "X", "X", "X"]; //creating a feedback array with a default of 'x', which indicates a wrong letter const guessInput = document.getElementById("guess"); // gets the guess input from the document const excludeInput = document.getElementById("exclude"); // gets the excluded letters from the user input const submitButton = document.getElementById("submitButton"); //gets the status of the submit button const errorMessageDiv = document.getElementById("errorMessage");//gets the error message const rankedWordsList = document.getElementById("rankedWordsList");//gets the ranked words list const guessedWordsList = document.getElementById("guessedWordsList");//gets the guessed word list let wordsList = [];//creating an empty array for the word list fetch( "https://raw.githubusercontent.com/k-leonard/gsm6030/refs/heads/main/words_list.csv"//getting the wordlist from my github ) .then((response) => response.text())//which then turns it all into text .then((text) => {// and takes the text wordsList = text //adds it to the words list .split("\n") //splitting it by the newline marker .map((line) => line.trim())//trimming offf any excess whitespace .filter((word) => word.length === 5); //and filtering for the word length so we only have words that are 5 letters }); function formValidation() {//a function to check to see if the form has been filled out if (!guessInput.value) { //if there is no value from the guess input return { isValid: false,//then set the is.Valid flag to false message: "Please enter a guess." //and display the message }; } return { //if there IS a guess isValid: true //set the flag to true }; } function addGuessedWord(word) { //function to add the guessed word to the list if (!guessedWords.includes(word)) { //if the word being guessed (which we know to be there) is in our wordlist guessedWords.push(word); //add the word to our list of guessed words } updateGuessedWordsList(); //and update the guessed word list } function updateGuessedWordsList() { //a function to update the guessed word list guessedWordsList.innerHTML = ""; //make the inner html blank guessedWords.forEach((word) => {//for each word in the guessed word const listItem = document.createElement("li");//create a list item listItem.textContent = word; //get the text from the item guessedWordsList.appendChild(listItem); //append that item to the guessed word list }); } function updateYellowPositions(guess, feedback) { //a function to update the yellow positiosn for (let i = 0; i < 5; i++) {//a for loop to go through all posititons in the word if (feedback[i] === "Y") { //if the corresponding feedback is "y" for yellow yellowLetterPositions[i] = guess[i];//note down that position in the previously created array } } } function filterWordsBasedOnFeedback(guess, excludeLetters) {// a function to filter words based on the given feedback return wordsList.filter((word) => {//we are returning the filtered list of words that meet our requirements let isValid = true; //sets the flag to be auto true until told otherwise for (let i = 0; i < 5; i++) { //looping through the whole word const feedbackLetter = feedbackArray[i]; //grabbing each feedback letter // Check for green feedback (must match exactly) if (feedbackLetter === "G" && word[i] !== guess[i]) { //checking to see if the feedback letter is G, and if the letter does not correspond to the letter in the word isValid = false; // we set the flag to false break; // and leave the loop } // Check for gray feedback (letter must not be in word at all) if (feedbackLetter === "X" && word.includes(guess[i])) {//if the word we are checking does contain a letter marked to not be in the word isValid = false; //set flag to false break; } // Check for yellow feedback (must exist but in a different position) if (feedbackLetter === "Y") { //if the feedback is yellow if (word[i] === guess[i] || !word.includes(guess[i])) { //and if the word contains the yellow letter at the position in question or the word does NOT include that letter isValid = false; //set to false break; } } } // Ensure excluded letters are not in the word for (let excludedLetter of excludeLetters) { //for loop to check for excluded letters if (word.includes(excludedLetter)) {//if the word being checked has an excluded letter isValid = false;//set to false break; } } // Ensure all yellow letters exist in the word for (let position in yellowLetterPositions) { //loop through all the yellow letter positions if (!word.includes(yellowLetterPositions[position])) { isValid = false; break; } } return isValid;//once we have left the loop, return the flag state }); } function calculateLetterFrequency(wordlist) { //function to calculate letter frequency for visualization const letterCounts = {};//creating an empty object to count number of letters, done inside the function to reset it wordlist.forEach((word) => { //cfor each word in the word list, count each letter [...word].forEach((letter) => { letterCounts[letter] = (letterCounts[letter] || 0) + 1; }); }); return letterCounts; //return the letter counts } function rankWords(filteredWordList, letterFrequency) { //a function to rank the words return filteredWordList //returning the filtered word list .map((word) => { let score = 0; //where all words start with a score of 0 const uniqueLetters = new Set(); // and we create a set to store unique letters [...word].forEach((letter) => { //and for each letter in the word if (!uniqueLetters.has(letter)) { //if the letter has not been found score += letterFrequency[letter] || 0; //add to the score uniqueLetters.add(letter); //add the letter to the set } }); score += uniqueLetters.size;//alter the score based on how many unique letters are in the word return { word, score//return the word and the score that was calculated for it }; }) .sort((a, b) => b.score - a.score) //then, sort the word list so that its decending (so the words with highest scores are first) .slice(0, 10); //and only show the top 10 // Show only top 10 results } submitButton.addEventListener("click", () => { //event listener for the submit button const guess = guessInput.value; //checks guess input const excludeLetters = excludeInput.value.split("");//checks excluded letter input const validationResult = formValidation(); //checks to see if the form was validated if (!validationResult.isValid) { //if not validated errorMessageDiv.textContent = validationResult.message; //send error message return; } else { errorMessageDiv.textContent = ""; //if valid, don't post a message } addGuessedWord(guess); //add the guess to the guessed word updateYellowPositions(guess, feedbackArray); //update the letter postions const filteredWords = filterWordsBasedOnFeedback(guess, excludeLetters);//filter the words const letterFrequency = calculateLetterFrequency(filteredWords);//calculate the letter frequency const rankedWords = rankWords(filteredWords, letterFrequency);//rank the words updateRankedWordsList(rankedWords);//update the ranked word list updateLetterFrequencyChart(letterFrequency);//update the letter frequecy chart }); // Function to update the ranked words list in the UI function updateRankedWordsList(rankedWords) { rankedWordsList.innerHTML = ""; //set to blank rankedWords.forEach((item) => {//go through the whole ranked word list const listItem = document.createElement("li");//grab each item listItem.textContent = `${item.word} - Score: ${item.score}`;//print out the word and the score rankedWordsList.appendChild(listItem);//append to list }); } function updateLetterFrequencyChart(letterFrequency) {//function to update the chart const letters = Object.keys(letterFrequency);//create the keys which are the letters const frequencies = Object.values(letterFrequency);//create the frequeneies const ctx = document .getElementById("letterFrequencyChart")//get the matching elements .getContext("2d");//put into 2d context if (window.barChart) { //if there is a window barchart window.barChart.destroy(); //destroy it } window.barChart = new Chart(ctx, {//create a new one type: "bar",//make it a bar chart data: {//with the given data labels: letters, datasets: [ { label: "Letter Frequency", data: frequencies, backgroundColor: "rgba(54, 162, 235, 0.2)", borderColor: "rgba(54, 162, 235, 1)", borderWidth: 1 } ] }, options: { responsive: true, scales: { y: { beginAtZero: true, ticks: { stepSize: 0.5 } } } } }); } function updateFeedback(index) { const square = document.querySelector(`.square[data-index="${index}"]`); if (feedbackArray[index] === "X") { feedbackArray[index] = "Y"; square.style.backgroundColor = "yellow"; square.textContent = "Y"; } else if (feedbackArray[index] === "Y") { feedbackArray[index] = "G"; square.style.backgroundColor = "green"; square.textContent = "G"; } else { feedbackArray[index] = "X"; square.style.backgroundColor = "grey"; square.textContent = "X"; } } const squares = document.querySelectorAll(".square"); squares.forEach((square, index) => { square.addEventListener("click", () => { updateFeedback(index); }); }); }, 1000)4b:[] 29:{"id":"0011445d80af49d8","slug":null,"title":"Kendall's Wordle solver","thumbnail":"49e3b8e7b5c25c76853ac31b4ed41e895e2facb91573182f4e68e995d0ccb899","access_level":"unlisted","create_time":"$D2024-12-01T00:35:05.042Z","update_time":"$D2024-12-02T05:49:49.615Z","view_time":null,"first_public_time":"$D2024-12-01T00:35:05.042Z","has_unpublished_edits":null,"fork":true,"stars":0,"starred":false,"owner":{"type":"team","id":"ecf61a6e625cf79c","login":"kendall-leonard","name":"Kendall Leonard","avatar_url":"https://avatars-next.observableusercontent.com/ebee93777b1c7aa4a541d1f5f907efc5df4daaef7f30de19e84c6bf2cf0f1f8f","tier":"starter_2024","bio":"","followed_by_you":false,"follows_you":false},"version":24,"publish_version":null,"role":null,"authored":false,"authors":[{"type":"individual","id":"2a05e7599c186bc4","login":"kendall-leonard","name":"Kendall Leonard","avatar_url":"https://avatars-next.observableusercontent.com/12d43af3519b8305e9a0ea45e55b9f7d8f786d2cd366f27c6d4003e29813eb7c","tier":null,"bio":"","followed_by_you":false,"follows_you":false}],"members":[{"type":"individual","id":"2a05e7599c186bc4","login":"kendall-leonard","name":"Kendall Leonard","avatar_url":"https://avatars-next.observableusercontent.com/12d43af3519b8305e9a0ea45e55b9f7d8f786d2cd366f27c6d4003e29813eb7c","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"lapsed":null,"subscribed":null,"forks":0,"collection":null,"type":"notebook","body":{"titling":"auto","title":"Kendall's Wordle solver","cells":[{"id":0,"value":"# Kendall's Wordle solver","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":22,"value":"","pinned":false,"hidden":false,"mode":"html","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":5,"value":"$49","pinned":false,"hidden":false,"mode":"html","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":8,"value":"$4a","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":10,"value":"Chart = require('https://cdn.jsdelivr.net/npm/chart.js')","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"}],"files":"$W4b","stdlib":"1"}} 24:null