Sounds good. It's similar to a formula used when you're writing simple AI routines. It works best in strategy games (especially turn based) for discovering troop densities. Basically, take an array (2d or 3d) and give it a value of '1' if that position in the array has somebody in it. The next loop through the array checks each position, if the value = 1, check each side of it. Increment the value once for each side that has somebody in it.
In a flat, 2d environment, which guys setup like this.. (assume x = little guy & o = empty spot)
xooxo
oxxxo
oxxxo
oxxxo
ooxox
You'd end up with an array that looked like:
20030
04640
06960
04640
00402
Therefore, the highest value is a current hotspot, and game rules can be applied accordingly. It works in 3d too. The only difference is the numbers are bigger, and adjusting the range values to check positioning takes a few more lines of coad.
Primitive, but it works.