Any One have an idea?

*To*: mathgroup at smc.vnet.net*Subject*: [mg87580] Any One have an idea?*From*: AnnaSJ <anna_112006 at yahoo.com>*Date*: Mon, 14 Apr 2008 05:39:19 -0400 (EDT)

Dear All, 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. Thanks All, Anna SJ.

**Follow-Ups**:**Re: Any One have an idea?***From:*"W_Craig Carter" <ccarter@mit.edu>

**Re: Any One have an idea?***From:*Arnoud Buzing <arnoudb@wolfram.com>

**Re: Any One have an idea?***From:*Joe Bolte <joeb@wolfram.com>