Hello Jason,
Correct me if I'm wrong: I believe the Traveling-Salesman-Problem-Algorithm
only needs the distances between each Point, which means that you set up a
matrix containing each location an the several distances between. Thats
exactly the same in 2D or in 3D. So if you think, TSP might help, use one of
the standard solutions. But if you ask me - I don't know how TSP could solve
your problem
HTH
----- Original Message -----
From: Jason Taylor <[EMAIL PROTECTED]>
To: <[EMAIL PROTECTED]>
Sent: Wednesday, August 01, 2001 6:08 PM
Subject: Re: [JAVA3D] Some maths... help?
>
> I know not very clear, I shall try to define it better...
>
> There exists a 3D space which contains 1,000,000 possible locations in
> a 100*100*100 cube.
>
> There exists 300 objects in that space randomly placed in different
> locations. (The goal!)
>
> There are several spheres of radius 15 units which can move 12 units in
> and around this space per time period.
>
> The spheres have already found 296 objects through trial and error and
> various cunning paths.
>
> I have the coord of every spheres position across the cube over time.
>
> I want to calculate which locations in the cube have not been covered
> by the spheres to this point in time.
>
> From that I want to figure out where to send the spheres in order thru
> probability to find the remaining 4 objects in the shortest amount of
> time. (I don't know where they are and I can only move each sphere once
> per week so this is less then real-time! :)
>
> Yes it's a game which I've been playing for two years, neither me nor
> the friend that wrote it can figure a good way to do this considering
> all the other elements at work.
>
> So the spheres have already been to somewhere in the region of 360
> locations with a lot of overlaps and not necessarily the best paths. I
> need to take account of that data in order to generate the unseen x,y,z
> locations and figure out where to send the spheres to see the biggest
> concentrations as fast as possible.
>
> Cheers for the interest and I hope that someone can point me in the
> direction of the maths or functions that could help make this more
> efficient. I have asked several Maths PHDs in the past but without luck.
> :)
>
> Best idea we have come up with so far is a 3D version of a "travelling
> salesman" algorithm, alas we have no idea how to program this or how to
> write the maths! :)
>
> Many thanks,
> Jason.
>
> ____________________________________________________________
> [EMAIL PROTECTED] - Tel: +44 (0)24 765 22299
> Room 108 - IT Services - University of Warwick
> Coventry - CV4 7AL - UK
>
>
===========================================================================
> To unsubscribe, send email to [EMAIL PROTECTED] and include in the
body
> of the message "signoff JAVA3D-INTEREST". For general help, send email to
> [EMAIL PROTECTED] and include in the body of the message "help".
===========================================================================
To unsubscribe, send email to [EMAIL PROTECTED] and include in the body
of the message "signoff JAVA3D-INTEREST". For general help, send email to
[EMAIL PROTECTED] and include in the body of the message "help".
