Six Knights:
I’m working on a puzzle involving six knights on a 4×3 chess board represented as a matrix. The puzzle requires replacing the white knights at the bottom row with the black knights at the top row in the minimum number of knight moves, with the constraint of not allowing more than one knight on a square at any time.

I’ve attempted to solve this puzzle using an iterative improvement algorithm in Python, but I’m encountering some difficulties. Here’s a brief overview of the problem and what I’ve tried:

• The minimum number of moves required to solve the puzzle is 16.
• An efficient Python implementation of the iterative improvement algorithm to solve this puzzle.
• The algorithm should aim to minimize the number of knight moves required to achieve the objective.
• It should adhere to the constraint of not allowing more than one knight on a square at any time.

Any insights, code snippets, or guidance on how to approach this problem in Python would be greatly appreciated. Thank you!