*That raises the question of what is the smallest implementation of full chess?*... | Hacker News

Hacker News new | past | comments | ask | show | jobs | submit

login

userbinator on March 6, 2015 | parent | context | favorite | on: David Horne's 1K Chess on the ZX81 (2001)

That raises the question of what is the smallest implementation of full chess?

In terms of source code, probably Toledo Nanochess:

http://en.wikipedia.org/wiki/Toledo_Nanochess

However, that ~1k of source becomes closer to ~2.5k of binary (x86, Windows 32-bit.)

etrain on March 6, 2015 [–]

oh, with my latest chess programming language, the source code for chess is 0 bytes. feed an empty file to the chess compiler and out comes a working binary which plays chess.

Join us for AI Startup School this June 16-17 in San Francisco!
Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact