?Average branching factor of 35.Games are competitive
environments, in which agents'
goals conflict, giving rise to
adversarial search problems.Calculating the optimal decision is infeasible
?Games often have time constraints, so efficiency has an important role
Games
Assoc.Multiagent
environments, each agent must
consider the actions of the other
agents.Prof. Hanaa Salem Marie Spring 2023/2024
?Prof. Hanaa Salem Marie Spring 2023/2024
?At the end of the game, points are
awarded to the winning player, and
penalties are given to the loser.Prof. Hanaa Salem Marie Spring 2023/2024
?So
: initial state, which specifies how the game is set up at the start
?RESULT(s, a): transition model, which defines the result of a move
?A
Assoc.Example: Chess
?Search tree has about 35100 or 10154 Nodes.We first consider games with two players,
whom we call MAX and MIN.Games
Assoc.Definition of a game as a search problem
?player (s): Defines which player has the move in a state
?ACTIONS(s): Returns the set of legal moves in a state
?TERMINAL -- TEST(s): terminal test or goal test.???????