Thread history

Fragment of a discussion from Talk:Raspberry Pi
Viewing a history listing
Jump to navigation Jump to search
Time User Activity Comment
No results

Interesting results.

Regarding some of the O(n^2) time things, I wonder if it would be worth trying to improve those via methods that subdivide the area (either tree or grid), to avoid having to do a check for each bot, for each bot. Of course, the question is how many bots does it take for the cost of maintaining the data structure to be made up for. I suspect more than 8 unfortunately.

Rednaxela15:39, 5 October 2012