Moravec's Paradox and the Robot Olympics
physicalintelligence.company·6d·
Discuss: Hacker News
🤖AI
Preview
Report Post

Published

December 22, 2025

Email

research@physicalintelligence.companyPhysical Intelligence

When a computer defeated the world champion at chess in 1996, it could select the best moves but needed a person to move the pieces. Twenty years later, when AlphaGo defeated the world champion in Go, it still could not move the pieces on its own. Today, LLMs can solve gold medal IMO problems, but can’t write down the answer with a pencil. This mismatch between our expectations about how hard something is for us and how hard it is for machines is called Moravec’s paradox. Seemingly hard problems like playing chess, solving math problems, or planning routes through congested streets to minimize travel time are "easy" for machines, whereas seemingly easy problems like picking up a chess …

Similar Posts

Loading similar posts...