A simple stacking game where one player makes stacks in increasing order, the other descreasing.

At the end of the game, the player with the highest stack wins; if there is a tie, look at the second highest stack, etc.

Each turn, move a stack like a chess rook, according to the following constraints:

**High**controls stacks in strictly decreasing order from top to bottom.**Low**controls stacks in strictly increasing order from top to bottom.- Single pieces are treated as stacks which are controlled by both players.
- Each turn you must move a stack you control.
- Each move must end on stack, forming another
*stack that you control*.

- Once you make a stack of height two, your opponent cannot capture it (it would be neither increasing nor decreasing so not controlled).
- A stack cannot contain two pieces of the same colour.
- Only
*Low*can move the 1. - Only
*High*can move the highest number.

In *Sudden Death* mode, a player wins as soon as they make a stack of maximum height.

This started off as a game where the players were trying to assemble rainbows, either forwards or backwards.

This was very confusing, so I added numbers.

Then I realised that the colours weren't necessary, and the game wasn't limited to a 7x7 board.

That's the way game design goes sometimes; I left the colours in the Ai Ai implementation for sentimental reasons; but you could play with number or letter tiles if so inclined.

General comments:

- Has random setup.

Play: Combinatorial,Random Setup

Mechanism(s): Scoring,Stacking

Components: Board

BGG Entry | Low vs High |
---|---|

BGG Rating | null |

#Voters | null |

SD | null |

BGG Weight | null |

#Voters | null |

Year | null |

AI | Wins vs prev level | Draws | Losses | #Games | Win% |
---|---|---|---|---|---|

Random | |||||

Grand Unified UCT(U1-T,rSel=u, secs=0.01) | 36 | 0 | 0 | 36 | 100.00 |

Grand Unified UCT(U1-T,rSel=u, secs=0.07) | 36 | 0 | 5 | 41 | 87.80 |

Grand Unified UCT(U1-T,rSel=u, secs=0.20) | 35 | 2 | 13 | 50 | 72.00 |

Grand Unified UCT(U1-T,rSel=u, secs=1.48) | 36 | 0 | 10 | 46 | 78.26 |

Level of Play: **strong** beats **weak** 60% of the time (lower bound with 90% confidence).

Size (bytes) | 28734 |
---|---|

Reference Size | 10328 |

Ratio | 2.78 |

Ai Ai calculates the size of the implementation, and compares it to the Ai Ai implementation of the simplest possible game (which just fills the board). Note that this estimate may include some graphics and heuristics code as well as the game logic. See the wikipedia entry for more details.

Playouts per second | 20590.07 (48.57µs/playout) |
---|---|

Reference Size | 545970.74 (1.83µs/playout) |

Ratio (low is good) | 26.52 |

Tavener complexity: the heat generated by playing every possible instance of a game with a perfectly efficient programme. Since this is not possible to calculate, Ai Ai calculates the number of random playouts per second and compares it to the fastest non-trivial Ai Ai game (Connect 4). This ratio gives a practical indication of how complex the game is. Combine this with the computational state space, and you can get an idea of how strong the default (MCTS-based) AI will be.

1: Player 1 (Low) win % | 56.22±0.34 | Includes draws = 50% |
---|---|---|

2: Player 2 (High) win % | 43.78±0.34 | Includes draws = 50% |

Draw % | 0.49 | Percentage of games where all players draw. |

Decisive % | 99.51 | Percentage of games with a single winner. |

Samples | 80658 | Quantity of logged games played |

Note: that win/loss statistics may vary depending on thinking time (horizon effect, etc.), bad heuristics, bugs, and other factors, so should be taken with a pinch of salt. (Given perfect play, any game of pure skill will always end in the same result.)

Note: Ai Ai differentiates between states where all players draw or win or lose; this is mostly to support cooperative games.

Rotation (Half turn) lost each game as expected.

Reflection (X axis) lost each game as expected.

Reflection (Y axis) lost each game as expected.

Copy last move lost each game as expected.

Mirroring strategies attempt to copy the previous move. On first move, they will attempt to play in the centre. If neither of these are possible, they will pick a random move. Each entry represents a different form of copying; direct copy, reflection in either the X or Y axis, half-turn rotation.

Game length | 36.04 | |
---|---|---|

Branching factor | 27.89 | |

Complexity | 10^41.03 | Based on game length and branching factor |

Computational Complexity | 10^8.48 | Sample quality (100 best): 15.15 |

Samples | 80658 | Quantity of logged games played |

Distinct actions | 590 | Number of distinct moves (e.g. "e4") regardless of position in game tree |
---|---|---|

Good moves | 420 | A good move is selected by the AI more than the average |

Bad moves | 169 | A bad move is selected by the AI less than the average |

Samples | 80658 | Quantity of logged games played |

This chart is based on a single playout, and gives a feel for the change in material over the course of a game.

This chart shows the best move value with respect to the active player; the orange line represents the value of doing nothing (null move).

The lead changed on 8% of the game turns. Ai Ai found 2 critical turns (turns with only one good option).

Overall, this playout was 70.59% hot.

This chart shows the relative temperature of all moves each turn. Colour range: black (worst), red, orange(even), yellow, white(best).

Table: branching factor per turn.

This chart is based on a single playout, and gives a feel for the types of moves available over the course of a game.

Red: removal, Black: move, Blue: Add, Grey: pass, Purple: swap sides, Brown: other.

0 | 1 | 2 | 3 | 4 |
---|---|---|---|---|

1 | 76 | 5135 | 140022 | 4541530 |

Note: most games do not take board rotation and reflection into consideration.

Multi-part turns could be treated as the same or different depth depending on the implementation.

Counts to depth N include all moves reachable at lower depths.

Inaccuracies may also exist due to hash collisions, but Ai Ai uses 64-bit hashes so these will be a very small fraction of a percentage point.

No solutions found to depth 4.

Moves | Animation |
---|---|

b4-b5,Swap,e2-d2,c6-c5,b3-b2,b6-b5,c1-c2,a5-b5,b2-c2,c5-b5 | |

c6-c5,Swap,e2-d2,b4-b5,b3-b2,b6-b5,c1-c2,a5-b5,b2-c2,c5-b5 | |

g3-g4,Swap,e2-d2,g4-g2,b1-b2,g2-g1,c1-c2,g1-g5,b3-b2 | |

b4-b5,Swap,e2-d2,c6-c5,b3-b2,b6-b5,c1-c2,a5-b5,b2-c2 | |

c6-c5,Swap,e2-d2,b4-b5,b3-b2,b6-b5,c1-c2,a5-b5,b2-c2 | |

g3-g4,Swap,e2-d2,g4-g2,b1-b2,g2-g1,c1-c2,g1-g5 | |

b4-b5,Swap,e2-d2,c6-c5,b3-b2,b6-b5,c1-c2,a5-b5 | |

c6-c5,Swap,e2-d2,b4-b5,b3-b2,b6-b5,c1-c2,a5-b5 | |

b4-b5,Swap,c1-c2,c4-c5,e2-d2,b2-b1,b3-c3,b6-b5 | |

b4-b5,Swap,c1-c2,c6-c5,e2-d2,b2-b1,c3-c2,b3-b5 | |

b4-b5,Swap,e2-d2,b2-b1,c1-c2,c4-c5,b3-c3,b6-b5 | |

b4-b5,Swap,e2-d2,b2-b1,c1-c2,c6-c5,c3-c2,b3-b5 |

Puzzle | Solution |
---|---|

Player 2 (High) to win in 13 moves | |

Player 1 (High) to win in 13 moves | |

Player 2 (Low) to win in 11 moves | |

Player 2 (High) to win in 9 moves | |

Player 2 (Low) to win in 7 moves | |

Player 1 (High) to win in 5 moves | |

Player 1 (High) to win in 7 moves | |

Player 2 (High) to win in 8 moves | |

Player 1 (High) to win in 7 moves | |

Player 2 (Low) to win in 5 moves | |

Player 2 (High) to win in 5 moves | |

Player 1 (High) to win in 3 moves |

Selection criteria: first move must be unique, and not forced to avoid losing. Beyond that, Puzzles will be rated by the product of [total move]/[best moves] at each step, and the best puzzles selected.