COMPSCI 171 Quiz: 2018-fq-cs-171-quiz-3-key
Document Summary
Cs-171, intro to a. i. , fall quarter, 2018 quiz # 3 20 minutes. Seat: (40 pts total, 4 pts each) adversarial (game) search concepts. For each of the following terms on the left, write in the letter corresponding to the best answer or the correct definition on the right. A approximates the value of a game state (i. e. , of a game position) D function that specifies a player"s move in every possible game state. In all game instances, total pay-off summed over all players is a constant. C tree where nodes are game states and edges are game moves. E returns same move as minimax, but may prune more branches. F optimal strategy for 2-player zero-sum games of perfect information, but impractical given limited time to make each move. G vector dot product of a weight vector and a state feature vector. H function that decides when to stop exploring this search branch.
