RE: FN-FORUM: Mapping problem

date posted 8th January 2005 23:21

Have to say Joe's idea is very good, as it should achieve somethig very
similar to what you are after, and is somewhat analagous to a "binary chop"
which is well known as one of the fastest ways to find a value in an ordered
list.

Dave.

__________________________________________________
Dave Boulden, Director. DA Media Limited
web: http://www.da-media.co.uk/
Tel: 01795 559456 Fax: 07092 011488



> -----Original Message-----
> From: [EMAIL REMOVED] [EMAIL REMOVED] On
> Behalf Of Joe Freeman
> Sent: 08 January 2005 23:33
> To: FN-FORUM / [EMAIL REMOVED]
> Subject: Re: FN-FORUM: Mapping problem
>
>
> How about, divide the big square into, say, 4 squares - look
> at how many are in each, then continue this process with the
> square with the least population. And keep going until you
> have the size you want. But it depends how the rest of it is
> setup I suppose, as to how easy that will be.
>
> Regards, and good luck,
> Joe.
>
>
> On 8 Jan 2005 21:40:52 -0000, John Kyle
> [EMAIL REMOVED] wrote:
> > I have to create an algorithm for a Flash game - I have a
> 10000x10000
> > grid and I have to place a 3x3 area on the map for a new
> player to join the game.
> > Can anybody recommend what would be the most efficient way of
> > calculating the placement position on the grid to make in furtherst
> > away from any squares claimed by another player?
>
> --
> Freelancers, contractors earn more with Prosperity4 Call 0870
> 870 4414 or visit www.prosperity4.com and benefit from Inland
> Revenue approved expenses today.
>
> To advertise here: http://www.freelancers.net/advertising.html
>
>