liveBook · Manning

Final state

As explained in Grokking AI Algorithms, Second Edition

A game state in which the game has ended because a player has won or the game is a draw.

A final state is a game state where a player has won or the game is a draw. In minimax search, reaching one ends that branch of the search and returns the state’s score. section 3.7

A depth limit can also stop a search, but it does not mean the game has ended; it simply limits how many turns ahead the algorithm looks. section 3.7

Figure 3.17 The possible end states in a Connect Four game
03_17

Possible end states in Connect Four illustrate where a game can finish. section 3.7

How Grokking AI Algorithms, Second Edition covers it

How deep it goes
Defines wins and draws and their scores, while distinguishing terminal states from depth-limited search cutoffs.
Examples
Uses possible end states in Connect Four to illustrate game endings.
What you can do after
Evaluate whether a game state is a win, loss, or draw and recognize when minimax search can stop.
How it connects
Connects final states to minimax search, game trees, and search depth.

Also explained in

Compare how 2 books explain final state →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Grokking AI Algorithms, Second Edition. The section links point to the parts of the book it draws on.