The Knight's Tour is a mathematical problem involving a knighton a chessboard. The knight is placed on the empty board and,moving according to the rules of chess, must visit each squareonce. There are several billion solutions to the problem, of whichabout 122,000,000 have the knight finishing on the same square onwhich it begins. When this occurs the tour is said to be closed.

Write a program in C++ and Java that solves the Knight'sTour problem.