Persistent chess analysis

About Chess-True

Chess-True is a long-term chess analysis system. It does not simply ask an engine to calculate a position once. It builds a growing tree of analyzed positions, stores the results, and uses that accumulated knowledge again and again.

The idea is simple: every strong calculation should become part of a permanent chess memory. When the system studies a position, Stockfish evaluates the possible moves, and Chess-True stores those results in a compact tree. A mini-max algorithm then propagates the best evaluations back through the tree, gradually improving the evaluation of the starting position.

Chess-True turns engine calculation into reusable knowledge: a distributed, persistent mini-max tree of the best chess continuations.

Learning from real games

Chess-True can also learn from games played by people. When PGN files are loaded, the system can process real human games, connect them with its analysis tree, and preserve useful practical experience from those positions.

This makes Chess-True more than a simple engine interface. It combines calculation with accumulated game knowledge, so positions that have appeared in real play can become part of the system's long-term chess memory.

How it works

Why it matters

Traditional analysis is temporary: once the engine stops, much of the work is lost. Chess-True is designed for cumulative analysis. Over time, the system can explore deeper variations, preserve previous effort, and offer advanced players a richer view of candidate moves and long-term plans.

The project is built for serious chess study: opening research, deep variation exploration, professional preparation, and experiments that go beyond the limits of a single machine.

Technical notes

For implementation details, storage format, and current test hardware, see the technical architecture notes.

We are open for cooperation with investors, chess professionals, developers, and researchers.

Chess-True Team: admin@chess-true.com