Solution to In a game of chess, a queen can travel any number of squares in a … - Sikademy
Author Image

Archangel Macsika

In a game of chess, a queen can travel any number of squares in a straight line- horizontally, vertically or diagonally. Moving the queen from queen (q) to king (k) visiting each square exactly once with the minimum number of moves possible

The Answer to the Question
is below this banner.

Can't find a solution anywhere?

NEED A FAST ANSWER TO ANY QUESTION OR ASSIGNMENT?

Get the Answers Now!

You will get a detailed answer to your question or assignment in the shortest time possible.

Here's the Solution to this Question

Diagonal moves are obviously impractical, because the diagonal move captures a small number of cells, and also blocks the path of future lines. Since the beginning and end cells are on the same horizontal, it is optimal to fill the horizontal completely, using vertical single-celled transitions. Use a large one vertical line to climb up and 7 small ones to make transitions from horizontal to horizontal. There are 8 horizontal lines in total, but since it is impossible to draw one horizontal line through the entrance and exit, at the bottom it will be divided into two parts, that is, 9 horizontal lines. 1+7+9=17 moves only. Let's show one of the options:

Related Answers

Was this answer helpful?

Join our Community to stay in the know

Get updates for similar and other helpful Answers

Question ID: mtid-5-stid-8-sqid-4091-qpid-2790