Two players, Alice and Beatrice, having previously agreed on a positive integer N (say 30) as a limit, take turns to write a sequence of positive integers. In the first turn Alice writes 1. Thereafter, on the nth turn, whosoever turn it is, writes the previous term plus or minus n, or, if neither of these, the previous term times n, or divided by n (if the result is an integer). However, at no point must an integer in the sequence be repeated or exceed the limit agreed upon. The first player unable to play loses.
Here a game (with limit 30) won by Beatrice:
1, 3, 6, 10, 2, 8, 15, 23, 14, 4, ?
If the agreed limit is indeed 30, what is the length of the longest possible game? Shortest?
And being 30 the limit, does any of the two players have a winning strategy?
In general, what is the length of the largest and shortest possible games if the limit is N? For which N, if any, does Alice have a winning strategy?
Notice that the resulting sequences are those mentioned here: Introducing S-sequences: which is the shortest to contain all integers 1 to 20?.