HW3 - 2. The n-Queens problem is to position n queens on an...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Fall Semester 2008 CS300 Algorithms Homework #3 (due 10/17) 1. Consider a game tree in which there are six marbles, and player 1 and 2 take turns picking from one to three marbles. The player who takes the last marble loses the game. (a) Draw the complete game tree for this game. (b) If the game tree were searched using the alpha-beta pruning technique, and nodes representing configurations with the smallest number of marbles are searched first, which nodes are pruned? Draw the pruned game tree.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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, find all configurations 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

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.

Ask a homework question - tutors are online