I scraped all Lichess games where either player was 2000+ Elo and all FIDE games without limitation (up through March 2026). I then ran breadth-first search on the accumulated graph. The tricky part was figuring out which Lichess accounts belong to which players, for which I (viz. Claude) cross-referenced a bunch of different resources, the output of which you can find here (as far as I know this is actually the best existing reference!).
Once you input your username, we run a bidirectional search, using the precomputed BFS on one end and a DFS over your strongest opponents on the other. We let you iterate this search as much as you want, though it’s worth noting that the initially reported number (excluding those where no path is found) is accurate with p=0.988 over a random sample of n=1500. Moreover, we have precomputed paths for 2000+ players, though we allow them to run further bidirectionals as well.