Jump to content

Hawkeye1976

Members
  • Content Count

    14
  • Joined

  • Last visited

Community Reputation

0 Neutral

About Hawkeye1976

  • Rank
    newbie
  1. Thank you, that's it! I have to study the formulas to see, where I was wrong when I tried to achieve this.
  2. Downloaded it again ... now it's very close. Thank you. Have to look at it in detail ... My weakness are those recursive custom functions.
  3. Thank you. That's very close. I have to study it's funtions a little ...
  4. Yes. That's right. The goal is to reach the correct word with a minimum of negative responses.
  5. Okay, here's what I would do "on paper": 1. remove duplicate letters from the words and bring them in alphabetical order: -abc -abd -abe -xyz (okay, in this case not needed) 2. find the most frequent letter. In this case a or b both occur 3 times, so a would be the choice, because it's the closest to the beginning of the alphabet. So "A" would be the first "question and responded with "no" it would leave: A - xyz Because it leaves only one word "xyz", there's no need to process this branch further. 3. Now 2 is repeated with the remaining words: -abc -abd -abe Again,
  6. That won't happen, because you would use logical groups. Like the zodiac signs, names or month-names.
  7. I think, you got me wrong. There's no need for a large database of words, because normally in magic before the anagram-thing happens, you have eliminated many words and only use a small group ... like zodiac signs for example. There is no need to find those branches by a key-phrase. You have to think of the branching as a yes/no-answering-process. Each "No" will lead to the next branch. Maybe I have to create the loop in a fashion that it stops after x No-responses in a row.
  8. Comment is right. Branching anagrams are used by magicians and I normally build them by hand, but want to automate the process. Currently I'm trying to establish that with two related tables. The first one - at this stage - holds an ID, a global field for entering the words and a portal that shows the words. If a word is entered in the global field, a related record is created in the second table. In the second table there are five fields right now: one for the word, a calculated field that strips the word down to the letters it contains like: baseball -> abels a field for the level
  9. By most common letters in the words. Like in the example: If there's an A in the word, an L but no E it has to be "football".
  10. Hi folks, I'm currently trying to turn a list of words into a progressive anagram tree, but I can't find a working way to solve that issue. Here's what I need to do: A list of words like this baseball football basketball hockey olympics nascar redistribution must be turned into a branching anagram like: A i - hockey r - olympics - redistribution L - nascar E - football K - baseball - basketball What would be the easiest way to establish that in FM? Really hope, that somebody can help me out ...
  11. I have the same problem here on Win7/FM10. The only way to prevent FM from crashing is to set the language to "English" within the preferneces of FM. After that change, ScriptMaster loads without any problems. I hope there will be a solution to this problem soon, because I really got used to the German terminologies within FM. Tom
  12. I have the same problem here on Win7/FM10. The only way to prevent FM from crashing is to set the language to "English" within the preferneces of FM. After that change, ScriptMaster loads without any problems. I hope there will be a solution to this problem soon, because I really got used to the German terminologies within FM. Tom
×
×
  • Create New...

Important Information

By using this site, you agree to our Terms of Use.