Problem Five: A Knight’s Tour II
Oct 20th, 2006 by Percy
Once again, take a chess knight and place it anywhere on an 8 by 8 chess board. Find the longest path the knight can take without intersecting itself.
Oct 20th, 2006 by Percy
Once again, take a chess knight and place it anywhere on an 8 by 8 chess board. Find the longest path the knight can take without intersecting itself.