The world's fastest Scrabble program

An efficient backtracking algorithm makes possible a very fast program to play the SCRABBLE® Brand Crossword Game. The efficiency is achieved by creating data structures before the backtracking search begins that serve both to focus the search and to make each step of the search fast.

[1]  S. Sitharama Iyengar,et al.  Efficient algorithms to globally balance a binary search tree , 1984, CACM.

[2]  Stuart C. Shapiro.  A Scrabble Crossword Game Playing Program , 1979, IJCAI.

[3]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[4]  Edward Fredkin,et al.  Trie memory , 1960, Commun. ACM.

[5]  David Haussler,et al.  Linear size finite automata for the set of all subwords of a word - an outline of results , 1983, Bull. EATCS.

[6]  Quentin F. Stout,et al.  Tree rebalancing in optimal time and space , 1986, CACM.

[7]  A. Nerode,et al.  Linear automaton transformations , 1958 .

[8]  Edward M. Reingold,et al.  Binary search trees of bounded balance , 1972, SIAM J. Comput..

[9]  Donald E. Knuth,et al.  The art of computer programming: V.1.: Fundamental algorithms , 1997 .

[10]  Donald E. Knuth,et al.  The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .

[11]  Gaston H. Gonnet,et al.  Balancing binary trees by internal path reduction , 1983, CACM.

[12]  Samuel H. Fuller,et al.  Performance of height-balanced trees , 1976, CACM.

[13]  Rene De La Briandais.  File searching using variable length keys , 1959, IRE-AIEE-ACM Computer Conference.

[14]  Computer Scrabble , 1981, SGAR.

[15]  Donald E. Knuth.  The art of computer programming: fundamental algorithms , 1969 .

[16]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[17]  M. AdelsonVelskii,et al.  AN ALGORITHM FOR THE ORGANIZATION OF INFORMATION , 1963 .