From: "Alan D. Brunelle" 
Newsgroups: rec.games.chess.analysis
Subject: Re: Knight tour puzzle question
Organization: USG
ftn.hub.org!news.trends.ca!hub.org!Supernews73!supernews.com!howland.erols.net
!cpk-news-hub1.bbnplanet.com!su-news-hub1.bbnplanet.com!news.bbnplanet.com!new
s1.digital.com!pa.dec.com!depot.mro.dec.com!nntpd.lkg.dec.com!lead.zk3.dec.com
!zk2nws.zko.dec.com!usenet
The heuristic I used was the same (I think) as your second course: when
creating the list of moves to check next from each position, sort them
such in order of distance from the center of the board (Pythagorean...),
with largest distances done first. It is amazing how many of the squares
are solved without *any* backtracking at all: just the first 63 tries
are correct!
-- 
Alan D. Brunelle                Phone: (603) 884-2303 / DTN: 264-2303
Digital Equipment Corporation   E-Mail: brunelle@zk3.dec.com
ZK03-3/U14                      110 Spit Brook Road, Nashua, NH 03062
---
---------------