Difference between revisions of "Thread:User talk:Rednaxela/kD-Tree/removeOld() not working? Or locationCount not decrementing after removeOld()?/reply (16)"

From Robowiki
Jump to navigation Jump to search
 
(More informative phrasing.)
Line 3: Line 3:
 
I tested with both the SqrEuclidean and Manhattan versions of my Weighted trees.  Both seemed to work fine in several test battles with some bots I had sitting around.  I ended up making a WeightedDistanceFunction class to be a superclass of both the WeightedManhattanDistanceFunction and WeightedSquareEuclideanDistanceFunction..  to duplicate less of the code involved in weighting.
 
I tested with both the SqrEuclidean and Manhattan versions of my Weighted trees.  Both seemed to work fine in several test battles with some bots I had sitting around.  I ended up making a WeightedDistanceFunction class to be a superclass of both the WeightedManhattanDistanceFunction and WeightedSquareEuclideanDistanceFunction..  to duplicate less of the code involved in weighting.
  
The weighted DF should failover gracefully if given bizarre weights.  Only thing I didn't implement was doing a Math.abs() on weights, since someone out there might invent a DistanceFunction that utilizes negative weights.
+
The weighted DF should failover gracefully if given weights that mismatch the number of tree dimensions.  Only thing I didn't implement was doing a Math.abs() on weights, since someone out there might invent a DistanceFunction that utilizes negative weights.
  
 
If the code on my bitbucket fork meets your approval, I can toss you a pull request. :)
 
If the code on my bitbucket fork meets your approval, I can toss you a pull request. :)

Revision as of 19:44, 22 May 2012

DeBroglie rev0026 is up. Only change from rev0025 is your 3rd gen tree. Should perform pretty close to what it was doing before, though some differences are to be expected since your 3rd gen tree doesn't drop points. We'll see, though I have to get going to the doctor at the moment.

I tested with both the SqrEuclidean and Manhattan versions of my Weighted trees. Both seemed to work fine in several test battles with some bots I had sitting around. I ended up making a WeightedDistanceFunction class to be a superclass of both the WeightedManhattanDistanceFunction and WeightedSquareEuclideanDistanceFunction.. to duplicate less of the code involved in weighting.

The weighted DF should failover gracefully if given weights that mismatch the number of tree dimensions. Only thing I didn't implement was doing a Math.abs() on weights, since someone out there might invent a DistanceFunction that utilizes negative weights.

If the code on my bitbucket fork meets your approval, I can toss you a pull request. :)