Generated at 2023-06-20, 10:59 from 1000 logged games.
Representative game (in the sense of being of mean length). Wherever you see the 'representative game' referred to in later sections, this is it!
The first player to move a stone to the center wins!
Each turn, move a stone along a line in a single direction as far as possible, stopping only at an edge or another stone.
After the first player moves, the second player has the option to become the first player and take that move as his own.
General comments:
Play: Combinatorial
Family: Combinatorial 2022
Mechanism(s): Race
Components: Board
| BGG Entry | Slidesone |
|---|---|
| BGG Rating | null |
| #Voters | null |
| SD | null |
| BGG Weight | null |
| #Voters | null |
| Year | null |
| Size (bytes) | 27323 |
|---|---|
| Reference Size | 10673 |
| Ratio | 2.56 |
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 | 7.65 (130743.86µs/playout) |
|---|---|
| Reference Size | 584009.81 (1.71µs/playout) |
| Ratio (low is good) | 76355.70 |
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.
Not enough data for an accurate prediction, or game does not support hashing
State space complexity (where present) is an estimate of the number of distinct game tree reachable through actual play. Over a series of random games, Ai Ai checks each position to see if it is new, or a repeat of a previous position and keeps a total for each game. As the number of games increase, the quantity of new positions seen per game decreases. These games are then partitioned into a number of buckets, and if certain conditions are met, Ai Ai treats the number in each bucket as the start of a strictly decreasing geometric sequence and sums it to estimate the total state space. The accuracy is calculated as 1-[end bucket count]/[starting bucklet count]
| Label | Its/s | SD | Nodes/s | SD | Game length | SD |
|---|---|---|---|---|---|---|
| Random playout | 2,417 | 9 | 2,412,708 | 9,003 | 998 | 35 |
| search.UCT | 95,406 | 1,486 | 131 | 141 | ||
| search.AlphaBeta | 410,984 | 53,942 | 80 | 136 |
Random: 10 second warmup for the hotspot compiler. 100 trials of 1000ms each.
Other: 100 playouts, means calculated over the first 5 moves only to avoid distortion due to speedup at end of game.
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.
This chart shows the heuristic values thoughout a single representative* game. The orange line shows the difference between player scores. (* Representative, in the sense that it is close to the mean game length.)
| 1: White win % | 38.00±2.96 | Includes draws = 50% |
|---|---|---|
| 2: Black win % | 62.00±3.05 | Includes draws = 50% |
| Draw % | 0.00 | Percentage of games where all players draw. |
| Decisive % | 100.00 | Percentage of games with a single winner. |
| Samples | 1000 | 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.
| Match | AI | Strong Wins | Draws | Strong Losses | #Games | Strong Score | p1 Win% | Draw% | p2 Win% | Game Length |
|---|---|---|---|---|---|---|---|---|---|---|
| 0 | Random | |||||||||
| 1 | UCT (its=2) | 631 | 0 | 300 | 931 | 0.6471 <= 0.6778 <= 0.7070 | 51.02 | 0.00 | 48.98 | 217292.16 |
| 2 | UCT (its=2) | 472 | 0 | 528 | 1000 | 0.4412 <= 0.4720 <= 0.5030 | 51.60 | 0.00 | 48.40 | 164551.72 |
Search for levels ended: time limit reached.
Level of Play: Strong beats Weak 60% of the time (lower bound with 95% confidence).
Draw%, p1 win% and game length may give some indication of trends as AI strength increases.
This chart shows the win(green)/draw(black)/loss(red) percentages, as UCT play strength increases. Note that for most games, the top playing strength show here will be distinctly below human standard.
| Game length | 41.35 | |
|---|---|---|
| Branching factor | 25.51 | |
| Complexity | 10^57.73 | Based on game length and branching factor |
| Computational Complexity | 10^5.76 | Sample quality (100 best): 52.12 |
| Samples | 1000 | Quantity of logged games played |
Computational complexity (where present) is an estimate of the game tree reachable through actual play. For each game in turn, Ai Ai marks the positions reached in a hashtable, then counts the number of new moves added to the table. Once all moves are applied, it treats this sequence as a geometric progression and calculates the sum as n-> infinity.
| Board Size | 85 | Quantity of distinct board cells |
|---|---|---|
| Distinct actions | 1805 | Quantity of distinct moves (e.g. "e4") regardless of position in game tree |
| Killer moves | 78 | A 'killer' move is selected by the AI more than 50% of the time Too many killers to list. |
| Good moves | 1092 | A good move is selected by the AI more than the average |
| Bad moves | 713 | A bad move is selected by the AI less than the average |
| Terrible moves | 160 | A terrible move is never selected by the AI Too many terrible moves to list. |
| Response distance% | 42.43% | Distance from move to response / maximum board distance; a low value suggests a game is tactical rather than strategic. |
| Samples | 1000 | Quantity of logged games played |
A mean of 45.98% of board locations were used per game.
Colour and size show the frequency of visits.
Game length frequencies.
| Mean | 41.35 |
|---|---|
| Mode | [23] |
| Median | 32.0 |
| Mean change in material/round | 0.00 | Complete round of play (all players) |
|---|
This chart is based on a single representative* playout, and gives a feel for the change in material over the course of a game. (* Representative in the sense that it is close to the mean length.)
Table: branching factor per turn, based on a single representative* game. (* Representative in the sense that it is close to the mean game length.)
This chart is based on a single representative* game, and gives a feel for the types of moves available throughout that game. (* Representative in the sense that it is close to the mean game length.)
Red: removal, Black: move, Blue: Add, Grey: pass, Purple: swap sides, Brown: other.
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 31% of the game turns. Ai Ai found 9 critical turns (turns with only one good option).
This chart shows the relative temperature of all moves each turn. Colour range: black (worst), red, orange(even), yellow, white(best).
| Measure | All players | Player 1 | Player 2 |
|---|---|---|---|
| Mean % of effective moves | 63.49 | 63.50 | 63.48 |
| Mean no. of effective moves | 15.49 | 15.81 | 15.15 |
| Effective game space | 10^40.79 | 10^20.32 | 10^20.47 |
| Mean % of good moves | 16.13 | 7.41 | 25.28 |
| Mean no. of good moves | 3.98 | 1.81 | 6.25 |
| Good move game space | 10^13.97 | 10^3.04 | 10^10.93 |
These figures were calculated over a single game.
An effective move is one with score 0.1 of the best move (including the best move). -1 (loss) <= score <= 1 (win)
A good move has a score > 0. Note that when there are no good moves, an multiplier of 1 is used for the game space calculation.
| Measure | Value | Description |
|---|---|---|
| Hot turns | 60.98% | A hot turn is one where making a move is better than doing nothing. |
| Momentum | 2.44% | % of turns where a player improved their score. |
| Correction | 29.27% | % of turns where the score headed back towards equality. |
| Depth | 9.07% | Difference in evaluation between a short and long search. |
| Drama | 6.84% | How much the winner was behind before their final victory. |
| Foulup Factor | 68.29% | Moves that looked better than the best move after a short search. |
| Surprising turns | 2.44% | Turns that looked bad after a short search, but good after a long one. |
| Last lead change | 87.80% | Distance through game when the lead changed for the last time. |
| Decisiveness | 60.98% | Distance from the result being known to the end of the game. |
These figures were calculated over a single representative* game, and based on the measures of quality described in "Automatic Generation and Evaluation of Recombination Games" (Cameron Browne, 2007). (* Representative, in the sense that it is close to the mean game length.)
Colour shows the frequency of swaps on turn 2 if this move is played on turn 1; black < red < yellow < white.
Based on 100 trials/move at 0.1s thinking time each.
| Moves | Animation |
|---|---|
| g2-g8,Swap,i7-i3,c5-c9,h8-h3,c9-h4,e10-e4,d4-d9,e4-c4,e3-d3 |  |
| g2-g8,Swap,i7-i3,c5-c9,h8-h3,c9-h4,e10-e4,d4-d9,d10-d11,h2-h1 |  |
| g2-g8,Swap,i7-i3,c5-c9,d10-d5,h2-h7,e10-f9,d4-k4,g9-e11,e3-e10 |  |
| g2-g8,Swap,i7-i3,c5-c9,e10-e4,d4-d9,h8-k5,c9-h4,g9-j6,h2-a9 |  |
| h2-h7,Swap,i7-i3,c5-c9,d10-d5,e3-h3,g9-d9,h3-h6,e10-g8,g2-g7 |  |
| h2-h7,Swap,i7-i3,c5-c9,d10-d5,e3-h3,c10-c11,g2-g8,g9-d9,h3-h6 |  |
| h2-h7,Swap,i7-i3,c5-c9,d10-d5,e3-h3,c10-c11,h3-h6,g9-g3,d4-a7 |  |
| h2-h7,Swap,c10-c6,i2-i6,e10-e4,d4-d9,g9-g3,i6-d6,g3-f3,d9-d7 |  |
| h2-h7,Swap,c10-c6,i2-i6,e10-e4,d4-d9,g9-g3,i6-d6,e4-f3,d9-d7 |  |
| d4-d9,Swap,i7-i3,c5-c9,g9-g3,h2-h7,e10-e4,c9-h4,e4-f3,e3-d3 |  |
| d4-d9,Swap,i7-i3,c5-c9,g9-g3,h2-h7,e10-e4,c9-h4,d10-d11,h7-h5 |  |
| d4-d9,Swap,c10-c6,i2-i6,h8-h3,g2-d5,i7-i8,e3-e9,e10-h7,d5-d8 |  |
Colour shows the success ratio of this play over the first 10moves; black < red < yellow < white.
Size shows the frequency this move is played.
Colour shows the frequency of swaps on turn 2 if this move is played on turn 1; black < red < yellow < white.
Size shows the frequency this move is played.
| 0 | 1 | 2 | 3 | 4 | 5 | 6 |
|---|---|---|---|---|---|---|
| 1 | 28 | 830 | 14626 | 201478 | 440214 | 2548387 |
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.
1 solutions found - search incomplete.
| Puzzle | Solution |
|---|---|
 White to win in 7 moves | |
 Black to win in 5 moves | |
 Black to win in 7 moves | |
 White to win in 5 moves | |
 Black to win in 5 moves | |
 White to win in 5 moves | |
 Black to win in 5 moves | |
 White to win in 5 moves | |
 Black to win in 5 moves | |
 Black to win in 5 moves | |
 White to win in 5 moves | |
 White to win in 5 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.
