Path Length to ELO

Discussion of chess software programming and technical issues.

Moderators: hgm, Dann Corbit, Harvey Williamson

User avatar
mhull
Posts: 13447
Joined: Wed Mar 08, 2006 9:02 pm
Location: Dallas, Texas
Full name: Matthew Hull

Path Length to ELO

Post by mhull »

Path length here would be the notional number of machine instructions required to play at a particular level of chess.

The more specific question:
Has the path length been shortened or lengthened in the last 30 years to be able to play at a particular level?

Expert
Master
Senior Master/NM
IM
GM
WC
WC+

Of course, 30 years ago the top chess projects would have done well to reach a NM norm.

Facts? Tests? Opinions?
Matthew Hull
User avatar
mhull
Posts: 13447
Joined: Wed Mar 08, 2006 9:02 pm
Location: Dallas, Texas
Full name: Matthew Hull

Re: Path Length to ELO

Post by mhull »

Example:

If we think the path length has been shortened to play at 2200 in the last 30 years, then in principle we could perhaps reprogram a dedicated chess computer from late 1980s to improve its play from ~2000 to ~2200.
Matthew Hull
bob
Posts: 20943
Joined: Mon Feb 27, 2006 7:30 pm
Location: Birmingham, AL

Re: Path Length to ELO

Post by bob »

mhull wrote:Path length here would be the notional number of machine instructions required to play at a particular level of chess.

The more specific question:
Has the path length been shortened or lengthened in the last 30 years to be able to play at a particular level?

Expert
Master
Senior Master/NM
IM
GM
WC
WC+


Of course, 30 years ago the top chess projects would have done well to reach a NM norm.

Facts? Tests? Opinions?
Speaking for myself, the path length is much shorter today. In 1977 I played in the 2nd WCC with the last selective version of my program, which was well over 100,000 lines of code. So from that perspective, it is shorter. Probably the evaluations are a bit longer, but that is only a fraction of the total search path length.