[Date Index] [Thread Index] [Author Index]

Re: Any One have an idea?

• To: mathgroup at smc.vnet.net
• Subject: [mg87671] Re: Any One have an idea?
• From: Bill Rowe <readnews at sbcglobal.net>
• Date: Tue, 15 Apr 2008 05:53:08 -0400 (EDT)

On 4/14/08 at 5:39 AM, anna_112006 at yahoo.com (AnnaSJ) wrote:

>Does anyone have any idea how to do or come up with the "knight's
>tour" problem.  Please give me some idea how to do it!

>The program is used a random number to select a starting position
>for the knight, and select the next position by selecting one of the
>available positions at random.  When the knight reaches a position
>from which the number of the last possible available positions, the
>tour is finished.

The usual statement of the problem is from a random starting
point visit every square of the chessboard once. When that is
done, the tour is finished.

See


<http://mathworld.wolfram.com/KnightsTour.html>
<http://demonstrations.wolfram.com/TheKnightsTour/>