General Game Playing - Assignment 4

General Game Playing

General
Artificial
Intelligence

Assignment 4

The main focus of this week's assignment to the implementation of players that can select moves without searching the entire game tree. In the first part of the assignment, your job is to implement some evaluation functions for states encountered during tree search, Your job in the second part of the assignment is to implement various players that can use these functions to select moves without searching the entire game tree.

Implement a pessimistic evaluation function, i.e. one that returns the actual reward on terminal states and returns 0 for all other states. (Very easy.)

Implement a mobility function. For states, when your player is in control, the function should return a high score for states in which your player has many moves and a low score for states in which it has few moves. For states in which you player is not in control, it should return a high score for states in which the player in control has few moves and a low score for states in which it has many moves. (Easy.)

Implement an intermediate reward function, i.e. one that returns the actual reward associated with that state, whether or not it is terminal. (Very easy.)

Implement a bounded-depth minimax player, i.e. one that explores the game tree to a fixed depth and uses estimated rewards for states at the fringe of the tree. Once your player is ready to go, choose one of the evaluation functions implemented above and click on the links below to test your player.

Implement an iterative deepening minimax player, i.e. a bounded-depth minimax player that searches the game tree to depth 1, then searches again to depth 2, then depth 3, and so forth until a fixed number of node is expanded or until time runs out. Once your player is ready to go, choose one of the evaluation functions implemented above and click on the links below to test your player.

Implement a player that uses the Monte Carlo Search technique. Once your player is ready to go, click on the links below to test it out.

Submission details: Choose one of your players and upload it to Gamemaster. Your grade for this assignment will be based on this player. Important: Include up to one page of commentary, so that the course assistants can understand your player and assess how well it addresses the lessons of the week. Your player must be uploaded by 6:00 pm the day before class, and uploads will be disabled from then until 6:00 pm the day of class.

In addition to using your submission in assigning a grade for the week, we will use your player in a variety of matches. Results will be announced in class, and we may demonstrate your player in action during class. Games will be similar to the ones above but will not be announced in advance. So be sure not to build in details about specific games.