A chesslike game, played on the perimeter of a circle.

Capture your opponent's Masterpiece to win.

You also win if your opponent has no legal moves.

Each turn, either:

- Move exactly one of your pieces, or
- Bring a piece into play.

Move one of your pieces from the outer ring, to the space immediately in front iof it, in the inner ring. The inner space must be empty.

There are three types of piece:

**1s**move exactly one space, along a line.**2s**move exactly two spaces, along connected lines; the first space visited must be empty. Backtracking is not allowed.**Masterpieces**move along either one or two lines.

Pieces may end in either an empty space or one occupied by an enemy piece. If the space is occupied, the enemy piece is captured.

General comments:

- Requires αβ search to play well.

Play: Combinatorial

Family: Chess

Mechanism(s): Movement,Capture

BGG Entry | Linear Pursuit |
---|---|

BGG Rating | 8.75 |

#Voters | 4 |

SD | 0.433013 |

BGG Weight | 0 |

#Voters | 0 |

Year | 2019 |

User | Rating | Comment |
---|---|---|

Observer9 | 9 | |

thenexusgame | 9 | Travel set. Really slick little abstract. Seems simple on the face of it, but is really challenging to play. Only complaint is there should be three sizes of pieces, not four (to make it easier to distinguish them from each other). |

mrraow | 8 | Attractive chesslike game with simple components. The topology is surprisingly complex for such a small board, so it takes a few games to get your head around the movement to the point where you're not making silly mistakes.. |

Geeken | N/A | 3KS 2022 |

HastingsGameStudios | 9 | An abstract concept that's easy to pick up but hard to master. Plenty of strategy and richness to the game very much like chess. |

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

Random | |||||

Rαβ + ocqBKs (t=v0.01s) | 36 | 0 | 0 | 36 | 100.00 |

Rαβ + ocqBKs (t=v0.07s) | 33 | 6 | 0 | 39 | 92.31 |

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

Size (bytes) | 24200 |
---|---|

Reference Size | 10328 |

Ratio | 2.34 |

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 | 95237.19 (10.50µs/playout) |
---|---|

Reference Size | 1645819.62 (0.61µs/playout) |

Ratio (low is good) | 17.28 |

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: White win % | 65.55±3.00 | Includes draws = 50% |
---|---|---|

2: Black win % | 34.45±2.88 | Includes draws = 50% |

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

Decisive % | 81.90 | 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.

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 | 49.04 | |
---|---|---|

Branching factor | 9.16 | |

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

Samples | 1000 | Quantity of logged games played |

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

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

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

Samples | 1000 | 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 66% of the game turns. Ai Ai found 1 critical turn (turns with only one good option).

Overall, this playout was 100.00% 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 | 5 | 6 | 7 | 8 | 9 | 10 |
---|---|---|---|---|---|---|---|---|---|---|

1 | 7 | 56 | 401 | 2762 | 17400 | 101555 | 468258 | 2013136 | 6639515 | 21932327 |

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.

2 solutions found at depth 3.

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

c1-c2,f1-f2,p1-p2,f2-l2,p2-j2,l2-p2,j2-p2,i1-i2,p2-f2,i2-c2,o1-o2 | |

p1-p2,f1-f2,c1-c2,f2-l2,p2-j2,l2-p2,j2-p2,i1-i2,p2-f2,i2-c2,o1-o2 | |

a1-a2,f1-f2,b1-b2,l1-l2,c1-c2,f2-b2,c2-l2,b2-o2,d1-d2,h1-h2 | |

a1-a2,g1-g2,c1-c2,h1-h2,a2-h2,f1-f2,o1-o2,l1-l2,d1-d2,k1-k2 | |

a1-a2,g1-g2,c1-c2,k1-k2,a2-k2,j1-j2,o1-o2,j2-p2,d1-d2,p2-b2 | |

a1-a2,g1-g2,p1-p2,g2-p2,o1-o2,l1-l2,c1-c2,f1-f2,o2-f2,l2-f2 | |

a1-a2,h1-h2,c1-c2,g1-g2,a2-h2,f1-f2,o1-o2,l1-l2,d1-d2,k1-k2 | |

a1-a2,i1-i2,o1-o2,i2-l2,d1-d2,l2-c2,b1-b2,g1-g2,a2-j2,k1-k2 | |

a1-a2,j1-j2,o1-o2,l1-l2,a2-j2,k1-k2,c1-c2,f1-f2,n1-n2,g1-g2 | |

a1-a2,j1-j2,a2-j2,k1-k2,o1-o2,l1-l2,c1-c2,f1-f2,n1-n2,g1-g2 | |

a1-a2,k1-k2,c1-c2,g1-g2,a2-k2,j1-j2,o1-o2,j2-p2,d1-d2,p2-b2 | |

a1-a2,l1-l2,b1-b2,f1-f2,c1-c2,f2-b2,c2-l2,b2-o2,d1-d2,h1-h2 |