The position page

Every number on a position page says where it came from. The small chip next to a value tells you whether an engine searched that position itself or the value was carried up from somewhere else.

A position page in the explorer: the board with an arrow for the best move on the left, the header and the request button under it, and on the right the moves table with columns move, state, eval with BACKED chips, PN / DN and depth. — The start position: the board and its header on the left, the moves table on the right. Most values carry a *backed* chip; the depth column shows how much search each move has had.

What the chips mean

You see	It means
a plain number, no chip	The position's own analysis: an engine searched this position itself, and that is what it reported.
backed	The value worked out from what the moves below already know (see Backed values). The chip shows how deep the chain is. Where the chip is a link, it jumps to the position the value comes from.
walked	The same kind of value, carried up a line a visitor walked. No engine search supports it yet, and verification is queued automatically.
repetition	The line repeats a position (see Repetition); details below.
a muted, italic number with a backed chip	A number the position does not use yet (a floor): nobody has searched that move. Details below.
borrowed	A number on a move row that another position's search wrote; details below.

The repetition chip, exactly

On a move row: the value of that move comes back to the position you are looking at, so the line repeats and the move is worth no more than 0, whatever its own page claims.
In the header: the chain that leads here returns to a position it has already been through.
On a disabled row: the move would re-enter the line you are playing.

Muted, italic numbers (floors)

A muted, italic number that still carries a backed chip is a floor the position does not take. Nothing has searched that move, only some replies to it are known, and its number would beat the lines the search of the position you are looking at published. It keeps its place in the table, the board arrow passes over it, and searching the move settles it.

The borrowed chip, exactly

On a move row, a number nothing has searched and no engine line of the position you are looking at gives. Another position's search wrote it, and the chip links there.
If no other position's lines give it (an older pass of this one may have), the link lands on the move's position, marked chain breaks here.
The header and the board arrow count only searched moves and the position's own analysis, so they can disagree with it until the move is searched.
A position with no search of its own shows no such chip: every number in its table comes from elsewhere, as its header already says.

The moves table

The line under the header says what the table below is made of: how many moves an engine searched itself, how many were seeded from an engine line running through this position, and how many are queued.
Moves sort by best known value from the mover's side, and by nothing else. A value from a 2B node search sits beside one from a 128M node search, and neither is hidden behind the other.
That is why a deeply analysed value can disagree with a shallow sibling row: the two numbers were bought with very different amounts of search, and the shallow one is the one likely to move. The gap is not papered over, it is queued.

The last column, depth, says how much search that is: the node budget of the deepest search the move's position has had (requests are 128M, 512M or 2B; older 10B searches and smaller automatic ones such as 32M show too), or a dash where no search has reached it yet.

Only a search that really ran counts: a request that was closed without one, because other work got there first, does not.
Hover the cell for the number of visits.