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

Re: Any One have an idea?

• To: mathgroup at smc.vnet.net
• Subject: [mg87640] Re: [mg87580] Any One have an idea?
• From: "W_Craig Carter" <ccarter at mit.edu>
• Date: Tue, 15 Apr 2008 05:47:11 -0400 (EDT)
• References: <200804140939.FAA07820@smc.vnet.net>

Hello Anna,
I found this:

Needs["Combinatorica`"]
?KnightsTourGraph

But, could not find a direct documentation route to find it. I can't
remember why I even knew it was there.

Hope this is the method you were thinking of.

KInd Regards, Craig

On Mon, Apr 14, 2008 at 5:39 AM, AnnaSJ <anna_112006 at yahoo.com> wrote:
> 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.
>
>



-- 
W. Craig Carter

• References:
  • Any One have an idea?
    • From: AnnaSJ <anna_112006@yahoo.com>