Open Source Lexical Attraction Word Game
Lexical Attraction
This program and its source code are provided "as is" and without warranties as to performance or merchantability. The author and/or distributors of this program and its source code may have made statements about them. Any such statements do not constitute warranties and shall not be relied on by the user in deciding whether to use this program and its source code.
This program and its source code are provided without any express or implied warranties whatsoever. Because of the diversity of conditions and hardware under which this program may be used, no warranty of fitness for a particular purpose is offered. The user is advised to test the program thoroughly before relying on it. The user must assume the entire risk of using this program. The author and/or distributors of this program assume no liability whatsoever.
Download Lexical Attraction
Lexical Attraction requires .Net 2.0 to run and Visual Studio 2005 to compile source code.
Description
Lexical Attraction is an addictive word game for Windows.
Required Hardware and Software
Lexical Attraction requires a machine running .NET 2.0 or later and Windows XP or later.
How to Play
The object of Lexical Attraction is to select high-scoring words from the letters on the top row. For
example, consider the following game:
At the beginning of this game, letters from the top row (E, I, R, I, A, F, N, S, I, B, C, S)
can be used to form words. You can select letters from the top row in order by clicking them
with your mouse.
After each letter is used, the letter below it becomes available for use. For example, once
the F is used, the E below it is available for use:
Select the longest, highest-scoring word that you can find:
Then press the Enter Word button. Press Undo Letter if you selected the wrong letter. Press Undo Word
if you'd like to start the current word over. Press New Game when you've found all the words that
you can find.
Scoring
Each letter has a value based on the frequency in which it is found in the dictionary.
Common letters like A have low values; uncommon letters like Q have the highest values.
|
Letters
|
Score
|
| E, S |
1 |
| A, I, R |
2 |
| N, T |
3 |
| C, L, O |
4 |
| D, U |
5 |
| G, M, P |
6 |
| B, H, Y |
7 |
| F, V |
8 |
| K, W, Z |
9 |
| J, Q, X |
10 |
A word's score is the sum of each
letter's value, multiplied by the number of letters in the word. For example, the score for
FIRES is:
8 (F) + 2 (I) + 2 (R) + 1 (E) + 1 (S) = 14 * 5 letters = 70
Strategy
Find the longest, highest-scoring words. Pay attention to the letters immediately
below the top row. Remember, those letters will become available the moment the
letter above them is used.
Download Lexical Attraction
Lexical Attraction requires .Net 2.0 to run and Visual Studio 2005 to compile source code.