Epic Jump Chess 题意模糊,求讨论

原帖地址:一亩三分地

There’s a N*N board, two players join the jump game. Thechess could go vertically and horizontally. If the adjacent chess is opponentplayer’s and the spot beside that is empty, then the chess could jump to thatspot. One chess could not been jumped twice. Given the position of the spot onthe board, write the program to count the longest length that chess could go.

想请问这道题的具体含义,题目说的很模糊。没玩过跳棋,不懂规则。

问题1:
两个player都走棋子么? 还是只有一方在走,算咋跳;
问题2:
A方和b方有一个棋子,还是一堆,每次跳随意选择一个棋子?