Jumble, is a word puzzle in which a player is given a set of letters which, when arranged in the correct order, give the un-jumbled word. A simple example would be the set of letters "lbujme," which can then be rearranged to spell "jumble". Thus the solution to a Jumble is an anagram of the puzzle word. Jumble is also similar to the Round Robin game from Supermarket Sweep.

Jumble was created in 1954 by Martin Nadle (aka. Naydell or Dell & Nadel), and is one of most important properties of Tribune Media Services, which holds the rights to the JUMBLE trademark. Daily and Sunday Jumble puzzles are featured in hundreds of newspapers.

Jumble puzzles found in newspapers often have four-base Jumbles. Once these base Jumbles are solved, a player uses the circled letters of each base Jumble word to obtain a new set of letters. This set of letters will then complete a phrase or sentence. The correct answer usually involves some sort of visual or verbal pun, relating to an illustration and its caption published with the puzzle.

Computerized solution

Algorithms to solve jumbles exist, which make use of a dictionary. Commonly found algorithms work as follows; given an input of jumbled letters it outputs the set of possible words. Then the person can pick up the right word from the list (if it exists).

One algorithm is as follows:

1. Begin
2. Input: J , all the jumbled letters that form an unknown W word(s), we want.
3. Sort the letters of J in alphabetical order, preserving duplicates.
4. Look up sorted letters in a hash table, initialised with a dictionary, that maps a sorted set of letters to unscrambled words.
5. Print the set of words, which is W.
6. End

Another algorithm:

1. Begin
2. Input: J, all the jumbled letters that form an unknown W word(s)
3. Frame a word list Y with all different combination of J
4. For each word in Y check if the word is existing in the dictionary
5. If a match is found then collect it in word list W
6. Prints the words in W

Algorithm to write J in all different combination

1.Begin
2.Initialize a string with first character of J denoted by J(1)
3.Add the second character of J denoted by J(2) in either side of J(1)to get two strings

4.Add the third character of J denoted by J(3) in either side and in between of the above 2 strings in above step to get 6 strings

5.Same way add J(4) to each of the above string in either sides and between two characters to get 24 strings
6.Continue this until all the characters are completed

Though the algorithm looks complex it can be easily implemented in a program.

Douglas Hofstadter developed a program called Jumbo that tackles jumble problems in a way similar to the hypothesised manner in which the human mind does. The program doesn't rely on a dictionary and doesn't try to find real English words, but rather words that could be English, exploiting a database of plausibilities for various combinations of letters. Letters are combined non-deterministically, following a strategy inspired by chemical reactions and free associations.