CSCI 4511W Midterm: CS 4511 UMN Midterm 2key s09
Document Summary
Open book and notes - no computer: 15 points - the game of nim is played as follows. Two players alternate removing 1, 2, or 3 pennies from the stack. The player who picks up the last penny loses. Show by drawing the game graph that the player who plays the second move can always win. 1 s m o v e o e. 1 p v s p s l o. In the above graph, the states are represented by the number of pennies left in the stack. Termites are insects. n k e y s. O t s t a a u s a t t n i e s s f (b) what procedure could you use to answer the following kind of question: does a eat b? . Describe it informally in terms of how the arcs in the networks will be traversed. Here, we want to employ a sort of bidirectional graph search.
