in reply to Re^5: Not Quite Longest Path Problem
in thread Not Quite Longest Path Problem

JavaFan,
Now that I am the all-time FaceBook high score holder, I can tell you a little bit more about the game. I left a lot out and got 1 thing wrong in my original post.

First, there a multiplier bonuses for changing a different position 4 times in a row consecutively. So if you were able to change position 3, then 1, then 4 and then 2, your multiplier goes from 1 to 2 (words are now worth twice their score). You can continue to increase your multiplier until you make a mistake (choose an invalid word or one you have already used). I have found that the Scrabble TWL is not the word list used by this application because occasionally, I get a word wrong.

Second, every single level introduces a new rule so I really think using any graph theory is futile. At least the way I am thinking of it. Here is what I have been able to decipher so far:

  1. No restrictions
  2. Can't use the last letter used*
  3. Can't use the last position used
  4. Can't use the last letter or last position used
  5. No restrictions
  6. Can't use the last letter used on 1st word, then last two letters for remainder of level
  7. First word: can't use last position or letter from 2 words ago. Rest: can't use last 2 positions
I could go on, but it just gets more complicated from there.

Cheers - L~R

Third, it does seem as you pointed out that it is more important to find longer changes of cheaper words because of bonuses then it is to find shorter chains of expensive words. The scoring by the way was made up by me - it is obvious they use letter frequency to determine the value of a letter but I didn't bother to record every one.

* Elsewhere in this thread I indicate it is just the first letter used for the remainder of the level. In reality, it changes from word to word to the last letter used.

In Section Seekers of Perl Wisdom