All Topics
All Topics
Technology
Technology
Design
Design
Programming
Programming
Science
Science
News
News
Gaming
Gaming
Entertainment
Entertainment
Business
Business
Finance
Finance
Sports
Sports
Health
Health
Food
Food
Travel
Travel
Art
Art
Music
Music
Books
Books
Education
Education
Politics
Politics
Personal
Personal
No algorithm. No AI slop. No ads. Just RSS. Pro-human. Indie writers. Real journalism. Open web. Chronological. Hand toasted.

A computer scientist's quest to find a chess position with 218+ possible moves

By

emporas

8mo ago· 14 min readenInsight

Summary

A computer scientist describes their pursuit to settle the question of the maximum number of playable moves in a reachable chess position, building on Nenad Petrović's 1964 record composition. The article explains the technical challenge of finding a position with more than 218 possible moves, clarifying that this is about branching factor (available moves in a single position), not game length.

Key quotes

· 3 pulled
Ever since Nenad Petrović, grandmaster of chess composition, published his record composition in 1964, people have tried to come up with a better one.
Being a computer scientist, I decided to join the pursuit in May 2024 and settle this question once and for all.
I hope that the title is unambiguous enough now and I wholeheartedly apologize to all the people who thought that it was about 218 move long games!
Snippet from the RSS feed
I hope that the title is unambiguous enough now and I wholeheartedly apologize to all the people who thought that it was about 218 move long games! .___. <3

You might also wanna read