Multi tool use

Minefield Challenge [on hold]

Got interesting code challenge recently (below), thought about it for awhile, but could not really come up with solution. Would really appreciate help!!

Notice that it's not 2D matrix and traditional minesweeper challenge.

Thoughts coming to mind - sub-graph, recursive algorithms, but seems I am over-thinking the problem.. (say I have 10,000 mines - I have to iterate thru all 10K, and then collect winning mines for a 2nd level of explosions etc.)

Explosive power is basically to calculate a distance to the near-by mine (if reachable)

Challenge

Write a program which takes as input a list of mines composing a 2D minefield; each mine has an X position, a Y position, and an explosive power. All three parameters may be assumed to be single-precision floats; explosive power may not be negative. There may not be more than one mine at the same coordinates.

When a mine in the minefield is triggered at time T=0, it causes all other mines within a straight-line distance less than or equal to its explosive power to be triggered at time T=1. Those mines subsequently trigger additional mines at T=2, and so forth, in a chain reaction.

Have your program determine, for any given input minefield, the mine that, if triggered first, will result in the highest number of explosions occurring during a single time interval. Output the coordinates of the winning mine, the time interval of the peak number of explosions, and the number of explosions during that interval. In case of a tie, output each of the best mines, sorted by X coordinate then Y coordinate.

Assume that the minefield may be large, but not larger than can easily fit in memory; optimize for processing efficiency.

Please edit the question to limit it to a specific problem with enough detail to identify an adequate answer. Avoid asking multiple distinct questions at once. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.