Could someone give an easily accessible reference containing an algorithm that could be conveniently implemented into a code for computing Knight's Tour (preferably also with fairlygood efficiency)?
Reference request for coding Knight's Tour
algorithms;graphs;reference request