阶梯博弈（尼姆博弈进阶）

例题

1. 问题描述：（网址：http://poj.org/problem?id=1704）

Description

Georgia and Bob decide to play a self-invented game. They draw a row of grids on paper, number the grids from left to right by 1, 2, 3, …, and place N chessmen on different grids, as shown in the following figure for example:

Georgia and Bob move the chessmen in turn. Every time a player will choose a chessman, and move it to the left without going over any other chessmen or across the left edge. The player can freely choose number of steps the chessman moves, with the constraint that the chessman must be moved at least ONE step and one grid can at most contains ONE single chessman. The player who cannot make a move loses the game.

Georgia always plays first since “Lady first”. Suppose that Georgia and Bob both do their best in the game, i.e., if one of them knows a way to win the game, he or she will be able to carry it out.

Given the initial positions of the n chessmen, can you predict who will finally win the game?
Input

The first line of the input contains a single integer T (1 <= T <= 20), the number of test cases. Then T cases follow. Each test case contains two lines. The first line consists of one integer N (1 <= N <= 1000), indicating the number of chessmen. The second line contains N different integers P1, P2 … Pn (1 <= Pi <= 10000), which are the initial positions of the n chessmen.

Output

For each test case, prints a single line, “Georgia will win”, if Georgia will win the game; “Bob will win”, if Bob will win the game; otherwise ‘Not sure’.

Sample Input

2
3
1 2 3
8
1 5 6 7 9 12 14 17
Sample Output

Bob will win
Georgia will win
Source

POJ Monthly–2004.07.18

问题的大概意思是：Bob和Georgia轮流移动棋子，并且Georgia先移动棋子，并且只能向左边移动棋子，到最后不能够移动棋子的人那么就位输。输入：第一行给出测试数据的数量，第二行给出第一组测试用例的哪些地方存在着棋子…第n组第一组测试用例的哪些地方存在着棋子

2.思路：观察题目可以知道这是Nim游戏的变体，也属于博弈的问题

虽然棋子与棋子中间存在着空格，但是在移动的过程中总是可以将其中的间隔消掉的，那么这里的间隔对题目是没有影响的：先手移动