欢迎访问新加坡聚知刊出版有限公司官方网站
info@juzhikan.asia
A Comparative Performance Analysis of Two Random Word Generation Algorithms in a Word Guessing Games
  • ISSN:3041-0843(Online) 3041-0797(Print)
  • DOI:10.69979/3041-0843.26.03.044
  • 出版频率:Quarterly Publication
  • 语言:English
  • 收录数据库:ISSN:https://portal.issn.org/ ; 中国知网:https://scholar.cnki.net/journal/search; RCCSE权威核心学术期刊:http://qk.nseac.com

A Comparative Performance Analysis of Two Random Word Generation Algorithms in a Word Guessing Games 
Rasmith Haque Talukder  Riyasath Haque Talukder

Dulwich College Suzhou,Jiangsu Suzhou,215000;

Abstract:Random word generation plays a critical role in the design of word guessing games. This study, written by authors Riyasath Haque Talukder* and Rasmith Haque Talukder* compares two different algorithms for random word generation in such games: the rejection-based algorithm and the preprocessing-based algorithm. The rejection-based algorithm randomly samples words from a vocabulary and checks them against constraints, discarding invalid words until a valid one is found. Conversely, the preprocessing-based algorithm filters the vocabulary in advance to retain only valid words, ensuring all selections meet the constraints. This paper investigates whether these differences in design lead to statistically significant variations in execution time. The experimental results show that the preprocessing-based algorithm consistently outperforms the rejection-based approach in terms of execution speed, particularly when the constraints are more restrictive, with statistically significant performance differences. The findings underscore the importance of algorithmic design in optimizing performance, particularly in resource-constrained environments such as word guessing games.

Keyword:Artificial Intelligence;Algorithm;Game Theory

Reference

[1]Gilks, W. R., Best, N. G., & Tan, K. K. C. (1995). Adaptive Rejection Metropolis Sampling within Gibbs Sampling. Journal of the Royal Statistical Society. Series C (Applied Statistics), 44(4), 455–472. https://doi.org/10.2307/2986138

[2]Sabato, S., & Naveh, Y. (n.d.). Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search. Retrieved March 24, 2026, from https://www.cas.mcmaster.ca/sivansabato/papers/SabatoNaveh07.pdf

[3]dwyl/english-words: :memo: A text file containing 479k English words for all your dictionary/word-based projects e.g: auto-completion / autosuggestion. (2025). GitHub. https://github.com/dwyl/english-words/tree/master

[4]Blocked. (2026). Archive.org.https://web.archive.org/web/20131118073324/https:/www.infochimps.com/datasets/word-list-350000-simple-english-words-excel-readable