home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!decwrl!concert!borg!news_server!ladd
- From: ladd@oscar.cs.unc.edu (Brian Ladd)
- Newsgroups: sci.math
- Subject: Archives? Hexes?
- Message-ID: <LADD.92Aug31131220@oscar.cs.unc.edu>
- Date: 31 Aug 92 17:12:20 GMT
- Sender: news@cs.unc.edu
- Distribution: sci
- Organization: UNC Department of Computer Science
- Lines: 13
-
- I have been told, more or less reliably, that the shortest path on a
- hexagonal grid has been discussed here. Since I am sure those who follow
- this group regularly would rather not see such a disucssion again, could
- someone point me to archives which would contain such an algorithm? E-mail
- would be much appreciated, though I will follow this group for a while,
- looking for responses. Thanks in advance -bcl
-
- Brian C. Ladd
- Graduate Student & *NIX Court Jester
- Department of Computer Science
- University of North Carolina - Chapel Hill
- As usual, the University will disavow all knowledge of this posting and the
- poster. This posting will self-destruct in 5 seconds. 5...4...3...2...<hiss>
-