How to find the index of an item in a two dimensional array with the most unique values surrounding it

Question

Given a square two dimensional array of a fixed size, say 100x100, with integer values ranging from 1-16, how would you go about finding the index/indices of a point/points with the most amount of unique values surrounding it? The closer the unique values are to the point, the better its "score" is and the more likely it is to be picked.

If this script was properly made, and, say the 2D array it was given had 4 degrees of symmetry along the diagonals, the script would pick a point somewhere along the diagonal as the most "unique" point.

I'm not sure if I'm properly describing what I want the script to do nor if it is possible, but if anyone has any ideas I would be interested in hearing them.

Answer 1

Here is a good solution I found:

function mostUniquePosition(matrix) {
    const rows = matrix.length;
    const cols = matrix[0].length;
    const radius = 10;  // how far away you want to search from each point in the array
    let maxUniqueElements = 0;
    let result = [0, 0];
    
    for (let i = 0; i < rows; i++) {
        for (let j = 0; j < cols; j++) {
            const elements = new Set();
            
            for (let x = Math.max(0, i - radius); x <= Math.min(rows - 1, i + radius); x++) {
                for (let y = Math.max(0, j - radius); y <= Math.min(cols - 1, j + radius); y++) {
                    elements.add(matrix[x][y]);
                }
            }
            
            if (elements.size > maxUniqueElements) {
                maxUniqueElements = elements.size;
                result = [i, j];
            }
        }
    }
    
    return result;
}