Hello guys, I work on a final project study discussed the use of optimization methods. The project in question consists in partitioning a grid dimensions NXM grids in dimensions 3 X 3 (which share no box) to the extent possible, otherwise find grids of dimensions 3 x 3 which are dependent grids ie 3 X 3 shares of cells. The dimensions N and M are known and can be multiple of 3! I managed to make the algorithm but it is not optimal, I would like to know if there are technical mathematical partitioning has on these problems for better optimization. The goal is to be elected in each grid box center. Thank you.