Weekly Contest for October 4, 2011
Join the Contest
% cd your-pc2-directory % /homes/cs390cp/pc2/bin/pc2team &
Log in using your individually assigned “teamX” account and password. You can work in the current window/directory, creating a subdirectory for each problem.
- E: Queue
Remember: If you've already solved one or more of these problems, try (1) solving again without referring to your old solution, and/or (2) using a different language (Java or C++). If you want to work on an additional problem from the book, let me know.
- A: Use this abstract class that defines the backtracking interface and solution from the textbook. Candidates are the numbers
0..N-1); but prune out the ones that have already appeared in
- B: The solution array is a vector of booleans:
a[i]true means element
iis in the subset; false means not in the subset. What are the candidate values?
- C: The solution array value
a[i]indicates the row in which the queen in column
iappears. Choose candidates by pruning all the rows that conflict with (i.e., are “attacked by”) queens already placed in the earlier columns.
- D: Like Queens, except more Bishops are possible (they only conflict diagonally, not via rows and columns). The solution vector contains
n*nbooleans indicating if a bishop is located in that space. Need functions that convert a square number (
0..n*n-1) to row and column numbers (integer division and mod are your friends). See Queens solution to determine if two bishops are in attack positions (i.e., the slope of the line between them is 45 degrees).
- E: Generate people placements from left to right. Need functions to compute the number of people who can see to the left and the number who can see to the right. Prune when impossible situations arise (e.g., if the tallest person is less than
plocations from the left edge, or if closer than
rlocations from the right edge). More efficient representations and pruning criteria are possible (and necessary to be accepted at the UVA or PC sites).
- F: More exotic application of backtracking.