Communications of the ACM
The quest for excellence in designing CS1/CS2 assignments
SIGCSE '96 Proceedings of the twenty-seventh SIGCSE technical symposium on Computer science education
Fast algorithms for sorting and searching strings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Game playing (invited talk): the next moves
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
World-championship-caliber Scrabble
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
A Trie Compaction Algorithm for a Large Set of Keys
IEEE Transactions on Knowledge and Data Engineering
Adaptive Algorithms for Cache-Efficient Trie Search
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
LZ trie and dictionary compression
Software—Practice & Experience
A Scrabble Heuristic Based on Probability That Performs at Championship Level
MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
Dictionary data structures for smartphone devices
Proceedings of the 5th International Conference on PErvasive Technologies Related to Assistive Environments
| Hi-index | 48.22 |
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.