Here is my problem :
Let's say we have a two dimensionnal array of $n \times n$ squares. In this array there are m targets and the player knows this value. Each turn you can shoot a square,
if there is a target the target disappears and you get informed that you "killed" a target ;
if there is no target where you shot you are being informed of the number of targets in diagonals, row and column in every direction.
You win if every target has been shot down.
I need to make the most efficient algorithm to this problem but I can't find where to look at or where to start, can you help me ?
Ps : I am french so excuse my poor language.