On the $K$-best mode in computer chess: measuring the similarity of move proposals

Ingo Alth�fer
ICCA J. 20(3):152–165, Sep 1997

Cites:

Finding the $k$ shortest paths

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine