Re: A89: Crossword puzzle

Re: A89: Crossword puzzle

• To: assembly-89@lists.ticalc.org
• Subject: Re: A89: Crossword puzzle
• From: Nate Mueller <nlmueller@students.wisc.edu>
• Date: Thu, 25 Feb 1999 17:49:30 -0600
• Delivered-To: assembly-89-outgoing@towerguard.unix.edu.sollentuna.se
• Delivered-To: assembly-89@lists.ticalc.org
• In-Reply-To: <19990225230814.23973.rocketmail@send203.yahoomail.com>
• Reply-To: assembly-89@lists.ticalc.org

>I am workin on a game that is a crossword puzzle.  I have it all
>finished except I don't know how I can get the 89 to know if the words
>in the puzzle are correct.
>Does anyone have an idea on how to do this?  Thanks.
>           Ben

Unfortunatly the only way to do this would be to store a large dictionary
on the calc.  The common Linux dictionary (/usr/dict/words) is over 200kb.
If you wanted you probably could include a smaller dictionary with the most
common words.  The best algorithm I know of to search the dictionary for
the target word is a binary search.  Select the middle word in the
dictionary, if the target word is alphabeticly after it, repeat with that
half of the dictionary.  Otherwise repeat with the first half.  If your
dictionary is n words long, the worst case would be lg(n) comparisons
before you find the word.  Irregardless, I don't think you would be able to
get people to use a crossword program that took up more then half of the
total memory (including archive) on the calc.

	--Nate

• Re: A89: Crossword puzzle
• From: Joe Koston <olp1726@usa.net>

• A89: Crossword puzzle
• From: Ben Rodgers <bentensai@yahoo.com>

• Prev: Re: A89: What about Diamonds?/ doors problem.
• Next: Re: A89: Crossword puzzle
• Index(es):
  • Main
  • Thread