##### Greater Sudoku Neighbor Reduction

In Greater Sudoku if a cell(x,y) has more than one greater peer cells say 'n' within a block, then the cell (x,y) can't have 'n' maximum values of possibilities that are present among those 'n' greater peer cells.

###### An illustration for the above concept. In the Rectangular block given, the cell (1,1) is the lesser cell which is having four greater cells (0,1), (1,0), (1,2) and (2,1). The combination of maximum values that are possible in these four greater cells are {5,7,8,9}. Hence, those values are removed from the lesser cell (1,1).

Likewise, if a cell (x,y) has more than one lesser peer cells say 'n' within a block, then the cell (x,y) can't have 'n' minimum values of possibilities that are present among those 'n' lesser peer cells. In the Rectangular block given, the cell (1,1) is the greater cell which is having four lesser cells (0,1), (1,0), (1,2) and (2,1). The combination of minimum values that are possible in these four lesser cells are {1,2,3,4}. Hence, those values are removed from the lesser cell (1,1).