justin

You are free to pay me money, you just have to realise that I cannot be bought.

Patience may be a virtue, but patient persistence will bring you success every time.

There are just two days in your entire lifetime that are not 24 hours in length.

Is it possible for the CPU in my Atom to figure out if the CPU is in an infinite loop?

Is there something I can do to test this?

For the infinite loop I mean?

I can easily test for $100 JMP $100 or in BASIC “10 GOTO 10”, or an equivalent, but how about a harder loop condition?

If I store combinations of letters in a lookup table, because in the English language there are letter groups that go together quite often.

So CH is a common letter group. And so is TH. And so is ING.

How many common letter groups are there?

How many would I use in all of my word dictionaries?

If a word search has a theme, say names of colours, or names of animals, would there be overlap between the same words used in different word search games?

Hrmmm.

Let’s assume I have a list of words I need for a word search level. Each word is actually just a one byte value that is an index in to a table where the real words are stored.

So we have a “word search word list table” that has a string describing the theme of the table, .e.g “COLOUR NAMES” and four bits that indicate how many words are used in that word search level.

Then I have a list of between 8 and 23 words which are just one byte values into another table that is the actual individual word.

Let’s call that other table “word table.”

That word table can contain up to 256 words.

Each word is stored as a series of six bits for a letter group along with three bits to indicate the letter of the word, i.e. how many six bits sequences make up the word.

Those six bit sequences are an index into another table called “letters” which are actually either individual letters or groups of letters.

So effectively I have to think of the English language as having 26 letters plus another possible 38 “letters” made up of two letter pairs and three letter triples. Single. Double. Treble.

Footnote: The problem I was trying to solve was how to store hundreds of words in as small an amount of memory as I can. I only had about 4KB of RAM to play around with as I recall. I wanted to store hundreds of different words, graphics and code.

I only have about 4KB of RAM to play around with as I recall.

I want to store hundreds of different words, graphics and code.

I need to pack words in to memory efficiently.

The problem is that there are 26 letters in the alphabet which takes up fives of memory.

Which is inefficient.

And I would need some complex code to decipher every five bits in a stream.

Because it is a word search I have a limited number of words to be searching for within a theme.

If I choose my words carefully so that all of the words only use 16 different letters then I can pack two letters in to a single byte.

Assume three bits to indicate word length.

But the word length value 0 through 7 is added to a base value of 3.

No word will be shorter than three letters.

So that gives me words between 3 letters and 10 letters in length.

That gives me four bits to store the first letter of the word and one bit left over.

Footnote: The problem I was trying to solve back then was how to store hundreds of words in as small an amount of memory as I can.