What do you know about Adversarial Search? Give Example
Answer:
Basically the adversarial is a type of search where we find the solutions to the problem of something
which we try to plan but also some other agent search against us in the same thing or field. We can
say that two or more players of games are trying to solve the problems and find their solutions by
using the searching but in the same search space or field and this is called adversarial search. There is
a multi-agent environment in this environment two players play against each other and they have to
consider the action of another player to understand the strategy of it. And this may affect their
performance. And these searches of both players in the conflicting goals in the same search space to
find the proper solutions.
There are some examples of Adversarial Search:
1. Chess Solved
2. Tic-tac-toe Solved
3. Go Unsolved
There are also different types of games are as follows:
1. Imperfect information and perfect information
2. Zero-sum and non-zero-sum
3. Two players
4. Deterministic
Perfect Information:
Basically, the perfect information means that a player in a game has complete information about
the game. If they are playing a multi-player game then they can see each other moves.
For example chess, checker
Imperfect Information:
Imperfect information means that a player in the game that have not all information about the
game and doesn’t know what to do.
For Example strategy games and battleship
Deterministic:
Basically, the deterministic means those game which is too strict and they have the strong rule
and regulations for games:
For Example tic-tac-toe
Zero-Sum/Non-zero-Sum:
Answer:
Basically the adversarial is a type of search where we find the solutions to the problem of something
which we try to plan but also some other agent search against us in the same thing or field. We can
say that two or more players of games are trying to solve the problems and find their solutions by
using the searching but in the same search space or field and this is called adversarial search. There is
a multi-agent environment in this environment two players play against each other and they have to
consider the action of another player to understand the strategy of it. And this may affect their
performance. And these searches of both players in the conflicting goals in the same search space to
find the proper solutions.
There are some examples of Adversarial Search:
1. Chess Solved
2. Tic-tac-toe Solved
3. Go Unsolved
There are also different types of games are as follows:
1. Imperfect information and perfect information
2. Zero-sum and non-zero-sum
3. Two players
4. Deterministic
Perfect Information:
Basically, the perfect information means that a player in a game has complete information about
the game. If they are playing a multi-player game then they can see each other moves.
For example chess, checker
Imperfect Information:
Imperfect information means that a player in the game that have not all information about the
game and doesn’t know what to do.
For Example strategy games and battleship
Deterministic:
Basically, the deterministic means those game which is too strict and they have the strong rule
and regulations for games:
For Example tic-tac-toe
Zero-Sum/Non-zero-Sum:
