Heuri: A scrabble © playing engine using a probability-based heuristic

Abstract

The game of Scrabble has been successfully tackled by two engines: Quackle and Maven. They attain the state-of-the-art in Computer Scrabble. These engines use simulation techniques and precalculated values to achieve superhuman play. This paper presents a Scrabble-playing engine, Heuri, which achieves world championship standards when playing in Spanish, and a very high level when playing in English and French, without using brute-force approaches.One advantage of Heuri is that its calculations, as opposed to many in Quackle, are not precomputed and instead performed for every turn. Spanish match results of different versions of Heuri against humans and two versions of Quackle are presented in this paper. Results against Quackle, in English and French, are also given. The main goal of this paper is to enrich Computer Scrabble with the description of a Scrabble playing program, Heuri, which is differently designed from earlier ones such as Maven and Quackle. An additional goal is to give Scrabble players an excellent strategy for obtaining championship level in Spanish.

Keywords

Scrabble bingo heuristic bingo probability Heuri leave

Get full access to this article

View all access options for this article.

References

Appel, A.W. & Jacobson, G.J. (1988). The world’s fastest scrabble program. Communications of the ACM, 31(5), 572–578. doi:10.1145/42411.42420.

Brownlee, J. (2019). A Gentle Introduction to Monte Carlo Sampling for Probability. https://machinelearningmastery.com/monte-carlo-sampling-for-probability/ .

González, R.A. , Alquézar, M.R. , Ramírez, F.A. & González, A.F. (2012). In Heuristics and Fishing in Scrabble. European Conference on Artificial Intelligence ECAI 2012. Proceedings of the Computer Games Workshop 2012 (CGW 2012), August 27-31, 2012, Montpellier, France (pp. 62–70).

González, R.A. , Alquézar, M.R. , Ramírez, F.A. , González, A.F. & Olmedo Ian, G. (2018). El método de anagramas: un rápido y novedoso algoritmo para generar jugadas de scrabble. Research in Computing Science, 147(6), 41–55.

González, R.A. , González, A.F. , Ramírez, F.A. , Roldán, A.A. , Alquézar, M.R. & Hernández, E. (2008). A heuristic for scrabble based in probability. In Proceedings of the Workshop on Artifical Intelligence in Games AIG-2008. 18th European Conference on A.I. ECAI 2008, July 21-25, 2008, Patras, Greece (pp. 35–39).

Gordon-Steven, A.A. (1994). A faster scrabble move generation algorithm. SoftwarePractice and Experience, 24(2), 219–232. doi:10.1002/spe.4380240205.

Katz Brown, J. & O’Laughlin, J. (2007). How Quackle Plays Scrabble. [Online]. Available at http://people.csail.mit.edu/jasonkb/quackle/doc/how_quackle_plays_scrabble.html.

Ramírez, F.A. , González, A.F. , González, R.A. , René, A.M. , Hernández, E. , Roldán, A.A. & García, O.I. (2009). A scrabble heuristic based on probability that performs at championship level. In MICAI 2009: Advances in Artificial Intelligence. 8th Mexican Conference on AI. Proceedings. Guanajuato, Mexico. 8th Mexican Conference on AI. Proceedings. Lecture Notes in Artificial Intelligence (Vol. 5845, pp. 112–123). Guanajuato, Mexico.

Russell, S.J. & Norvig, P. (2009). Artificial Intelligence: A Modern Approach. Prentice Hall.

10.

Shannon, C. (1950). Programming a computer for playing chess. Philosophical Magazine, Ser. 7, 41, 256–275. doi:10.1080/14786445008521796.

11.

Shapiro, S.C. (1979). A scrabble crossword game playing program. In Proceedings of the Sixth IJCAI (pp. 797–799).

12.

Sheppard, B. (2002). Towards Perfect Play of Scrabble. IKAT/Computer Science Department, Universiteit Maastricht. PhD thesis.

13.

Stuart, S.C. (1982). Scrabble crossword game playing programs. SIGArt Newsletter, 80, 109–110.

14.

Wiles, J. (2018). Tilin’Out: A Conversation with a Champion Scrabble Player. https://www.urbo.com/content/tilin-out-a-conversation-with-a-champion-scrabble-player/ .