AI Chat AI Image Generator AI Video Text to Speech

On Optimal Strategies for Wordle and General Guessing Games

05/16/2023

∙

by Michael Cunanan, et al.

∙

∙

The recent popularity of Wordle has revived interest in guessing games. We develop a general method for finding optimal strategies for guessing games while avoiding an exhaustive search. Our main contributions are several theorems that build towards a general theory to prove the optimality of a strategy for a guessing game. This work is developed to apply to any guessing game, but we use Wordle as an example to present concrete results.

Michael Cunanan
1 publication
Michael Thielscher
3 publications

research

∙ 01/06/2022

Strategic form games and an Index Theory for Extensive form games

We present an index theory of equilibria for extensive form games. This ...

0 Lucas Pahl, et al. ∙

research

∙ 05/26/2021

Finding optimal strategies in sequential games with the novel selection monad

The recently discovered monad, Tx = Selection (x -> r) -> r, provides an...

0 Johannes Hartmann, et al. ∙

research

∙ 04/12/2023

Markov chains applied to Parrondo's paradox: The coin tossing problem

Parrondo's paradox was introduced by Juan Parrondo in 1996. In game theo...

0 Xavier Molinero, et al. ∙

research

∙ 09/21/2023

Quantifying Feature Importance of Games and Strategies via Shapley Values

Recent advances in game informatics have enabled us to find strong strat...

0 Satoru Fujii, et al. ∙

research

∙ 01/14/2019

Optimal Strategies of Blotto Games: Beyond Convexity

The Colonel Blotto game, first introduced by Borel in 1921, is a well-st...

0 Soheil Behnezhad, et al. ∙

research

∙ 04/24/2020

General Cops and Robbers Games with randomness

Cops and Robbers games have been studied for the last few decades in com...

0 Frédéric Simard, et al. ∙

research

∙ 05/04/2022

Evolution of Strategies in Sequential Security Games

In this paper we introduce a generic approach to solving Sequential Secu...

0 Adam Żychowski, et al. ∙