Using Wordle for Learning to Design and Compare Strategies

• URL: http://arxiv.org/abs/2205.11225v1
• Date: Sat, 30 Apr 2022 14:41:25 GMT
• Title: Using Wordle for Learning to Design and Compare Strategies
• Authors: Chao-Lin Liu
• Abstract summary: We can design parameterized strategies for solving Wordle, based on probabilistic, statistical, and information-theoretical information about the games. The strategies can handle a reasonably large family of Wordle-like games both systematically and dynamically. This paper will provide the results of using two families of parameterized strategies to solve the current Wordle.
• Score: 0.685316573653194
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Wordle is a very popular word game that is owned by the New York Times. We can design parameterized strategies for solving Wordle, based on probabilistic, statistical, and information-theoretical information about the games. The strategies can handle a reasonably large family of Wordle-like games both systematically and dynamically, meaning that we do not rely on precomputations that may work for non-fixed games. More specifically, the answer set can be arbitrary, not confining to the current 2315 words. The answer words may include any specific number of letters (does not have to be five), and the set of symbols that form the words does not have to be limited to only the English alphabet. Exploring possible strategies for solving the Wordle-like games offers an attractive learning challenges for students who are learning to design computer games. This paper will provide the results of using two families of parameterized strategies to solve the current Wordle, using the simulator that abides by the hard-mode rules as the baseline. The baseline simulator used an average of 4.078 guesses to find the 2315 answers, and needed more than six trials to solve the game 1.77% of the time. The best performing strategy of ours used an average of 3.674 guesses to find the 2315 answers, and failed 0.65% of the time.

Related papers

• People use fast, goal-directed simulation to reason about novel games [75.25089384921557]
  We study how people reason about a range of simple but novel connect-n style board games. We ask people to judge how fair and how fun the games are from very little experience.
  arXiv  Detail & Related papers  (2024-07-19T07:59:04Z)
• Procedurally generating rules to adapt difficulty for narrative puzzle games [0.0]
  This paper focuses on procedurally generating rules and communicating them to players to adjust the difficulty. A genetic algorithm is used together with a difficulty measure to find a target number of solution sets. A large language model is used to communicate the rules in a narrative context.
  arXiv  Detail & Related papers  (2023-07-07T11:14:53Z)
• On Optimal Strategies for Wordle and General Guessing Games [6.85316573653194]
  We develop a method for finding optimal strategies for guessing games while avoiding an exhaustive search. This work is developed to apply to any guessing game, but we use Wordle as an example to present concrete results.
  arXiv  Detail & Related papers  (2023-05-16T02:30:10Z)
• Selecting Seed Words for Wordle using Character Statistics [0.3108011671896571]
  Wordle, a word guessing game rose to global popularity in the January of 2022. The goal of the game is to guess a five-letter English word within six tries. This study uses character statistics of five-letter words to determine the best three starting words.
  arXiv  Detail & Related papers  (2022-02-07T19:01:19Z)
• Finding the optimal human strategy for Wordle using maximum correct letter probabilities and reinforcement learning [0.0]
  Wordle is an online word puzzle game that gained viral popularity in January 2022. We present two different methods for choosing starting words along with a framework for discovering the optimal human strategy.
  arXiv  Detail & Related papers  (2022-02-01T17:03:26Z)
• Playing Codenames with Language Graphs and Word Embeddings [21.358501003335977]
  We propose an algorithm that can generate Codenames clues from the language graph BabelNet. We introduce a new scoring function that measures the quality of clues. We develop BabelNet-Word Selection Framework (BabelNet-WSF) to improve BabelNet clue quality.
  arXiv  Detail & Related papers  (2021-05-12T18:23:03Z)
• Generating Diverse and Competitive Play-Styles for Strategy Games [58.896302717975445]
  We propose Portfolio Monte Carlo Tree Search with Progressive Unpruning for playing a turn-based strategy game (Tribes) We show how it can be parameterized so a quality-diversity algorithm (MAP-Elites) is used to achieve different play-styles while keeping a competitive level of play. Our results show that this algorithm is capable of achieving these goals even for an extensive collection of game levels beyond those used for training.
  arXiv  Detail & Related papers  (2021-04-17T20:33:24Z)
• Learning to Play Sequential Games versus Unknown Opponents [93.8672371143881]
  We consider a repeated sequential game between a learner, who plays first, and an opponent who responds to the chosen action. We propose a novel algorithm for the learner when playing against an adversarial sequence of opponents. Our results include algorithm's regret guarantees that depend on the regularity of the opponent's response.
  arXiv  Detail & Related papers  (2020-07-10T09:33:05Z)
• Efficient exploration of zero-sum stochastic games [83.28949556413717]
  We investigate the increasingly important and common game-solving setting where we do not have an explicit description of the game but only oracle access to it through gameplay. During a limited-duration learning phase, the algorithm can control the actions of both players in order to try to learn the game and how to play it well. Our motivation is to quickly learn strategies that have low exploitability in situations where evaluating the payoffs of a queried strategy profile is costly.
  arXiv  Detail & Related papers  (2020-02-24T20:30:38Z)
• Learning Dynamic Belief Graphs to Generalize on Text-Based Games [55.59741414135887]
  Playing text-based games requires skills in processing natural language and sequential decision making. In this work, we investigate how an agent can plan and generalize in text-based games using graph-structured representations learned end-to-end from raw text.
  arXiv  Detail & Related papers  (2020-02-21T04:38:37Z)
• Exploration Based Language Learning for Text-Based Games [72.30525050367216]
  This work presents an exploration and imitation-learning-based agent capable of state-of-the-art performance in playing text-based computer games. Text-based computer games describe their world to the player through natural language and expect the player to interact with the game using text. These games are of interest as they can be seen as a testbed for language understanding, problem-solving, and language generation by artificial agents.
  arXiv  Detail & Related papers  (2020-01-24T03:03:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.