Sequential Move Games
Imagine you are playing a high-stakes game of chess where your opponent moves first. You watch their piece slide across the board, knowing that your next move depends entirely on their choice. This is the essence of a sequential move game, where players take turns rather than acting at the same time. Because the second player sees what the first player did, they can plan their own strategy with perfect information. Unlike games where everyone acts at once, these scenarios allow for careful calculation of future outcomes.
Mapping the Decision Tree
To visualize these turn-based interactions, logicians use a tool called a decision tree. This structure looks like a map of branches that grow from a single starting point. Each branch represents a possible choice a player might make at a specific moment. By drawing these paths, you can see every potential future for the game laid out clearly. It helps you track how one early decision limits or expands the options for everyone involved later on. You start at the root and follow the lines until you reach the final outcome for each player.
Think of a decision tree like choosing a path through a dense forest. If you turn left at the first fork, you might encounter a river that forces you to go right. If you turn right at the start, you might find a bridge that keeps you moving straight ahead. Your path is not random because the landscape dictates which options remain open to you. In a game, the rules and the previous player's actions serve as the landscape. You must look ahead at the entire forest before you commit to your first step.
Solving Through Backward Induction
Once you have a full map of the game, you can use a process called backward induction to find the best move. You start at the very end of the tree where the game finishes. Look at the last player's possible choices and identify which one gives them the highest reward. Since that player acts rationally, you assume they will always choose that path. You then move one step backward to the previous turn and repeat the process. By working from the end to the start, you can determine exactly what the first player should do.
This method essentially lets you prune the tree of all irrational or sub-optimal choices. If you know your opponent will always choose the path that benefits them, you can ignore the branches they would never take. This simplifies the game until only the most logical path remains for both sides. It turns a complex web of possibilities into a single, predictable sequence of events. You are essentially predicting the future by working in reverse from the final result to the current moment.
| Stage | Action Type | Goal of Player | Outcome |
|---|---|---|---|
| Early | Strategic | Set the scene | Control the flow |
| Middle | Reactive | Adjust to turns | Maintain advantage |
| Final | Decisive | Secure reward | Maximize utility |
Key term: Backward induction — the analytical method of solving a game by starting at the final move and working backward to the first.
Using this technique allows you to foresee the final outcome before the game even begins. It removes the guesswork from your strategy by highlighting the only logical path forward. When you understand the consequences of every action, you can confidently choose the starting move that leads to your success. This logical framework is the foundation for understanding how people interact in competitive environments. By applying this, you can master any game that relies on sequential turns and rational decision-making.
Predicting the outcome of a sequential game requires working backward from the final results to determine the optimal starting move.
The next Station introduces dominant strategy analysis, which determines how players choose their best move when they cannot see their opponent's actions.