This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 2. The nQueens problem is to position n queens on an n × n chessboard so that no two queens threaten each other. That is, no two queens may be in the same row, column, or diagonal. When n = 4, ﬁnd all conﬁgurations satisfying this goal with backtracking technique. 3. If our local transformations consist of 2opts only, are there any locally optimal tours in Figure 1 that are not globally optimal? Figure 1: An instance of TSP 1...
View
Full
Document
This note was uploaded on 02/04/2010 for the course COMPUTER S cs300 taught by Professor Unkown during the Spring '08 term at Korea Advanced Institute of Science and Technology.
 Spring '08
 Unkown
 Algorithms

Click to edit the document details