Knights problem: Imagine having a 4 * 3 chess board with three black and three white knights on each side. By moving one knight(white or black) each move and whitout capturing, how many move does it take to switch the positions of all white and black knights?
TdotA/Knights_problem_python
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|