Assignment 2

Due Friday, Feb. 24, midnight in the CS47225 assignment bin.

1. Exercise 4.6
2. Exercise 4.9
3. Exercise 4.11
4. Exercise 4.12
5. Exercise 6.1
6. Exercise 6.2
7. Write your own tic-tac-toe program with techniques discussed in class. Your program should be able to play n by n boards with m in a row. Do not submit code; rather, answer:
1. Describe the algorithms and techniques you used in your program.
2. Which techniques were most useful?
3. For what values of n and m can you solve the entire game tree?
4. How many nodes do these scenarios generate?
5. Do optimal players tie in these scenarios or is one player guaranteed to win? If one player wins, which one?