Across
- 5. Basis of randomized algorithms
- 6. Method of trying all N-Queen paths
- 8. A single value in a sorting array
- 10. Checking every possible solution
Down
- 1. TSP where distance A to B equals B to A
- 2. A "rule of thumb" used for TSP
- 3. KMP step to build the LPS table
- 4. The specific string we search for
- 7. Second step of Divide and Conquer
- 9. A valid position for a queen