const adjacentPositions = [
    [-1, -1], [0, -1], [1, -1], // top row
    [-1, 0],          [1, 0],   // middle row
    [-1, 1],  [0, 1], [1, 1],   // bottom row
];

const getAdjacentCount = ({ grid, width, height, x, y }) => {
    return adjacentPositions.reduce((count, [dx, dy]) => {
        const newX = x + dx;
        const newY = y + dy;

        // Bounds check
        if (newX < 0 || newX >= width || newY < 0 || newY >= height) 
            return count;

        return grid[newY]?.[newX] === FILLED ? count + 1 : count;
    }, 0);
};

for (let y = 0; y < height; y++) {
    for (let x = 0; x < width; x++) {
        if (grid[y]?.[x] !== FILLED) continue;
        
        if (getAdjacentCount({ grid, width, height, x, y }) < 4) {
            count++;
        }
    }
}

while (true) {
    const toRemove: [number, number][] = [];

    // Find all currently accessible rolls
    for (let y = 0; y < height; y++) {
        for (let x = 0; x < width; x++) {
            if (grid[y]?.[x] !== FILLED) continue;
            
            if (getAdjacentCount({ grid, width, height, x, y }) < 4) {
                toRemove.push([x, y]);
            }
        }
    }

    // No more accessible rolls? We're done!
    if (toRemove.length === 0) break;

    // Remove all accessible rolls simultaneously
    for (const [x, y] of toRemove) {
        grid[y][x] = EMPTY;
    }

    count += toRemove.length;
}