Re: Determining Distance between 2 points

From: wtanksle@dolphin.openprojects.net (William Tanksley)

Date: Mon, 11 Sep 2000 21:16:44 +0000

On Mon, 11 Sep 2000 20:22:52 GMT, Chris Williams wrote:

>When I plot out two points on a grid, and then use Pythagorean Theorem to
>calculate distance, I often come up with (at least) one square more than the
>actual number of squares on the most direct path (based on my grid).

You're assuming that the diagonal path across a grid is of length 1.  It's
actually of length 1.414.

You have a few choices to fix this:

1. Just use the euclidean formula to calculate range and light radius;
ignore the fact that this makes it possible to run faster diagonally.

2. Same as #1, but make running diagonally cost 1.414 times what running
normally does.  This makes the game harder to play, of course, since while
trying to outmanuver a monster you can wind up getting hit twice.

3. Throw away the euclidean formula for most everything; this will make
everything square, including archery range and light sources.

4. Switch to a hex grid, in which distance is obvious.

Personally, I would either choose 1, 3, or 4.  I would say that 4 is
ideal, but it's not always possible; 1 is pretty but inconsistant, and 3
doesn't look good but does play well.

2 looks decent, but plays poorly; I don't like it at all.

>Chris Williams

--
-William "Billy" Tanksley

References

Determining Distance between 2 points
"Chris Williams" <williac6@rjrt.com>
Mon, 11 Sep 2000 20:22:52 +0000

Referenced By

Determining Distance between 2 points
"Chris Williams" <williac6@rjrt.com>
Mon, 11 Sep 2000 20:22:52 +0000