This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: MA410 Artificial Intelligence - Games & Searching Problem Sheet 1. Name the role artificial intelligence has in solving games. Are there any historical successes for AI? 2. Define the following: (a) Depth-first searching (b) Breadth-first searching (c) Best-first searching (d) Alpha-beta pruning 3. A variant of Nim starts with one pile of tokens, and the two players take turns to move. A move consists of taking one, two or three tokens from the pile, and the player taking the last token loses. Draw the complete game tree starting from a pile of (i) 3, (ii) 4, (iii) 5, (iv) 6, (v) 7 tokens respectively and use minimax to decide which player has a winning strategy in each case. 4. Consider the following two-player game. The game begins with six dots as shown below: Players take turns to connect adjacent dots either horizontally or vertically: If a move completes a square then the player wins the square, marks it, and takes an extra turn....
View Full Document
This note was uploaded on 10/23/2011 for the course ENCS ENCS5 taught by Professor Abdelsalam during the Spring '10 term at Birzeit University.
- Spring '10