This preview shows page 1. Sign up to view the full content.
Unformatted text preview: second chance if she does not see the pearl the first time. 4. Draw the game tree for the Votes by Veto game. Votes by veto: A winner from a set of four candidates {a, b, c, d} are being selected by a committee of { I, II, III}. The committee will select a winner by taking turn, starting with I, in vetoing one of the remaining candidates. Mission : (Nimble) In the following strip, each square can contain at most one coin (denoted by d). On a player’s turn, he must pick a coin and shift it an arbitrary number of squares to the LEFT, without jumping over any other coin and without sliding off the strip. Who wins?...
View
Full
Document
This note was uploaded on 03/13/2012 for the course MATH 4321 taught by Professor Cheng during the Spring '12 term at HKUST.
 Spring '12
 Cheng
 Math

Click to edit the document details