The aim of this coursework is to develop solutions of a game using Al techniques. Description...

Transcribed Image Text:

The aim of this coursework is to develop solutions of a game using Al techniques. Description A two-person game is played with a set of identical stones arranged into a number of heaps. There may be any number of stones and any number of heaps. A move in this game consists of either removing any number of stones from one heap or removing an equal number of stones from each of two heaps. The winner of this game is the player whose turn it is to play when there is no stone left to pick. For example, with three heaps, of sizes 3, 2, and 1, there are ten possible moves, leading to these states (where we use the representation of game states as a list of the sizes of the heaps): Taking from the first heap only: [2,2,1], [2,1,1],[2.1] Taking from the second heap only: [3,1,1],[3,1] Taking from the third heap only: [3,2] Taking from the first and second heaps: [2.1.1],[1,1] Taking from the first and third heaps: [2.2] Taking from the second and third heaps: [3,1] [3,1] occurs twice because there are two different ways of reaching it in one move. Also note that the states are sorted lists as the order of the heaps has no bearing on the game. For example with two heaps of size 2 represented by [2.2] taking one stone from either heaps should produce state [2.1]. The aim of this coursework is to develop solutions of a game using Al techniques. Description A two-person game is played with a set of identical stones arranged into a number of heaps. There may be any number of stones and any number of heaps. A move in this game consists of either removing any number of stones from one heap or removing an equal number of stones from each of two heaps. The winner of this game is the player whose turn it is to play when there is no stone left to pick. For example, with three heaps, of sizes 3, 2, and 1, there are ten possible moves, leading to these states (where we use the representation of game states as a list of the sizes of the heaps): Taking from the first heap only: [2,2,1], [2,1,1],[2.1] Taking from the second heap only: [3,1,1],[3,1] Taking from the third heap only: [3,2] Taking from the first and second heaps: [2.1.1],[1,1] Taking from the first and third heaps: [2.2] Taking from the second and third heaps: [3,1] [3,1] occurs twice because there are two different ways of reaching it in one move. Also note that the states are sorted lists as the order of the heaps has no bearing on the game. For example with two heaps of size 2 represented by [2.2] taking one stone from either heaps should produce state [2.1].

Answer rating: 100% (QA)

Certainly I can help you with this coursework The game you described is known as a Nim game Nim is a mathematical strategy game that involves removing ... View the full answer