Re: Any One have an idea?

*To*: mathgroup at smc.vnet.net*Subject*: [mg87786] Re: Any One have an idea?*From*: "Dana DeLouis" <dana.del at gmail.com>*Date*: Wed, 16 Apr 2008 22:33:48 -0400 (EDT)

> 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! (* Ver 6.01 *) Needs["Combinatorica`"] g = KnightsTourGraph[8, 8]; path = Partition[HamiltonianCycle[g], 2, 1]; ShowGraph[Highlight[g, {path}, HighlightedEdgeColors -> Red]] - - HTH :>) Dana DeLouis ----- Original Message ----- From: "AnnaSJ" <anna_112006 at yahoo.com> Newsgroups: comp.soft-sys.math.mathematica Sent: Monday, April 14, 2008 5:39 AM Subject: [mg87786] Any One have an idea? > 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: Re: Any One have an idea?***From:*Murray Eisenberg <murray@math.umass.edu>