Theory of Computer Games, NTU Homework #1 Due date: 2:20pm, Nov 4, 2010. Descriptions: Pick a single-user game, describe the game, play the game and then write a program to solve. You can invent your own game if you want. Solution package: 1. code + documents to explain various heuristic used. 2. Do experiments to "guess" why games are difficult, while some are easy. factors that may affect the level of difficulties: a. number of revealed cells in the starting position b. average branching factor c. max or min branching factor d. depth of search trees e. heuristics used f. number of nodes visited in searching g. amount of knowledge used. ... 3. Prepare a 10-minute presentation and demo with some slides. Homework demo at the class of Nov 4, 2010. Note: 1. A single user is defined to be a game that can be solely played by one person without any helps from any user/agent/computer once the game is designed. So playing an on-line video game is not. Playing against computer is also not. 2. Picking a game that is too easy, for example 8-puzzle, is very bad to your score. 3. Pick a very difficult game, for example 48-puzzle, and not solving it also is vary bad to your score.