The Knight's Tour is a classic problem in chess and combinatorial mathematics that involves moving a knight piece around a chessboard. The goal of the Knight's Tour is to move the knight to every square on the board exactly once. A knight moves in an L-shape: two squares in one direction and then one square perpendicular, or one square in one direction and then two squares perpendicular. This unique movement gives the knight its characteristic capabilities.

Ancestors (6)

  1. Graph algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version