Skip to main content
SWStudyWalks Search

Artificial Intelligence / Unit 3   AI 0144 short lesson, about 20 seconds

Score the Tree Backward

Captions available

The idea

A game tree is solved from the bottom: score the endings, then give every position the value of the child its controller would choose — MAX the highest, MIN the lowest.

In practice

A position's worth depends on what its futures are worth, so the arithmetic must start where futures end.

Where people slip

All the intelligence is in the direction of travel — backward — and none anywhere else.

Your place on the trail

Every lesson rests on earlier ones and opens later ones. Tap any to jump.

Something wrong in this lesson? Flag it  ·  Sources for Artificial Intelligence