Question

Please Explain in own words and IN FULL sentences (At least 3 sentences)

1) TRUE or FALSE, then explain answer: In a fully observable, turn-taking, zero-sum game between two perfectly rational players, it does not help the first player to know what strategy the second player is using— that is, what move the second player will make, given the first player’s move.

2) TRUE or FALSE, then explain answer: In a partially observable, turn-taking, zero-sum game between two perfectly rational players, it does not help the first player to know what move the second player will make, given the first player’s move.

3) TRUE or FALSE, then explain answer: A perfectly rational backgammon agent never lose.

4) When do you backtrack?

Answer 1

4) Backtracking is an algorithm that always tries to find a solution of given parameters.It is done by candidates for the solution and by those which cannot fulfill the conditions.So one can backtrack to the point where the fault or error has occur. A typical example for a task to solve would be the Eight Queens Puzzle Problem,Which is commonly known for backtracking. Backtracking is also commonly used within Neuronal Networks.

3)

A perfectly rational backgammon agent never lose. False

As the agent can lose the game if the one against has more score. and one can not backtrack the chance if once played. The dice plays major role in the game.So one can either loose the ganeu or can win the game.

1) False

As one can easily understand the moves played by the other agent If one has the proper knowledge about the game.One chance played by one player will be understood by other player if the player observes the player step and tries to understand the loss which he/she can suffer due to that move.