Wordle - The Viral Game

-
I bet you probably have seen this funny symbol popping up here and there in your feeds:


This is the game built by Josh Wardle "Wordle", which you can play right here: Wordle - A daily word game (powerlanguage.co.uk). It is an extremely simple game to play: you have 6 chances to guess the secret 5-letters word, by entering one valid 5-letter English word at a time. For each guess, the "engine" will tell you which letters you got in the right order (green), or out of order (yellow) or which ones are not present in the secret word (gray). And that's it!

The implementation of such program can be done in less than 200 lines of code. Here is the approach:

1/ Find a text dictionary on the web, save it locally. The one that I have has ~62K words. Good enough to have fun, but you can have any. Moreover, any language...
2/ There will be one class called WordleGame which will control all the logic
3/ Lots of standard coding (initializing structures, reading data, selecting the secret word, etc.) but the most important one is the code to check the guesses. You want to make it in such a way that a/ it checks the correct letters first, b/ followed by the other two checks
4/ I searched up how to color code the output, lots of resources

It works quite well, in the console:





Cheers, ACC

using System;
using System.IO;
using System.Collections;
using System.Collections.Generic;

namespace Wordle
{
    class Program
    {
        static void Main(string[] args)
        {
            if (args.Length != 3)
            {
                Console.WriteLine("Usage: Wordle.exe   ");
                return;
            }

            WordleGame wordleGame = new WordleGame(Int32.Parse(args[0]), Int32.Parse(args[1]), args[2]);

            for (; ; )
            {
                if (!wordleGame.Play() || wordleGame.CheckGuesses()) break;
            }
        }
    }

    public class WordleGame
    {
        private int wordLen = 0;
        private int attempts = 0;
        private int currentAttempt = 0;
        private string[] words = null;
        private string[] board = null;
        private string dictionary = "";
        private Hashtable htWords = null;
        private string theWord = "";
        public WordleGame(int wordLen, int attempts, string dictionary)
        {
            this.wordLen = wordLen;
            this.attempts = attempts;
            this.dictionary = dictionary;

            board = new string[attempts];
            htWords = new Hashtable();

            ReadWords();
            SelectTheWord();
        }

        private void ReadWords()
        {
            FileInfo fi = new FileInfo(dictionary);
            StreamReader sr = fi.OpenText();
            while (!sr.EndOfStream)
            {
                string line = sr.ReadLine().ToUpper().Trim();
                if (!String.IsNullOrEmpty(line) && line.Length == wordLen && !htWords.ContainsKey(line))
                {
                    htWords.Add(line, true);
                }
            }
            sr.Close();

            words = new string[htWords.Count];
            int index = 0;
            foreach (string word in htWords.Keys)
            {
                words[index++] = word;
            }
        }

        private void SelectTheWord()
        {
            Random rd = new Random();
            theWord = words[rd.Next(0, words.Length)];
        }

        public bool Play()
        {
            if (currentAttempt >= attempts)
            {
                Console.WriteLine("Game Over: You lost :(. Secret Word = {0}", theWord);
                return false;
            }

            currentAttempt++;
            for (; ; )
            {
                Console.WriteLine("What's your guess number #{0}?", currentAttempt);
                string line = Console.ReadLine().ToUpper().Trim();
                if (line.Length != wordLen || !htWords.ContainsKey(line))
                {
                    Console.WriteLine("Guess must be a valid {0}-length English word!", wordLen);
                }
                else
                {
                    board[currentAttempt - 1] = line;
                    break;
                }
            }

            return true;
        }

        public bool CheckGuesses()
        {
            Hashtable setOfChars = new Hashtable();
            foreach (char c in theWord)
            {
                if (!setOfChars.ContainsKey(c)) setOfChars.Add(c, 0);
                setOfChars[c] = (int)setOfChars[c] + 1;
            }

            Console.WriteLine();
            Console.WriteLine("BOARD:");
            for (int i = 0; i < currentAttempt; i++)
            {
                Hashtable tempSetOfChars = (Hashtable)setOfChars.Clone();
                for (int j = 0; j < wordLen; j++)
                {
                    if (board[i][j] == theWord[j])
                    {
                        tempSetOfChars[board[i][j]] = (int)tempSetOfChars[board[i][j]] - 1;
                        if ((int)tempSetOfChars[board[i][j]] == 0) tempSetOfChars.Remove(board[i][j]);
                    }
                }

                int matches = 0;
                for (int j = 0; j < wordLen; j++)
                {
                    if (theWord[j] == board[i][j])
                    {
                        WriteLineColored((ConsoleColor.DarkGreen, board[i][j].ToString()));
                        matches++;
                    }
                    else if (!tempSetOfChars.ContainsKey(board[i][j]))
                    {
                        WriteLineColored((ConsoleColor.DarkGray, board[i][j].ToString()));
                    }
                    else
                    {
                        WriteLineColored((ConsoleColor.DarkYellow, board[i][j].ToString()));
                        tempSetOfChars[board[i][j]] = (int)tempSetOfChars[board[i][j]] - 1;
                        if ((int)tempSetOfChars[board[i][j]] == 0) tempSetOfChars.Remove(board[i][j]);
                    }
                }
                Console.WriteLine();
                if (matches == wordLen)
                {
                    Console.WriteLine();
                    Console.WriteLine("You Won!");
                    return true;
                }
            }
            Console.WriteLine();

            return false;
        }

        private void WriteLineColored(params (ConsoleColor color, string value)[] values)
        {
            foreach (var value in values)
            {
                Console.ForegroundColor = value.color;
                Console.Write(value.value);
            }
            Console.ResetColor();
        }
    }
}

Comments

Post a Comment

Popular posts from this blog

Changing the root of a binary tree

-
Image
If you work with graphics and eventually you want to pivot a binary tree using a different node as the root, this might be interesting to you. Here is the problem:  Change the Root of a Binary Tree - LeetCode 1666. Change the Root of a Binary Tree Medium 6 14 Add to List Share Given the  root  of a binary tree and a  leaf  node, reroot the tree so that the  leaf  is the new root. You can reroot the tree with the following steps for each node  cur  on the path  starting from the  leaf  up to the  root ​​​  excluding the root : If  cur  has a left child, then that child becomes  cur 's right child. Note that it is guaranteed that  cur  will have at most one child. cur 's original parent becomes  cur 's left child. Return  the new root  of the rerooted tree. Note:  Ensure that your solution sets the  Node.parent  pointers correctly after rerooting or you will receive "Wrong Answer".   Example 1: Input: root = [3,5,1,6,2,0,8,null,null,7,4], leaf = 7 Output: [7,2,nul
Read more

ProjectEuler Problem 719 (some hints, but no spoilers)

-
Image
Last time that I solved a ProjectEuler (PE) problem was in 2015... This is their latest problem as of today:  https://projecteuler.net/problem=719 Number Splitting        Problem 719 We define an  S S -number to be a natural number,  n n , that is a perfect square and its square root can be obtained by splitting the decimal representation of  n n  into 2 or more numbers then adding the numbers. For example, 81 is an  S S -number because  81 − − √ = 8 + 1 81 = 8 + 1 . 6724 is an  S S -number:  6724 − − − − √ = 6 + 72 + 4 6724 = 6 + 72 + 4 . 8281 is an  S S -number:  8281 − − − − √ = 8 + 2 + 81 = 82 + 8 + 1 8281 = 8 + 2 + 81 = 82 + 8 + 1 . 9801 is an  S S -number:  9801 − − − − √ = 98 + 0 + 1 9801 = 98 + 0 + 1 . Further we define  T ( N ) T ( N )  to be the sum of all  S S  numbers  n ≤ N n ≤ N . You are given  T ( 10 4 ) = 41333 T ( 10 4 ) = 41333 . Find  T ( 10 12 ) The rules of PE prevent me from disclosing the solution (they are very picky about it, rightfully so), but I can chat abo
Read more

The Power Sum, a recursive problem by HackerRank

-
Image
Another one by HackerRank:  https://www.hackerrank.com/challenges/the-power-sum : Find the number of ways that a given integer,  , can be expressed as the sum of the   power of unique, natural numbers. Input Format The first line contains an integer  .  The second line contains an integer  . Constraints Output Format Output a single integer, the answer to the problem explained above. Sample Input 0 10 2 Sample Output 0 1 Explanation 0 If   and  , we need to find the number of ways that   can be represented as the sum of squares of unique numbers. This is the only way in which   can be expressed as the sum of unique squares. Sample Input 1 100 2 Sample Output 1 3 Explanation 1 Sample Input 2 100 3 Sample Output 2 1 Explanation 2  can be expressed as the sum of the cubes of  .  . There is no other way to express   as th
Read more