Search⌘ K
AI Features

Game Trees

Explore how to represent two-player games using game trees and learn a recursive backtracking algorithm to evaluate good or bad game states. Understand how this approach can be used to determine winning moves and perfect play strategies, while facing the challenge of large state spaces.

Understanding the game constraints

Consider the following simple two-player game played on an n×nn × n square grid with a border of squares; let’s call the players Horace Fahlberg-Remsen and Vera Rebaudi. Each player has nn ...