// Project: Recursion
// Module: knightstour
// Source code file Main.java

// Show solution of the Knights Tour Problem:
// visit every square on an n x n chessboard once.
// A knight makes an L-shaped move.

public class Main
{
    public static void main(String[] args)
    {
        // Instantiate frame.
        new MyFrame();
    }
}