How to Explain Decision Trees to an 8‑Year‑Old (Without a Screen)

Last night, my eight‑year‑old looked up from her pasta and said, “Mama, how does a computer decide things?”

I could have talked about algorithms. I could have drawn a flow‑chart. But instead I picked up the salt shaker and the pepper mill.

“Let’s play a game,” I said. “I’m thinking of a secret rule. You can ask me yes‑or‑no questions to figure it out.”

She asked, “Is it alive?” No. “Is it bigger than a breadbox?” Yes. “Can you sit on it?” Sometimes. After five questions, she narrowed it down to “furniture” and shouted the answer like she’d won a prize.

What she didn’t realise was that she’d just built a decision tree. Each question was a branch. Each answer led her closer to the final leaf. She had done exactly what an AI does when it classifies an image or decides whether to approve a loan.

And she didn’t touch a screen once.

Why decision trees matter
Decision trees are one of the simplest and most powerful ideas in artificial intelligence. They let machines sort things — animals, emails, loan applications — by asking a series of true‑or‑false questions. The better the questions, the better the tree. And children, naturally, are brilliant at asking better questions.

Try it yourself
After dinner, try the “Secret Rule” game with your child. Start with objects on the table. Then switch roles and let them be the teacher. Once they’ve mastered it, you can gently introduce the idea that computers use the same logic — only they do it thousands of times a second.

The HiKIDAI connection
In our game Kai’s Decision Tree Detective, children actually build a tree on screen, training a robot to sort animals based on their characteristics. When they later test the tree with a whale or a fox, they see what happens when the training data is incomplete. That’s the moment the light‑bulb goes on.

No jargon. No code. Just a salt shaker, a pepper mill, and a child who now understands how a computer thinks.