Word Challenge is a game that requires forming as many words as possible from a randomly-generated set of letters. This must be done in a limited amount of time.

To generate all words that can be made from a set of letters using Lexifind, simply enter the letters in the Letters: field of the Make Words column. As you type in these letters, Lexifind will immediately generate all words that can be made from the letters that you have typed. You can move through this list of words one at a time by clicking on the arrow buttons under the slider bar that appears whenever there are 2 words or more in your result set. By selecting Word Length as the "Sort by:" value, you can place the longest words at the front of the list. If you would rather view words alphabetically, just select "Alphabetical Order" as your sort mode. Note: If you do select alphabetical order, then you may want to enter the constraint expression ####* into the Board Area: field of the Make Words column, to select only words having at least three letters, since that is the minimum length that Word Challenge will accept.

Since Word Challenge provides, at the end of the game, all of the words that you missed, we can't see a strong reason for using a word finder when playing the game itself. We suggest that you instead study the words presented at the end of each game to get an idea of why you might have overlooked them.

Where Lexifind might be most helpful is after the game, if you would like to confirm any patterns that you may have noticed in the course of playing the game (or while viewing the answers displayed after the game is over). If you think that you have noticed a particular pattern, such as the fact that Z and P do not usually occur together, you can confirm it by using Lexifind's Find Words facility. For example, you can enter #*ZP#* in the Board Area: field of Find Words to confirm that there are only ten words that include "ZP" (e.g., GAZPACHO), while there are 7.6 times that number (76) that have Z and P separated by some vowel (as shown by entering the expression #*Z[AEIOU]P#*). So now, when you see a set of letters in Word Challenge that contains a Z and a P, such as INSZPU, you will try placing a vowel between the Z and the P before you try to place the Z and the P together. In doing this, you will have generalized to obtain a rule of thumb from a set of observed instances, a process known as inductive reasoning.

Please see help on constraints for an explanation of how constraint expressions, such as the ones that appear above, are constructed.