Jumble algorithm: Difference between revisions
Seagull123 (talk | contribs) Added {{dead end}}, {{orphan}} and {{unreferenced}} tags (within {{multiple issues}}), and {{merge to}} tag to article (TW) |
Remove spurious content. |
||
Line 5: | Line 5: | ||
}} |
}} |
||
{{merge to|Jumble|discuss=Talk:Jumble#Proposed merge with Jumble algorithm|date=June 2015}} |
{{merge to|Jumble|discuss=Talk:Jumble#Proposed merge with Jumble algorithm|date=June 2015}} |
||
Each clue in a [[Jumble]] word puzzle is a word that has been “jumbled” by permuting the letters of each word to make an [[anagram]]. |
Each clue in a [[Jumble]] word puzzle is a word that has been “jumbled” by permuting the letters of each word to make an [[anagram]]. A dictionary of such anagrams may be used to solve puzzles or verify that a jumbled word is unique when creating puzzles. |
||
==Computerized solution== |
==Computerized solution== |
||
Line 51: | Line 51: | ||
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. |
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. |
Letters are combined non-deterministically, following a strategy inspired by chemical reactions and free associations. |
||
==In other media== |
|||
Various electronic versions of Jumble have been released, including a version by [[Hasbro Interactive]] for [[Microsoft Windows]]. The game features 5 modes of play ranging from classic Jumble to crossword puzzles to an easier Jumble mode for kids. |
|||
TextTwist, a [[Java (programming language)|Java]] game by [[GameHouse]], is similar to Jumble. Players form words from a set of six scrambled letters, and must find at least one 6-letter word using all the letters to get to the next round. Additional points are granted for words using at least three letters. |
|||
A TV game show based on Jumble aired in 1994. It was hosted by game show veteran [[Wink Martindale]], and aired on The Family Channel (now called [[ABC Family]]). |
|||
In the ''[[Seinfeld]]'' episode “The Pez Dispenser,” [[Kramer]], upon hearing that [[George Costanza]] was doing crossword puzzles with his girlfriend, said he “likes to do the Jumble.” |
|||
In the [[Homestar Runner#Strong Bad Email|Strong Bad email]] from [[Homestar Runner]] entitled "Caper," [[Homestar Runner#Characters|Strong Bad]] and [[Homestar Runner#Characters|The Cheat]] break into [[Homestar Runner#Characters|Homestar's]] house to steal the Jumbles from his newspapers. Strong Bad refers to this in song as "The Jumble Caper." |
Revision as of 12:16, 29 June 2015
![]() | This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages)
|
![]() |
Each clue in a Jumble word puzzle is a word that has been “jumbled” by permuting the letters of each word to make an anagram. A dictionary of such anagrams may be used to solve puzzles or verify that a jumbled word is unique when creating puzzles.
Computerized solution
Algorithms have been designed to solve Jumbles, using a dictionary. Common algorithms work by printing all words that can be formed from a set of letters. The solver then chooses the right word.
One algorithm is as follows:
- Begin
- Input: J , all the jumbled letters that form an unknown W word(s), we want.
- Sort the letters of J in alphabetical order, preserving duplicates.
- Look up sorted letters in a hash table, initialised with a dictionary, that maps a sorted set of letters to unscrambled words.
- Print the set of words, which is W.
- End
Another algorithm:
- Begin
- Input: J, all the jumbled letters that form an unknown W word(s)
- Frame a word list Y with all different combination of J
- For each word in Y check if the word is existing in the dictionary
- If a match is found then collect it in word list W
- 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
J(1)J(2) J(2)J(1)
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
J(1)J(2)J(3) J(1)J(3)J(2) J(3)J(1)J(2)
J(2)J(1)J(3) J(2)J(3)J(1) J(3)J(2)J(1)
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 is easy to program.
Douglas Hofstadter developed a program called Jumbo that tries to solve Jumble problems as a human mind would. 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.