Wednesday, June 21, 2006

The knight's tour

The game of chess provides many interesting diversions that are independent of the game itself. Many of these diversions are based on the strange L-shaped move of the knight. A classical example is the knight's tour.

The knight's tour, which has captured the attention of both mathematicians and puzzle aficionados since the beginning of the eighteenth century, places a knight on any one of a chessboard's 64 squares, and then proceeds to move that knight to each one of the remaining 63 squares, landing on each square exactly once.

JavaWorld's article, The knight's tour written by Jeff Friesen, presents a KT applet that demonstrates a restricted version of the knight's tour. Instead of starting from any square, the knight starts in one of the corner squares. For Java programmers the article provides the source code for this applet.
Technorati Tags:
Blogs linking to this article

1 Comments:

Blogger Yasser said...

it is an amazing puzzle i admit

9:38 AM  

Post a Comment

Links to this post:

Create a Link

<< Home