games in AI Flashcards
1
Q
Games in AI
A
AI def is more specific then math def
- 2 players called Min and Max
- -Max always goes first
- turn taking
- deterministic
- fully observable
- total payoff is constant among instances of the game
2
Q
search in games
A
- specify moves for every possible opponent reply
- time constraints (must approximate)
3
Q
How games are modeled
A
- Initial state
- action(s)
- result(s,a)
- terminal_state(s)
- utility(s, p)
4
Q
Initial state
A
specifies the start state
5
Q
player(s)
A
whoever moves in state(s)
6
Q
action(s)
A
set of legal moves in state s
7
Q
result(s, a)
A
specifies the state resulting from move a in state S
-transition model
8
Q
terminal_state(s)
A
true in “Game over” states
False otherwise
9
Q
Utility(s,p)
A
s is a terminal state
p is the player
defines the utility of player p in game end state s
10
Q
utility(s,p) chess example
A
win = 1 lose = 0 draw = 1/2
