Arbor

Before Arbor came to the GridForge academy, adults thought her habit was a problem. She was the kid who drove her parents crazy by constantly asking, "But then what?"

She could never take a simple plan at face value. If her mother suggested driving to the beach, Arbor wanted to know what happened if the parking lot was full. If her teacher announced a class project, Arbor asked what would happen if two groups chose the same topic.

For years, people thought she was just an anxious kid. But in fifth grade, Arbor realized her habit was not a flaw at all. It was a superpower without an off switch. She was simply building trees inside her mind. She followed every choice down to its logical conclusion, step by step.

Because of that, real life rarely surprised her. Arbor did not worry about what might happen, because she had already visited most of it. She walked down the branches in her head, spotted the hidden traps, and came back to the present knowing which paths to avoid.

"Every choice you make is a branch," she told Rowan, pointing to her butcher-paper diagram. "Most people only look at the twig they are standing on right now. But the rest of the tree is right there, waiting for you to climb it."

Rowan snorted softly. "Nobody can draw every move in a real game, Arbor, because there are just too many."

"You do not have to climb the whole tree," she replied gently, because nobody can do that anyway. "The tree for chess has more branches than there are atoms in the universe. But if you climb just three or four moves deep, you win. The trick is to imagine your opponent picking their absolute best move at every single fork. Not their laziest move, and certainly not the move you hope they make. Plan against their best, and you stop reacting. You start seeing."

Gridley had invited Arbor to the academy to run the computational-thinking capstone. Gridley was the elder mentor who kept the academy running, and he wanted students to understand how games were cracked open by machines.

On her first morning, Gridley stood beside a tall slate chalkboard in the main hall. He held a piece of white chalk in his liver-spotted hand.

"Arbor," Gridley asked, his deep voice echoing off the stone walls. "Explain to the class why Connect-4 is officially considered a first-player win."

Arbor walked up to the board and picked up her own piece of yellow chalk. She drew a single circle at the bottom, then drew seven branches extending upward.

"In 1988, a computer program climbed the entire Connect-4 tree," Arbor said, turning toward the quiet room. "It visited over four trillion positions."

She turned back to the board and drew smaller forks on each branch.

"It reached every final leaf on every branch, proving that if the first player plays perfectly, the second player cannot stop them," she said. "It does not mean the first player usually wins," Arbor continued. "It means they win always, provided they never pick a weak branch. We know this because the whole tree was explored."

Gridley nodded, his thick gray eyebrows lifted in approval. "And how does the computer know which branch is best at the very beginning?"

"It works backward," Arbor said, tapping the chalk leaves at the top of her yellow tree. "You look at the end of every game. A leaf is either a win, a loss, or a draw, so you give each outcome a clear score. Then you push those scores back down the tree, from the leaves to the trunk."

She drew chalk arrows pointing downward along the branches.

"At every fork, you assume both players choose the best branch for themselves," she explained. "The winner picks the highest score, and the loser picks the lowest. That score flows all the way down to the starting dot. That is how value backs up the tree."

Gridley set his white chalk down with a crisp click. "You did not just explain a game move," he said softly. "You showed us how a game gets known all the way down."

Later that afternoon, Arbor sat at a wooden table in her workshop. A twelve-year-old boy named Leo sat across from her, staring at a grid game with his jaw clenched tight. He sat completely frozen.

"I cannot plan ahead," Leo muttered, dropping his forehead onto his knuckles. "There are too many possibilities, and my brain just freezes."

Arbor smiled warmly and slid a fresh pad of paper across the table. "Your brain freezes because you are trying to climb the entire forest at once," she said. "Nobody can do that, and even supercomputers cannot climb every single branch of a complex game."

She drew a neat, simple trunk on the paper.

"The secret is called pruning," Arbor said. "You prune away the silly branches instead of staring at every single move on the board. You only look at two or three of your best options."

Leo looked up from his hands, blinking. "Just two?"

"Just two or three," Arbor said, tapping her pencil on the paper. "At each fork, ask yourself what your strongest choices are. Follow only those lines. And at your opponent's turn, assume they are going to play their absolute smartest reply."

She pointed to the opponent's fork on the page.

"Never assume they will make a silly mistake," Arbor warned. "If you plan for them to play like a genius, you will never be ambushed."

Leo picked up his pencil and looked at the wooden board in front of him. Instead of panicking over fifty possible moves, he selected his two favorite options. He traced two branches down three steps, assuming Arbor would make her sharpest counters.

The tight knot in his shoulders relaxed. Within two minutes, he reached down and made a decisive, confident move.

"See?" Arbor grinned. "A tree with a few good branches is completely climbable. Seeing three moves clearly will always beat seeing fifty moves in a blur."