AtomicDB

Sign in Register
… Nc6 Bf4 Bf8 Bc1 Nh6 Ne5 fxe5 Bg5 Qf6 f4 Ng4 f5 Qxg5 Qxh5 g5 Rf1 e5 dxe5 d6 O-O-O d5 e5 g4 Rxd5 Kf7 Bc4 Kg7 f6 Kh7 e6 Bh6 Kb1 Bd2 f7 Bxe6 Bb5 Rhf8 Rf5 Be3 b3 Bg5 Bd7 Rad8 c4 Kg7 c5 Bd2 Rd5 Kf6 Kc2 Rxd7
unanalysed
Suggest name
Public, no account. An approver reviews it before it shows up.
Propose campaign
Public, no account. A campaign collects votes on the overview page; the most voted open line is the one the automatic queue works on.

lichess

visits 0 · nodes 0 · 0.0s

Moves

ⓘ state

unsolved: the move's position is open, nothing is proven yet. unexplored: open, and no engine has searched that position itself; any number it shows came from a line running through it.

WHITE_WIN, BLACK_WIN or DRAW: a proven result, followed by how it was proven: TERMINAL (the game is over on the board), MATE_PV (a mate line checked move by move), MINIMAX (from proven moves below it), TB (tablebase) or SOLVE (a full proof replayed on the server). Results are practical, see the docs.

not in tree: a legal move nobody has stepped into yet. Following it adds it.

ⓘ eval

The value of each move for the side to move here, in centipawns (100 is about one pawn). Switch the eval to Pawns in the settings to see it in pawns from White's side instead (9500 becomes 95.00, signed from White's side).

  • M3: a proven win for the side to move, mate in at most 3 moves, counting this move. -M3: a proven loss.
  • 10000: won, with no mate distance attached (-10000: lost). On an open move it is a value carried up from a move below that is already proven, before this position has closed.
  • 9501 to 9999: an engine announced a mate it has not proven: 10000 minus the number of moves to mate after this move, so 9997 is mate in 3 more moves. Negative numbers are the same for the other side.
  • 9500: an engine reported a winning score that is not a mate count, such as a tablebase win. Those scores are capped at 9500, so 9500 never means a long mate.
  • not analysed: no value yet. These rows sort just above proven losses, so a run of them can sit between the open moves and the proven losses at the bottom.

Moves sort by value only: proven wins first, proven losses last. A muted italic number, or a chip such as backed, walked or borrowed beside it, says where the number came from: hover it, or read the position page docs.

ⓘ colours

Colours are from the side to move here: proven win, proven loss, proven draw. Open moves are coloured by the size of their value, for either side: 500 or more, 200 to 499, less than 200 or no value.

ⓘ pn / dn

Proof and disproof numbers of the active proof campaign: an estimate of how much work is left to prove the campaign's goal from that move (pn) or to refute it (dn). Smaller means closer, ∞ means it can no longer be done. They are not probabilities. Empty when the campaign has no estimate for that move.

ⓘ depth

The node budget of the deepest search the move's position has had (128M, 512M, 2B), or a dash if none has reached it yet. Only searches that really ran count. Hover a cell for its visits.

ⓘ pending

Small marks in the state column. The first three mean work is already on its way for that move, so there is no need to request it again:

  • queued analysis is requested and waiting for a worker.
  • running a worker is searching it right now.
  • writing the search has finished and its result is waiting to be written into the tree; the value updates once it is.
  • unconfirmed mate or unconfirmed win a worker reported a forced mate, or a line to a tablebase win, from there that the server could not prove, from an account whose unproven lines are not used. The move stays open until it is closed another way or the line is refuted.

The marks are as of when the page loaded: reload to refresh them.

movestateevalpn / dndepth
a3not in tree--
g3not in tree--
h3not in tree--
b4not in tree--
c6not in tree--
a4not in tree--
h4not in tree--
Kd3not in tree--
Rd3not in tree--
Rd4not in tree--
Re5not in tree--
Rf5not in tree--
Rg5not in tree--
Rh5not in tree--
Rd6not in tree--
Rd7not in tree--
Rd8not in tree--
Kb1not in tree--
Kb2not in tree--
Kd1not in tree--