Wordle 的精确解决方案

IF 2.2 3区 管理学 Q3 MANAGEMENT Operations Research Pub Date : 2024-02-13 DOI:10.1287/opre.2022.0434
Dimitris Bertsimas, Alex Paskov
{"title":"Wordle 的精确解决方案","authors":"Dimitris Bertsimas, Alex Paskov","doi":"10.1287/opre.2022.0434","DOIUrl":null,"url":null,"abstract":"Optimal Strategies for Wordle and its Variants Motivated by the recent, explosive popularity of Wordle and a suite of suboptimal attempts to solve the game, “An Exact Solution to Wordle,” by Dimitris Bertsimas and Alex Paskov, proposes a new and scalable framework to exactly solve Wordle and any of its variants. Namely through modeling the game as a finite-state Markov decision process and deriving several theoretical and computational speed-ups, Bertsimas and Paskov outline an algorithm to solve the game. Ultimately, they find that “SALET” is the best starting word and that the best strategy solves the game in 3.42 moves in expectation. Results and analysis are also extended for recent variants and settings, such as Wordle Hard Mode or optimizing against a worst-case situation.","PeriodicalId":54680,"journal":{"name":"Operations Research","volume":null,"pages":null},"PeriodicalIF":2.2000,"publicationDate":"2024-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Exact Solution to Wordle\",\"authors\":\"Dimitris Bertsimas, Alex Paskov\",\"doi\":\"10.1287/opre.2022.0434\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Optimal Strategies for Wordle and its Variants Motivated by the recent, explosive popularity of Wordle and a suite of suboptimal attempts to solve the game, “An Exact Solution to Wordle,” by Dimitris Bertsimas and Alex Paskov, proposes a new and scalable framework to exactly solve Wordle and any of its variants. Namely through modeling the game as a finite-state Markov decision process and deriving several theoretical and computational speed-ups, Bertsimas and Paskov outline an algorithm to solve the game. Ultimately, they find that “SALET” is the best starting word and that the best strategy solves the game in 3.42 moves in expectation. Results and analysis are also extended for recent variants and settings, such as Wordle Hard Mode or optimizing against a worst-case situation.\",\"PeriodicalId\":54680,\"journal\":{\"name\":\"Operations Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2024-02-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Operations Research\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://doi.org/10.1287/opre.2022.0434\",\"RegionNum\":3,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MANAGEMENT\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1287/opre.2022.0434","RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 0

摘要

Wordle及其变体的最优策略 Dimitris Bertsimas和Alex Paskov的《Wordle的精确解》一书,是受最近Wordle的爆炸式流行和一系列解决该游戏的次优尝试的启发,提出了一个新的可扩展框架,以精确解决Wordle及其任何变体。Bertsimas 和 Paskov 将游戏建模为有限状态马尔可夫决策过程,并推导出几种理论和计算速度提升方法,从而概述了一种解决游戏的算法。最终,他们发现 "SALET "是最佳起始词,而且最佳策略在 3.42 步内就能解决对局。结果和分析还针对最近的变体和设置进行了扩展,例如 Wordle Hard 模式或针对最坏情况进行优化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Exact Solution to Wordle
Optimal Strategies for Wordle and its Variants Motivated by the recent, explosive popularity of Wordle and a suite of suboptimal attempts to solve the game, “An Exact Solution to Wordle,” by Dimitris Bertsimas and Alex Paskov, proposes a new and scalable framework to exactly solve Wordle and any of its variants. Namely through modeling the game as a finite-state Markov decision process and deriving several theoretical and computational speed-ups, Bertsimas and Paskov outline an algorithm to solve the game. Ultimately, they find that “SALET” is the best starting word and that the best strategy solves the game in 3.42 moves in expectation. Results and analysis are also extended for recent variants and settings, such as Wordle Hard Mode or optimizing against a worst-case situation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Operations Research
Operations Research 管理科学-运筹学与管理科学
CiteScore
4.80
自引率
14.80%
发文量
237
审稿时长
15 months
期刊介绍: Operations Research publishes quality operations research and management science works of interest to the OR practitioner and researcher in three substantive categories: methods, data-based operational science, and the practice of OR. The journal seeks papers reporting underlying data-based principles of operational science, observations and modeling of operating systems, contributions to the methods and models of OR, case histories of applications, review articles, and discussions of the administrative environment, history, policy, practice, future, and arenas of application of operations research.
期刊最新文献
Stability of a Queue Fed by Scheduled Traffic at Critical Loading On (Random-Order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs Efficient Algorithms for a Class of Stochastic Hidden Convex Optimization and Its Applications in Network Revenue Management Application-Driven Learning: A Closed-Loop Prediction and Optimization Approach Applied to Dynamic Reserves and Demand Forecasting Data-Driven Clustering and Feature-Based Retail Electricity Pricing with Smart Meters
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1