L1: Introduction, Microworlds, Minimax Search Flashcards

1
Q

What are the four different ways of thinking about AI?

A

acting vs. thinking and human/ anthropomorphic vs. rationality (we focus on rational acting)

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

Properties of games

A

o Typically clearly structured
o Clear goals/ tasks (i.e. winning)
o Limited enough to be tractable (clear rules)
o Complex enough to be interesting

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

When did AI beat humans in games?

A

Backgammon- 1980s
Checkers & Chess- 1990s
Shogi, Go, Starcraft II- 2010s

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

Name some microworld examples

A

o SHRDLU (moving blocks around based on instructions)
o DENDRAL (mass spectrometry- expert system)
o MYCIN (antibiotics- expert system)
o ELIZA (psychotherapy- NLP)
o STUDENT (word algebra- NLP)

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

Characteristics of abstract two person game

A

o Players take turns
o Perfect information (everyone knows everything need to know to make best choice)- no one makes a mistake
o Deterministic (lack of randomness)
o Game is finished when one player wins or draws (i.e. if draw game tree will not all stop at same level)
o No cycles

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

How many terminal states in game with m moves and d turns?

A

O(m^d)

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

Basic idea of minimax?

A
  • Optimise short-term tactical play using game tree expansion
  • Score leaves with evaluation function at non-terminal depth (evaluation does not need to be zero sum)
  • Assume optimal play from both players
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What are possible extensions to minimax?

A

 Alpha-beta pruning
 Iterative deepening
 Transposition tables
 Quiescence search

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