editor's blog
Subscribe Now

World’s Smallest Chess Program

Chess is tough, right? It’s a complicated game. Just explaining the rules can take hours, or hundreds of pages, and that’s before you get into subtle strategies. Mastering chess can be the work of a lifetime.

So how did a French kid write a fully featured chess program in just 487 bytes of code? Not 487 MB. Not even 487 KB. It’s four hundred and eighty-seven bytes of code. And it plays chess. This kid is good.

In case you’re wondering, the previous record holder for smallest chess program was Sinclair ZX1 Chess, which weighed in at 672 bytes, a tiny chess record it held for 33 years. There’s also Tiny Chess, a 1251-byte program. It offers graphics (as opposed to ASCII art), but since it’s written in Javascript, it’s not technically a standalone program, requiring megabytes of overhead to run.

 

Leave a Reply

featured blogs
Dec 19, 2024
Explore Concurrent Multiprotocol and examine the distinctions between CMP single channel, CMP with concurrent listening, and CMP with BLE Dynamic Multiprotocol....
Jan 10, 2025
Most of us think we know something about quantum computing, right until someone else asks us to explain it to them'¦...

featured chalk talk

Reliability: Basics & Grades
Reliability is cornerstone to all electronic designs today, but how reliability is implemented and determined can vary widely by different market segments. In this episode of Chalk Talk, Amelia Dalton and Sam Accardo from the YAGEO Group explore the definition of reliability for electronic components, investigate the different grades of reliability offered by the YAGEO Group and the various steps that the YAGEO Group is taking to ensure the greatest reliability of their components.
Aug 15, 2024
53,494 views