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, the first two are five letter Jumbles and the second pair six letter 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.

One method of solving four-base jumbles is to solve three of the jumbles, then using the circled letters from those three words, attempt to solve the visual puzzle. After solving the visual puzzle, there will be new letters that are not from the three solved jumbles. Re-arranging these new letters in the unsolved jumble will often allow you to solve the unsolved jumble.

There is a jumble website. Clicking on jumble on line games, and then daily jumble, and then on click here to play, will bring up the daily jumble from the newspaper. You can then see if the jumbles you have solved are correct, and if not then you can rework the incorrect jumble.

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