linked me to free games yesterday. But I won't be distracted until my project is done :D
*** EXCELLENT FUCKING NEWS ***
My kd tree rectangle query is now fully operational! I have a perl script that generates sets of 100000 points and says how many should be in two sample rectangles. Those rectangles are then checked in the project. The counts always match AND (THIS IS THE BEST PART) IT ACTUALLY RUNS IN O(sqrt(n)+k) TIME! I mean, it BURNS through the tree! This is excellent. Now all I have to do is get my kd tree balancer to actually work, and I should get 100 on this project. After nothing but failure since friday, it feels good to write a working algorithm!