Hello everyone!
I am a math teacher/independent researcher and I believe I have developed a new measure of chess complexity, Asset-Configuration Complexity, that I believe will sharply reduce computational loads in chess engines and database tables. I've posted the preprint of my research paper and benchmarking script to Zenodo.org here: https://doi.org/10.5281/zenodo.21288811
Since I am an outsider to the chess engine/theory industry, I'm genuinely unsure if this is a known, standard methodology or a fresh perspective. I would love your critical feedback, critiques, and general thoughts on my work. I have been unable to find any academic sources applying my methodology to chess, and I'm genuinely curious if this is a new and novel idea or something that the industry has already passed over.
Honestly looking forward to all forms of feedback and critical reviews.
Thanks for your time!!
A New Perspective on Chess Complexity
Moderator: Ras
-
rblasingame
- Posts: 1
- Joined: Sun Jul 05, 2026 7:16 pm
- Full name: Ryan Blasingame