In game theory, perfect information describes the situation when a player has available the same information to determine all of the possible games (all combinations of legal moves) as would be available at the end of the game.
In game theory, a game is described as a game of perfect information if perfect information is available for all moves. Chess is an example of a game with perfect information as each player can see all of the pieces on the board at all times. Other examples of perfect games include tic tac toe, irensei, and go. Games with perfect information represent a small subset of games. Card games where each player's cards are hidden from other players are examples of games of imperfect information.
Read more about Perfect Information: Microeconomics
Famous quotes containing the words perfect and/or information:
“One can prove or refute anything at all with words. Soon people will perfect language technology to such an extent that they’ll be proving with mathematical precision that twice two is seven.”
—Anton Pavlovich Chekhov (1860–1904)
“Computers are good at swift, accurate computation and at storing great masses of information. The brain, on the other hand, is not as efficient a number cruncher and its memory is often highly fallible; a basic inexactness is built into its design. The brain’s strong point is its flexibility. It is unsurpassed at making shrewd guesses and at grasping the total meaning of information presented to it.”
—Jeremy Campbell (b. 1931)