Chess is an example of a game of perfect information. With perfect information in a market, all consumers and producers have perfect thong cake instantaneous knowledge of all market prices, their own utility, and own cost functions. Perfect information is importantly different from complete information, which implies common knowledge of each player’s utility functions, payoffs, strategies and “types”.
A game with perfect information may or may not have complete information. Games where some aspect of play is hidden from opponents – such as the cards in poker and bridge – are examples of games with imperfect information. Backgammon includes chance events, but by some definitions is classified as a game of perfect information. Chess is an example of a game with perfect information, as each player can see all the pieces on the board at all times. Academic literature has not produced consensus on a standard definition of perfect information which defines whether games with chance, but no secret information, and games without simultaneous moves are games of perfect information.
This includes games such as backgammon and Monopoly. Games with simultaneous moves are generally not considered games of perfect information. This is because each player holds information which is secret, and must play a move without knowing the opponent’s secret information. Nevertheless, some such games are symmetrical, and fair. An example of a game in this category includes rock paper scissors. Chapter 6: Extensive Games with Perfect Information”. Handbook of Game Theory with Economic Applications.
Chapter 11: Extensive Games with Imperfect Information”. Solving Imperfect Information Games Using Decomposition”. Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence. Complete vs Perfect Information in Combinatorial Game Theory”.