DRAFT: This module has unpublished changes.
- Java version generates and sorts all possible moves in an average of approximately 7 seconds. This is only on a 2 CPU core computer. On an 8 CPU core computer it is approximately 4 times as fast.
- Possible moves are sorted by comparing utility scores. Total utility score is defined by the sum of the score of the play and the utility score of the remaining letters in ones hand. The utility score is determined by 1645 games that Nigel played against itself. Thus worse scoring plays can be selected if it leaves more useful letters in a players rack.
- A full scale graphical user interface is in progress.
- There is an occasional IndexOutOfBoundsException that is thrown during the sorting of possible plays. At the moment, it is not known what is causing this bug. More testing is necessary.