Unformatted text preview: 2. The n-Queens 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 2-opts 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
- Spring '08
- Algorithms, Backtracking, Minimax, Eight queens puzzle, game tree