Dynamic crossword slot table implementation

A dynamic slot table algorithm to produce solution sets for orossword puzzle grids is presented. Its intptementation is compared with that of the static dot table formalism, Application of two current benchmarks for cromword puzzle solving algorithms demonstrate it is significantly more efficient on one benchmark, and more efficient in the way the sdgorithm traverses the search spaw for the seumd benchmark, than the most efficient slot table implementation reported to date.