Games Flashcards
Have a self-contained environment
Form a small-scale model of a specific problem : ADVERSARIES
Games
A game can be defined by the ff components
STATE SPACE SET OF PLAYERS ACTIONS RESULTS TERMINAL UTILITY
List of all possible game states in the game including initial state S0
State Space
List of players in the game
Set of players
Function that results the list of next possible moves of a player
Actions(S, P)
Function that returns the resulting state given an action
Results(S,a)
Returns true if resulting state is a terminal state
Terminal (s)
Returns the value of the state, S, for the player P
Utility values are usually expressed as positive and negative numbers
Utility(S,P)
Games where utility of the two players SUM UP TO ZERO
Zero sum games
Number of turns needed to reach a terminal state
Depth
Approximate number of actions a player can take
branching factor
Makes sure that agent will always choose an action that will LEAD TO A WIN or atleast a DRAW
Min-Max (MiniMax) algorithm
Computational complexity of min-max algorithm
O(b^m)
algorithm used to avoid searching subtrees of moves that won’t be considered
Alpha-Beta Pruning
Best value currently for the max nodes
Alpha
