=======================================================================================
The Knight's Travails Challenge
=======================================================================================

Welcome! :) I accept two squares identified by algebraic chess notation.
The first square is the starting position and the second square is the ending position.
I will then find the shortest sequence of valid moves to take a Knight piece from the
starting position to the ending solution.

Example input would be: A8 B7

=======================================================================================

Stella Lie ([email protected])
Updated: 29/04/2012 with Java 1.6.0_29

=======================================================================================

Compile and run main() method within the Main class.
For e.g on terminal you can run: 
1. javac Main.java
2. java Main