The speaker recalls a video of a child completing a seven-disc Tower of Hanoi puzzle in about two minutes and believes the child could probably complete eight discs because the solution is recursive.

“Even pretty big ones.”

“I mean, there's a video,”

“I think, of a kid doing seven discs lightning fast,”

“like in two minutes on YouTube.”

“A kid who enjoys it. He's probably 12 or 15 or whatever.”

“I'm sure he can do eight discs if he wants to because it's a recursive algorithm.”