can a knight travel on all the squares of a chess board?

Question

if u hav the answer,send me tat quickly.today itself

Answer 1

yes but it takes a very long time because they can only move in an L-shape in any direction

Answer 2

Yes, it can eventually reach every square on the board. There is a problem in chess literature called the "Knight's Tour", the object of which is for the knight to visit every square once and only once. If it finishes on a square where the knight is attacking the starting square it is called a closed tour; otherwise it is an open tour. More info can be found at the site below.

Answer 3

Yes. In fact there is a solitare chess game called the "Knight's tour" where the knight moves so as to land on every square of the board exactly once and end in a place where the next move would put him on the starting point.

Answer 4

While it is a challenge to do so, the Knight can be placed one any square on a chess board if you think your moves out.

However, during the game, it's best for a Knight be near the center of the board to maximize the number of spaces it has influence (where it can land / attack) upon.

Answer 5

Yes, a knight can travel onl all the squares of a chess board.

Answer 6

it can move 2 steps ahead or back and then the third step to the rite or left of the 2nd step so this means that eventually it will be able to travel on all squares of the chess board

Answer 7

<>Theoretically, it can travel, eventually, on all squares during the course of its movements. It does, however, move by jumping 2 squares ahead or back and then 1 square right or left, giving it a somewhat random path around the board.

Answer 8

Yes, the "KNIGHT" can eventually reach every square on the board.

Answer 9

Yes, provided it jumps from one square to another in an L shaped method. ()4 squares involved)

Answer 10

The knight moves in half a Y in any direction