TSP later became the commercial program Crosswise. All of these programs 54 were very good, and quite possibly strong enough to be a serious test for the best players in the world. Brian Sheppard began working on a Scrabble program in 1983, and started developing Maven in 1986. Consequently , Maven employs multiple move generators, each identifying moves that have important features that merit consideration. The world's fastest Scrabble program .
Many applications use finite automata to represent sets of words.
Authors are listed in alphabetical order. The world's fastest Scrabble program . For recognizers, we use the terms states and transitions from automata theory, instead of nodes and arcs from graph theory. Both of these implementations use less space than Hash Trees and perform faster searches. Deleting a key from the AMT and ACT is low cost.