Engines and analysis

A program that analyzes a position, compares legal move sequences, and recommends options based on its calculations.

A visual application that lets users control chess software through a board, controls, and panels instead of text commands.

A chess-analysis program that runs on the user's own device and uses that machine's processor and memory.

A chess-analysis program that performs its calculations on a remote computer and returns the results over a network.

The move sequence a chess-analysis program currently considers the best continuation for both sides from a position.

An analysis mode that displays several candidate moves with a line and evaluation for each one.

An indicator of how far a chess engine's current search has progressed from the position being analyzed.

A measure of how many positions a chess engine processes per second during search.

A mode in which an engine searches while the opponent's clock runs, usually from a predicted reply.

A representation with 64 zero-or-one indicators, one per square, marking which squares belong to a chosen set.

A procedure that assigns a numerical estimate to a position so a chess program can guide its search.

A neural-network architecture designed to evaluate chess positions while updating efficiently between nearby positions.

An algorithm that chooses a move while assuming both sides will always make their best available decisions.

A method that skips branches unable to change the final choice when both sides seek their best result.

A strategy that repeats search with increasing limits so a completed result is always available.

A technique that chooses which moves to search first so unhelpful branches can be rejected sooner.

An optimization that fully searches the first candidate and initially tests later moves with a narrower check.

A technique that initially searches moves placed late in a position's analysis order at reduced depth.

A heuristic that tests a fictional pass to discard positions that appear clearly sufficient.

An extension that continues selected tactical moves until the position is stable enough to evaluate.

An error caused when a decisive consequence lies just beyond the search limit and distorts the evaluation.

A method that repeatedly explores variations and spends more analysis on moves that appear promising.

A fast calculation that estimates the material balance of successive captures and recaptures on one square.

Memory that lets a chess engine reuse results for positions it has already searched.

A method that creates a quickly updatable numerical fingerprint for the complete state of a chess position.

A test that counts every legal move sequence to an exact search depth.

A database of opening positions and moves that a chess program can consult before normal search.

A precomputed database that gives exact results for endgames within a limited number of pieces.

A compact precomputed structure that stores minimal outcome information for many endgame positions.

The exact win, draw, or loss outcome that a tablebase assigns to an endgame position.

A metric counting the distance to forced mate when the winner hastens it and the defender delays it.

A precomputed endgame metric measuring the distance to a capture or promotion, or to mate if it comes first.

A precomputed endgame metric measuring the distance to mate or to the next move that resets the fifty-move counter.