Question

翻译~急~~~~~~~~~~

Before the cows head home for rest and recreation, Farmer John wants
them to get some intellectual stimulation by playing a game.

The game board comprises N (1 <= N <= 15) identical holes in the
ground, all of which are initially empty. A cow moves by either
covering exactly one hole with a rock, or uncovering exactly one
previously covered hole. The game state is defined by which holes
are covered with rocks and which aren't. The goal of the game is
for the cows to reach every possible game state exactly once and
then return to the state with all holes uncovered.

The cows have been having a tough time winning the game. Below is
an example of one of their games:

Holes
time 1 2 3
-----------------
0 O O O Initially all of the holes are empty
1 O O X The cow covers hole 3
2 X O X The cow covers hole 1
3 X O O The cow uncovers hole 3
4 X X O The cow covers hole 2
5 O X O The cow uncovers hole 1
6 O X X The cow covers hole 3
7 X X X The cow covers hole 1

Now the cows are stuck! They must uncover one hole and no matter
which one they uncover they will reach a state they have already
reached. For example if they remove the rock from the second hole
they will reach the state (X O X) which they already visited at
time 2.

Below is an example of a valid solution for N=3 holes:

Holes
time 1 2 3
-----------------
0 O O O Initial state: all of the holes are empty
1 O X O The cow covers hole 2
2 O X X The cow covers hole 3
3 O O X The cow uncovers hole 2
4 X O X The cow covers hole 1
5 X X X The cow covers hole 2
6 X X O The cow uncovers hole 3
7 X O O The cow uncovers hole 2
8 O O O The cow uncovers the 1st hole

which returns the game board to the start having, visited each state once.

The cows are tired of the game and want your help. Given N, create
a valid sequence of states that solves the game. If there are
multiple solutions return any one.

Answer 1

前休息和娱乐牛回家，想农民约翰
他们得到了在玩游戏，一些智力刺激。

游戏董事局成员包括N（下1“= ñ”= 15）在相同的洞
地面，所有这些都是最初是空的。由任一牛动作
完全覆盖的岩石，或暴露整整一洞
以前盖洞。游戏状态的定义，其中孔
覆盖着岩石，哪些不是。游戏的目标是
为奶牛达到一切可能的游戏状态正好一次和
然后回到国家发现的所有漏洞。

牛已经生活艰难赢得比赛。以下是
对他们的游戏一个例子：

孔
时间1 2 3
-----------------
0 OOO跟最初所有的孔是空的
1 Ø Ø包括X的牛洞3
2 × Ø X的牛涵盖孔1
3 × Ø Ø揭示的牛洞3
4 × X O的牛涵盖洞2
5直径x O的牛揭示孔1
6直径x X的牛涵盖洞3
7 × X X的牛涵盖孔1

现在，母牛坚持！他们必须发现一个洞，无论
他们发现其中一个会达到的境界，他们已经
达成。例如，如果他们删除第二洞的岩石
他们将达到国家（XOX），他们已经访问了
时间2。

下面是一对N = 3洞，有效的解决办法，例如：

孔
时间1 2 3
-----------------
0 OOO跟初始状态：所有的孔是空的
1直径x O的牛涵盖洞2
2直径x X的牛涵盖洞3
3 Ø Ø X的牛揭示孔2
4 × Ø X的牛涵盖孔1
5 X X X的牛涵盖洞2
6 × X O的牛揭示孔3
7 × Ø Ø揭示的牛洞2
8 Ø Ø Ø在牛揭露第一洞

它返回游戏板开始后，每个州的一次访问。

牛已经厌倦了游戏，并希望您的帮助。给定n，创建
一个国家有效的序列，解决了游戏。如果有
多种解决方案返回任何人。

Answer 2

Answer 3

楼上的翻译真搞笑～