Minimum Moves to Get a Peaceful Board

Given an n×n board with some occupied cells, compute the minimum number of single-piece moves needed to rearrange pieces so the board becomes "peaceful" (no two pieces conflict, e.g., attack or are adjacent). The core challenge is modeling conflicts between positions and finding an optimal reassignment of pieces to target cells — typically solved by greedy placement, bipartite matching or flow on a conflict graph.