Common Search Strategies and Heuristics With Respect to the N-Queens Problem CS504 Term Project

Abstract The N-Queens problem,is examined,and programmatically,implemented for Depth First Search, Depth First Search with improvements, Branch and Bound, and Beam Search. Several heuristics are presented and implemented,with each of the searches. Results were analyzed for number of nodes generated, number of nodes traversed, and relative execution time. While heuristics were found which gave Branch and Bound and Beam,Search a significant edge over DFS, there exist polynomial time algorithms using complete board assignment and heuristic repair methods,which are purported,to do better. Contents