请问这道编程题目的大概意思？
We are looking for java source code implementing a solution to get allvalid setups of 2*n knights on a n x n chess board
(3 < n < 8) so that they don't attack each other.
While a clever algorithm is of course favourable the focus should be
put most on other aspects of todays professional object oriented
software development.
请问这道题目是什么意思，我不会下棋，不知看懂了的朋友能用中文或德文稍微解释一下吗，谢谢。 楼上的兄台，你真是太牛了，谢谢指点，我去网上看看有没有点实例吧。
页:
[1]