Artificial Intelligence / AI 0144 · Atom · ~20 seconds
Score the Tree Backward
Video not yet published
to the StudyWalks catalog
to the StudyWalks catalog
State
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.
Show
A position's worth depends on what its futures are worth, so the arithmetic must start where futures end.
Watch for
All the intelligence is in the direction of travel — backward — and none anywhere else.