Chapter 2: AI Problem Solving (Part 2)

Heuristics and Practical Shortcuts

In complex games like Chess or Go, the branching factor, the number of legal moves available at each turn, is so immense that calculating a game tree all the way to completion would take longer than the age of the universe. To function in real time, AI relies on Depth-Limited Search paired with a Heuristic Evaluation Function. The computer searches ahead only a few moves, stops, and uses a heuristic formula to estimate the overall strength of that board position.

A heuristic is a practical rule of thumb that provides a good approximation when exhaustive calculation is impossible. This is precisely how a Mahatma (the appointed caretaker of a sacred grove) monitors an expansive Oran like the 29-square-kilometer Kolu Pabuji forest. It is physically impossible to inspect every tree, bird, and shrub daily. Instead, the caretaker relies on ecological heuristics: checking the foliage of an ancient Jant (mature Khejri tree), observing the bloom of a Rohido, or listening for the call of a Mor (peacock). These key indicators serve as a reliable evaluation function for the health of the entire ecosystem.