Full Report for Desdemona by Rey Alicea

Full Report for Desdemona by Rey Alicea

Othello meets Amazons

Generated at 15/03/2021, 08:35 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!


Black moves but does not shoot on the first turn. Turns then alternate. On his turn, a player must do one of two things.

  1. Move a queen in a straight line across any number of empty squares (orthogonally or diagonally) ending the move on an empty square. Then place a stone in your opponent's color on an empty square away in a straight line across any number of empty squares (orthogonally or diagonally) from the queen that was last moved, or ...
  2. Move a queen in a straight line across any number of empty squares (orthogonally or diagonally) ending the move on an empty square adjacent to an opponent's stone. The queen and the stone now define a line (straight or diagonal). If the next square of that line, going in the direction of the opponent's stone, is vacant or the next squares hold your opponent's stones followed by an empty square, then your color stone is placed on that square, thus trapping your opponent's stones between itself and the moving queen. Captured opponent stones are replaced with the moving player's color stones.


If a player is unable to make a move he must pass, when all players pass the game ends.

The player with the most pieces on the board wins.


General comments:

Play: Combinatorial

Family: Combinatorial 2020

Mechanism(s): Territory,Movement,Stalemate

BGG Stats

BGG EntryDesdemona
BGG Rating9
BGG Weight0

BGG Ratings and Comments

coldsalmon9This game is a lot of fun. It's a hybrid that just works - I prefer it to both Amazons and Othello/Reversi. It's easy to try on Mindsports too.
reyalicea9Simply fun!

Kolomogorov Complexity Analysis

Size (bytes)26511
Reference Size10293

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.

Playout Complexity Estimate

Playouts per second13131.99 (76.15µs/playout)
Reference Size1526484.51 (0.66µs/playout)
Ratio (low is good)116.24

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.

Playout/Search Speed

LabelIts/sSDNodes/sSDGame lengthSD
Random playout12,947982,108,17016,03016312

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.

Mirroring Strategies

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.

Win % By Player (Bias)

1: Black win %50.25±3.09Includes draws = 50%
2: White win %49.75±3.09Includes draws = 50%
Draw %1.70Percentage of games where all players draw.
Decisive %98.30Percentage of games with a single winner.
Samples1000Quantity 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.

UCT Skill Chains

MatchAIStrong WinsDrawsStrong Losses#GamesStrong Scorep1 Win%Draw%p2 Win%Game Length
1UCT (its=2)616292488930.6753 <= 0.7060 <= 0.735045.583.2551.18162.60
4UCT (its=5)613353389860.6090 <= 0.6395 <= 0.668851.523.5544.93163.84
10UCT (its=11)610422909420.6392 <= 0.6699 <= 0.699146.604.4648.94163.33
25UCT (its=26)612373199680.6208 <= 0.6513 <= 0.680747.213.8248.97162.55
UCT (its=41)
0.5250 <= 0.5560 <= 0.5865
UCT (its=41)
0.4661 <= 0.4970 <= 0.5279

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.

1st Player Win Ratios by Playing Strength

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 length128.55 
Branching factor20.32 
Complexity10^133.29Based on game length and branching factor
Samples1000Quantity 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.

Move Classification

Distinct actions3041Number of distinct moves (e.g. "e4") regardless of position in game tree
Good moves529A good move is selected by the AI more than the average
Bad moves2511A bad move is selected by the AI less than the average
Terrible moves117A terrible move is never selected by the AI
Too many terrible moves to list.
Response distance3.16Mean distance between move and response; a low value relative to the board size may mean a game is tactical rather than strategic.
Samples1000Quantity of logged games played

Board Coverage

A mean of 78.78% of board locations were used per game.

Colour and size show the frequency of visits.

Game Length

Game length frequencies.


Change in Material Per Turn

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.)

Action Types per Turn

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

Position Heatmap

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

Good/Effective moves

MeasureAll playersPlayer 1Player 2
Mean % of effective moves50.1951.6848.80
Mean no. of effective moves12.7212.5612.87
Effective game space10^70.3010^34.2910^36.00
Mean % of good moves40.2913.9364.68
Mean no. of good moves9.794.8214.39
Good move game space10^59.1610^13.1210^46.04

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.

Quality Measures

Hot turns79.84%A hot turn is one where making a move is better than doing nothing.
Momentum23.26%% of turns where a player improved their score.
Correction41.09%% of turns where the score headed back towards equality.
Depth5.24%Difference in evaluation between a short and long search.
Drama1.03%How much the winner was behind before their final victory.
Foulup Factor43.41%Moves that looked better than the best move after a short search.
Surprising turns3.10%Turns that looked bad after a short search, but good after a long one.
Last lead change73.64%Distance through game when the lead changed for the last time.
Decisiveness20.16%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.)

Opening Heatmap

Colour shows the success ratio of this play over the first 10moves; black < red < yellow < white.

Size shows the frequency this move is played.

Unique Positions Reachable at Depth


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.

Shortest Game(s)

No solutions found to depth 4.



Black to win in 26 moves

Black to win in 14 moves

White to win in 16 moves

White to win in 17 moves

White to win in 13 moves

White to win in 15 moves

Black to win in 15 moves

Weak puzzle selection criteria are in place; the first move may not be unique.