Game Playing Flashcards

(25 cards)

1
Q

What is the important question for a machine to decide in game playing?

A

What is my best next move?

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What must be considered when making decisions in game playing?

A

The opponent’s possible moves

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

In the MinMax algorithm, who does MAX represent?

A

The player we want to be the winner

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

In the MinMax algorithm, who does MIN represent?

A

The evil opponent

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What does each level of the MinMax tree represent?

A

Either MIN or MAX

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

How are leaf nodes labeled in the MinMax algorithm?

A
  • A positive number if MAX wins
  • A negative number if MIN wins
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is propagated from leaf nodes towards the root in the MinMax algorithm?

A

Node values based on whether the node is MAX or MIN

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is the best path in the MinMax algorithm?

A

The one that gives the maximum value if MAX plays

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is the n-ply look-ahead strategy?

A

Generate the game tree up to a depth n and evaluate leaf nodes using a heuristic function

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is the horizon effect?

A

The path may look promising but eventually lead to loss of the game

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is the size of the game tree in complex games described as?

A

Enormous due to combinatorial explosion

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What does alpha-beta pruning improve?

A

The efficiency of the MinMax algorithm

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is the result of using alpha-beta pruning?

A

Can save up to √N evaluated terminal states

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What are some examples of games that can be dealt with different algorithmic search approaches?

A
  • Checkers
  • Reversi (Othello)
  • Backgammon
  • Go
  • Card games
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What defines a game in game theory?

A

A formal representation of a situation in which individuals interact under strategic interdependence

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What are the characteristics of a game?

A
  • 2 players (agents) —- Multiple agents
  • Deterministic———- Stochastic
  • Turn-taking ———— Simultaneous moves
  • Zero-sum ————— Non-zero sum
  • Perfect Information - Imperfect Information
17
Q

What is a strategy in game theory?

A

A complete plan or decision rule for how a player will act in each situation

18
Q

What is the payoff matrix in game theory?

A

A table that describes the payoffs for each player based on their strategies

19
Q

What is the prisoner’s dilemma?

A

A scenario where two individuals must decide to confess or refuse, affecting their prison time

20
Q

What is a dominant strategy?

A

A strategy that leads to a better outcome regardless of the opponent’s choice

21
Q

What is Pareto Optimal?

A

A situation in which all the improvements have been made

22
Q

What is Nash Equilibrium?

A

A situation where no player can benefit by changing their strategy while others keep theirs unchanged (all of the players’ strategies would lead to an optimal choice)

23
Q

What is the outcome of the prisoner’s dilemma?

A

It forms a Nash equilibrium but is not Pareto optimal

24
Q

What factors can change the dynamics of a game?

A
  • Repeated games
  • Moral beliefs
  • Limited rationality
25
Who is John Forbes Nash?
A mathematician known for his work in game theory