Ascent

Ascent is a 1998 game by Gregory K. Van Patten.

Ascent is played with numbered tiles initially arranged in a diamond pattern (see starting configuration). There are four rows slanting down to the left, and four rows slanting down to the right. Also, there are seven levels (ie, the level with the "1" tile, the level with the "2" tiles, etc.).

On his turn, a player must switch two tiles from different levels, under the condition that the tile initially in the higher level has a larger number than the tile in the lower level.

• The goal of the first player is to arrange tiles in one of the four rows slanting down to the left so that the numbers form a strictly increasing sequence from the top of that row to the bottom.
• The goal of the second player is to arrange tiles in one of the four rows slanting down to the right so that the numbers form a strictly increasing sequence from the top of that row to the bottom.

Extra considerations: Passing is not allowed, so you could possibly have to make a move which achieves your opponent's object, so that you lose. If a move simultaneously achieves strictly increasing sequences from top to bottom, in both directions, then the game ends in a tie.

Here is a sample game by the author (gray pieces mean switches).

First player has just moved, and threatens to win
by switching the 2 and 3 on the lower right side. 

.Second player defends by switching the indicated 3 and 6, and can now win by switching 4 and 5. Note that if second player had tried defending
by switching 1 and 7, first player would have won immediately. 

First player switches 3 and 4, and can now win by switching 2 and 5. 

Second player switches 3 and 7, and can now win by switching 6 and 7.


First player switches 2 and 5, and can now win by switching 4 and 6. 

Second player defends by switching 5 and 7,
and can now win by switching 2 and 3. 

First player switches 2 and 3, and can now win by switching 4 and 5.

Note the [3 3 5 6] row slanting down to the right does is not a
win for second player, because it does not form a strictly
increasing sequence (it contains more than one "3" tile). 

However, the first player neglected to consider this 1,3 switch,
which results in a second player win.