Deterministic games: Deterministic games are those games which follow a strict pattern and set of rules for the games, and there is no randomness associated with them.
Imperfect information: If in a game agents do not have all information about the game and not aware with what's going on, such type of games are called the game with imperfect information, such as tic-tac-toe, Battleship, blind, Bridge, etc.
Agents have all the information about the game, and they can see each other moves also.
Perfect information: A game with the perfect information is that in which agents can look into the complete board.
Games are modeled as a Search problem and heuristic evaluation function, and these are the two main factors which help to model and solve games in AI.
So, Searches in which two or more players with conflicting goals are trying to explore the same search space for the solution, are called adversarial searches, often known as Games.
Each agent needs to consider the action of other agent and effect of that action on their performance.
The environment with more than one agent is termed as multi-agent environment, in which each agent is an opponent of other agent and playing against each other.
But, there might be some situations where more than one agent is searching for the solution in the same search space, and this situation usually occurs in game playing.
In previous topics, we have studied the search strategies which are only associated with a single agent that aims to find the solution which often expressed in the form of a sequence of actions.
Adversarial search is a search, where we examine the problem which arises when we try to plan ahead of the world and other agents are planning against us.