On a 3x4 chess board 3 black and white knights are positioned at opposite ends.
XXX ... ... OOO
What's the minimal number of moves to swap their positions?
Write a Perl program calculating (and proving) an optimal solution and printing all intermediary steps.
Like ...
OOO .X. ... XX.
Cheers Rolf
(addicted to the Perl Programming Language and ☆☆☆☆ :)
Je suis Charlie!
Please use <spoiler> tags when posting solutions :)
In reply to [code challenge] knights move by LanX
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |