Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!ames!haven!adm!xadmx!elder@wpafb-info5.af.mil
From: elder@wpafb-info5.af.mil
Newsgroups: comp.lang.pascal
Subject: Algorithm to Count Hexes
Message-ID: <20217@adm.BRL.MIL>
Date: 11 Jul 89 23:11:29 GMT
Sender: news@adm.BRL.MIL
Lines: 12


I am working on a game written in Turbo Pascal.  The game board consists
of hexes with the columns 'numbered' with letters and the rows 'numbered'
with digits.  I have been trying to wtite a routine which is given two hex
positions and will return the minimum number of hexes inbetween, i.e., the
shortest "hex moves" between two hexes.  Has anyone written a routine like
this before.  So far I have not had any success at getting my code to
work for all combinations of hexes.  I know I don't have a correct algorithm
(since it is not working).  Can anyone offer any assistance?

Greg Elder
elder@wpafb-info7.arpa