A chess problem
Budget: $30 – $250 USD
Given a matrix M
and sub matrices N1，N2，.. Ni
Retrieve the whole matrix by selecting T elements ,
Which satisfy (in priority)
1, No two elements in T will be a neighbor in all matrix N1,..Ni
2, The total distances among elements (or an area size) in T is as large as possible.
and sub matrices N1，N2，.. Ni
Retrieve the whole matrix by selecting T elements ,
Which satisfy (in priority)
1, No two elements in T will be a neighbor in all matrix N1,..Ni
2, The total distances among elements (or an area size) in T is as large as possible.