Hi, i just wanted to ask an algorithm on this assignment, to find the longest knight's move, that it wouldn't cross it's own path. path is the shortest line between start of the one move and end of the one move. thank you.
Ernest Friedman-Hill
author and iconoclast
Marshal