Does God Play Scrabble?

Articles Leave a Comment

The idea of a so-called Bible Code, in which confirmatory words or messages can be extracted from the Bible by reading the letters as they fall at a certain frequency, is completely false.

How to cite this article: Jack Poirier, “Does God Play Scrabble?” Jerusalem Perspective (2004) [https://www.jerusalemperspective.com/4123/].

Einstein famously claimed that “God does not play dice.” In what follows, I argue that God does not play Scrabble, either. That is, the idea of a so-called Bible Code, in which confirmatory words or messages can be extracted from the Bible by reading the letters as they fall at a certain frequency, is completely false. In doing so, I will examine the claims made by one of the Bible Code’s leading proponents, Grant Jeffrey, and I will do the math that he has left conspicuously undone, showing that the purportedly amazing finds are owed to nothing more than the results of combinatorics involving huge numbers of letters. Contrary to Jeffrey’s contention, the math involved is relatively simple, and when properly done, it completely undoes the whole theory.

Jeffrey hedges his incredibly inflated figures with a triumphalist rhetoric. The reader is repeatedly met with celebrations of the supposed overwhelmingness of the “proof” presented, and of the implied dim-wittedness of anyone who will not succumb to Jeffrey’s arguments. The best way to test whether this rhetoric fits its target, I think, is to do the math ourselves.

Doing the Math

In English, certain letters appear far more frequently than others. That is why, in Scrabble, the letters ae, and n are each worth only one point, while j is worth eight points and q and z are each worth ten points. The frequency with which ae, or n appear in the average word is probably greater than the frequency with which a j, q, or z appear in the average sentence. The probability of a certain word appearing in a jumbled set of letters from a real text is therefore dependent upon the letters comprising that word, so that the word “near” has a far greater chance of being randomly encoded within a sequence of letters than does the word “quiz”. (The same is true of Hebrew, but to a lesser extent. See below.) To test the probability that a word will appear within a given sequence of letters, it is necessary to have some idea of the frequency of the letters that comprise the word.

The real secret behind the Bible Code is simply mathematical, and there is no need to posit a divine origin for the “encoded” words. If these encoded messages are in some sense the “signature of God,” then God is nothing more than the deification of mathematical principles. Given a long enough jumble of letters, one could find virtually anything encoded in it. And the jumble of letters that the Bible Code crowd works with is effectively 50 or 60 million letters long (counting all the ELS levels). What could not be found in it? Even when these word searches are context sensitive—e.g., so that Hitler is said to be encoded in the narrative about Haman in the book of Esther, etc.—the jumbles are still extremely large.

Paid Content

Premium Members and Friends of JP must be signed in to view this content.

If you are not a Premium Member or Friend, please consider registering. Prices start at $5/month if paid annually, with other options for monthly and quarterly and more: Sign Up For Premium

Image courtesy of Joshua N. Tilton.

  • [1] In certain cases, there is a minor adjustment that will need to be made to the above formula. If the experimental text sample does not continue into another section of text, or if, for whatever reason, one wants to disallow the discovery of words that are partially imbedded in text beyond the experimental sample, then we must adjust the figures that the above formula gives us. In the calculations that I make in the remainder of this essay, however, I will ignore this slight adjustment, since Jeffrey never specifies that he limits his experimental samples in this way.
  • [2] Ronald Weber comments, on his webpage, concerning Jeffrey’s reference to the "complex computer programs" that certain Israelis used to explore the Bible Code (The Signature of God, p. 222): "How does Grant know the programs he used are complex? I don't believe he really does because he didn't develop them and he probably has no idea exactly how they work at the program code level."
  • [3] Kalman P. Bland, "Issues in Sixteenth-Century Jewish Exegesis," in The Bible in the Sixteenth Century, ed. David C. Steinmetz (Duke Monographs in Medieval and Renaissance Studies 11; Durham, NC: Duke University Press, 1990), 64.
  • [4] The Search for the Perfect Language (The Making of Europe; Oxford: Blackwell, 1997), 27.

Leave a Reply

  • Jack Poirier

    Jack Poirier

    Jack Poirier is the chair of biblical studies at the newly forming Kingswell Theological Seminary in Cincinnati, Ohio (scheduled to open in Fall 2008). Jack earned his doctorate in Ancient Judaism from the Jewish Theological Seminary in New York City, where he wrote a dissertation…
    [Read more about author]

  • JP Login

  • JP Content

  • Suggested Reading

  • Articles, blogs, and other content published by Jerusalem Perspective, LLC express the views of their respective authors, and do not necessarily reflect those of JP or other contributors to the site.

    Copyright 1987 - 2025
    © Jerusalem Perspective, LLC
    All Rights Reserved

    Ways to Help:

    DONATIONS: All donations will be used to increase the services available on JerusalemPerspective.com. Donations do not grant donors JP premium content access.