--- title: "Perfect Information Game | Game Theory" description: "Perfect information game means every player sees all past moves and can plan with the full game history in Game Theory, often using game trees and backward induction." canonical: "https://fiveable.me/game-theory/key-terms/perfect-information-game" type: "key-term" subject: "Game Theory" unit: "Unit 6" --- # Perfect Information Game | Game Theory ## Definition A perfect information game is a game in which every player knows all previous moves made by every player. In Game Theory, that makes the game tree fully visible and lets you analyze choices step by step. ## What It Is A perfect information game is a Game Theory model where every player can see the full history of play, including every move made before their turn. Nothing is hidden, so decisions are made with complete knowledge of what has already happened. This usually shows up in sequential games, where players move one after another instead of at the same time. Because each move is public, the next player can respond to the exact path the game has taken. That makes perfect information games a natural fit for game trees and extensive form games. Chess is the classic example. Both players can see the board, so there are no secret pieces, hidden cards, or private actions. The challenge is not guessing what the other player knows, but figuring out how they will respond given the same visible position you can see. That is why perfect information changes the strategy. You are not trying to infer hidden data, but to predict future choices from the current game state. In a game tree, each branch shows a possible move, and you can trace the consequences all the way to the end of the game. This setting also makes backward induction possible. You start at the final outcomes, work backward through the tree, and ask what each player would choose at each node if they are rational. That is how perfect information games connect to subgame perfect equilibrium, since the strategy has to make sense not just overall, but inside every smaller decision point too. A common misconception is that perfect information means the game is simple. It usually is not. The information is complete, but the strategy space can still be huge, especially in games like chess where the number of possible sequences is enormous. ## Why It Matters Perfect information game is one of the cleanest settings for studying strategic choice because it shows how players reason when nothing is hidden. It gives you a framework for seeing how a move today changes the options tomorrow, which is the core logic behind extensive form analysis. This term also sets up backward induction, one of the main tools in sequential games. If you can work from the end of the game back to the start, you can identify what rational play looks like at each stage instead of just guessing at a final outcome. It also helps you separate information problems from strategy problems. In a perfect information game, if a player makes a surprising move, the issue is not that they lacked data. The move is a choice from a fully visible position, so your analysis focuses on incentives, payoffs, and rational responses. In the broader course, this term helps you compare game types. When you later study simultaneous games or hidden actions, you can see exactly what changes once information is no longer fully shared. That contrast is a big part of how Game Theory explains real strategic behavior. ## Connections ### Extensive Form Game Perfect information games are often written as extensive form games, which use a tree to show the order of moves, available actions, and payoffs. The tree format makes it easier to see why all past actions matter and how each decision point leads to later branches. If you can read an extensive form game, you can spot where perfect information is present. ### Nash Equilibrium A Nash equilibrium looks at whether any player wants to change their strategy given the others' choices. In a perfect information game, you often compare Nash equilibrium with the stronger idea of subgame perfect equilibrium, because not every Nash equilibrium makes sense at every point in the tree. The difference shows why sequential logic matters. ### Simultaneous Game A simultaneous game is the opposite setup, where players choose without seeing the other player's move first. That contrast makes perfect information easier to recognize because the timing of moves is public and ordered. If you confuse the two, check whether the players are reacting to visible past actions or choosing at the same time. ### [Reinhard Selten](/game-theory/key-terms/reinhard-selten) Reinhard Selten is closely tied to subgame perfect equilibrium, which is one of the main solution concepts used in perfect information games. His work helps explain why strategies need to be credible in every subgame, not just at the start. That idea matters most when you analyze a game tree move by move. ## On the AP Exam A quiz question or problem set usually asks you to identify whether a game has perfect information from its setup, game tree, or description of play. You may need to explain that every move is observed, then use that fact to choose the right solution method, often backward induction. In a tree diagram, you should be able to point to the visible history and show why later players know earlier choices. If the course gives you an example like chess or another turn-based game, the task is usually to decide whether the game is perfect information and then reason through the best response at each node. If a hidden card, secret signal, or private move appears, that breaks perfect information. The main skill is spotting what is public, what is private, and how that changes the strategy. ## Perfect Information Game vs Simultaneous Game These get mixed up because both involve strategy, but they differ in timing and visibility. In a simultaneous game, players choose without seeing the other move first. In a perfect information game, moves happen in sequence and every past action is visible, so later choices can respond directly to earlier ones. ## Key Takeaways - A perfect information game is one where every player knows all previous moves made in the game. - These games are usually analyzed with game trees and extensive form, because the order of play matters. - Backward induction works well here because you can reason from later outcomes back to earlier decisions. - Chess is the standard example, since both players can see the full board and the complete move history. - Perfect information does not mean easy, only that nothing is hidden from the players. ## FAQs ### What is a perfect information game in Game Theory? It is a game where each player sees every move that has already happened. Because the full history is visible, players can base their choices on the exact state of the game instead of guessing about hidden actions. ### Is chess a perfect information game? Yes. Both players can see the entire board and all past moves, so there is no hidden information. That makes chess a standard example when you first learn about sequential games. ### How is a perfect information game different from a simultaneous game? In a simultaneous game, players choose at the same time or without seeing the other player's move first. In a perfect information game, moves are sequential and public, so the next player can react to what has already happened. ### How do you solve a perfect information game? You often use backward induction on a game tree. Start from the final outcomes, work backward through each decision node, and choose the action that gives the best result for the player moving there. ## Related Study Guides - [6.1 Extensive form games and game trees](/game-theory/unit-6/extensive-form-games-game-trees/study-guide/CvnDy9Jo9TmwD7r3) - [1.2 Key concepts and terminology in game theory](/game-theory/unit-1/key-concepts-terminology-game-theory/study-guide/m1ypg5D9O4hAzsoL) ## About This Document Canonical Fiveable pages are available as Markdown at the same path plus `.md`. - [llms.txt](https://fiveable.me/llms.txt): index of Fiveable's sections and URL patterns - [llms-full.txt](https://fiveable.me/llms-full.txt): complete subject and unit listing - [MCP server](https://fiveable.me/mcp): call Fiveable as tools instead of fetching pages (`https://fiveable.me/api/mcp`) - [MCP server for AP teachers](https://fiveable.me/mcp/teachers): a teacher's classes, assignments and AP-rubric grading (`https://fiveable.me/api/mcp/teacher`) ## Structured Data ```json {"@context":"https://schema.org","@graph":[{"@type":"LearningResource","@id":"https://fiveable.me/game-theory/key-terms/perfect-information-game#resource","name":"Perfect Information Game | Game Theory","url":"https://fiveable.me/game-theory/key-terms/perfect-information-game","learningResourceType":"Concept explainer","educationalLevel":"AP® / High School","about":{"@id":"https://fiveable.me/game-theory/key-terms/perfect-information-game#term"},"audience":{"@type":"EducationalAudience","educationalRole":"student"},"dateModified":"2026-07-03T02:21:36.475Z","isPartOf":{"@type":"Collection","name":"Game Theory Key Terms","url":"https://fiveable.me/game-theory/key-terms"},"author":{"@type":"Organization","@id":"https://fiveable.me/editorial#content-team","name":"Fiveable Content Team","url":"https://fiveable.me/editorial","parentOrganization":{"@id":"https://fiveable.me/#organization"},"member":[{"@type":"Person","name":"Amanda DoAmaral","sameAs":["https://www.linkedin.com/in/adoamaral"]},{"@type":"Person","name":"Becky Bahr","sameAs":["https://www.linkedin.com/in/becky-bahr-b52743132"]}]},"publisher":{"@type":"Organization","name":"Fiveable","url":"https://fiveable.me"}},{"@type":"DefinedTerm","@id":"https://fiveable.me/game-theory/key-terms/perfect-information-game#term","name":"Perfect Information Game","description":"A perfect information game is a game in which every player knows all previous moves made by every player. In Game Theory, that makes the game tree fully visible and lets you analyze choices step by step.","url":"https://fiveable.me/game-theory/key-terms/perfect-information-game","inDefinedTermSet":{"@type":"DefinedTermSet","name":"Game Theory Key Terms","url":"https://fiveable.me/game-theory/key-terms"}},{"@type":"FAQPage","mainEntity":[{"@type":"Question","name":"What is a perfect information game in Game Theory?","acceptedAnswer":{"@type":"Answer","text":"It is a game where each player sees every move that has already happened. Because the full history is visible, players can base their choices on the exact state of the game instead of guessing about hidden actions."}},{"@type":"Question","name":"Is chess a perfect information game?","acceptedAnswer":{"@type":"Answer","text":"Yes. Both players can see the entire board and all past moves, so there is no hidden information. That makes chess a standard example when you first learn about sequential games."}},{"@type":"Question","name":"How is a perfect information game different from a simultaneous game?","acceptedAnswer":{"@type":"Answer","text":"In a simultaneous game, players choose at the same time or without seeing the other player's move first. In a perfect information game, moves are sequential and public, so the next player can react to what has already happened."}},{"@type":"Question","name":"How do you solve a perfect information game?","acceptedAnswer":{"@type":"Answer","text":"You often use backward induction on a game tree. Start from the final outcomes, work backward through each decision node, and choose the action that gives the best result for the player moving there."}}]},{"@type":"BreadcrumbList","itemListElement":[{"@type":"ListItem","position":1,"name":"Game Theory","item":"https://fiveable.me/game-theory"},{"@type":"ListItem","position":2,"name":"Key Terms","item":"https://fiveable.me/game-theory/key-terms"},{"@type":"ListItem","position":3,"name":"Unit 6","item":"https://fiveable.me/game-theory/unit-6"},{"@type":"ListItem","position":4,"name":"Perfect Information Game"}]}]} ```