How to Use Limited Memory in Heuristic Search
Hermann Kaindl, Gerhard Kainz, Angelika Leeb, Harald Smetana · ICGA Journal · 1995
The program is easily modified (changing only one line of code) so that it will also find the best move in this sense. I prefer, however, to calculate only anyone of the best moves with respect to the draw/win definition because this takes less time. My program, available via ftp, does so.