One day, a knight went to the legendary kingdom named Breadland. The Breadlanders love eating bread. They also play chess. What’s different from normal chess is that the chessboard they use is 9×7; each player has a queen on each side of the king; one is next to the king and the other is between a bishop and a knight. Also, each side has one more pawn so that there may be totally 4 queens and 18 pawns on the chessboard. In fact, Breadland is a chessboard itself, and is of course 9×7.
The knight was on a square of Breadland; he wanted to visit each square of Breadland exactly once, and return to the square he was originally on. Each step, the knight moved to one of the squares nearest to that on which it stood but the queen couldn’t reach.
Could the knight achieve his goal?
