Scrabble® [1]Back to Contents Prev: [2]Move Selection Strategies _________________________________________________________________ References 1. A. W. Appel and G. J. Jacobson, "The world's fastest Scrabble program", Communications of the ACM, 31(5) 572-578, 585 (1988). 2. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computations, Addison-Wesley, Reading, MA, 1979. 3. A. V. Aho, R. Sethi and J. D. Ullman, Compilers: Principles, Techniques and Tools, pp. 141-144. Addison-Wesley, Reading, MA, 1988. 4. E. Fredkin, "Trie Memory", Communications of the ACM, 3(9) 490-500 (1960). 5. C Lucchesi and T. Kowaltowski, "Applications of finite automata representing large vocabularies", 23 15-30, 1993. 6. S. Gordon, "A faster Scrabble move generation algorithm", Software-Practice and Experience, 24(2) 219-232 (Feb. 1994). 7. S. Gordon, "A comparison between probabilistic search and weighted heuristics in a game with incomplete information", Technical Report, Department of Mathematics, East Carolina University, August 1993. 8. Milton Bradley Company, The Official Scrabble Player's Dictionary, 3rd ed, Merriam-Webster Inc., Springfield, MA, 1995. 9. N. Ballard, "The faint of heart are missing the boat", Games Medleys, 24 3-6 (Jan. 1993). 10. G. Brandreth and D. Francis, The Scrabble Companion, Leopard Books, London G.B, 1995. 11. J. Edley, The Official Scrabble Puzzle Book, Simon & Shuster, NY, 1997 _________________________________________________________________ [3]Back to Contents Prev: [4]Move Selection Strategies References 1. 2. 3. 4.