Talk:Jumble
From Wikipedia, the free encyclopedia
 |
This article is within the scope of WikiProject Video games. For more information, visit the project page, where you can join the project and/or contribute to the discussion. | |
| Stub | This article has been rated as Stub-Class on the assessment scale. | |
|
VG To-do:
|
||
[edit] Sum algorithm accurate?
The algorithm that sums letter values to find anagrams seems inaccurate and is unsourced, but I'm not read to delete it yet. Wouldn't, for example, AAAABB and AAAAAC have the same sum (8) even though they're not anagrams? It seems that you need an additional unmentioned step of verifying the words in W that are indeed anagrams. Do we have a source for this algorithm? Oren0 (talk) 03:08, 27 November 2007 (UTC)
- I agree. If "the sum" in that algorithm means the sum in the usual sense, then it wouldn't work. A simple way that will surely solve the puzzle (but may not be efficient) is to let A = 2, B = 3, C = 5, … , Z = 26th prime = 101. For each word assigns its value as the product of the values of its alphabets like CAT = 5 x 2 x 71 = 710. Then any word with value that can divide the product value of a given set of alphabets can form from a subset of alphabets of that set. A simple improvement to this algorithm is to assign the value of each alphabet according to its frequency in the dictionary: the more frequent, the less its value. This will reduce the product values for most words. Warut (talk) 12:03, 7 February 2008 (UTC)
[edit] Redirection from TextTwist
TextTwist (and variations thereof) should not redirect to this page. Papilgee4evaeva (talk) 18:33, 8 March 2008 (UTC)
