A java program of knight travail problem. Using Breadth First Search to find the oputimum solution. This program has a limitation that it only can work on 8x8 boards.