Free online Chess server. Play Chess now in a clean interface. No registration, no ads, no plugin required. Play Chess with the computer, friends or random opponents.
Create a game Tournament Simultaneous exhibitions
Chess basics Puzzles Practice Coordinates Study Coaches
Lichess TV Current games Streamers Broadcasts (beta) Video library
Players Teams Forum Questions & Answers
Analysis board Opening explorer Board editor Import game Advanced search
Sign in
  1. Forum
  2. General Chess Discussion
  3. Why does SF analysis start in the end game?

I'm sure there's a very good reason for doing it "backwards," but I don't know what it is.

Stockfish analysis is better that way.

@seanysean well, I kind of figured...

It would make sense to carry the evaluation to a given position to the position one move before, then you have the move which happened in the game already analysed. Saves calculation time and of course only works backwards.

Have you ever used an engine to analyse a tough position where a good move exists but it does not find it in time, and when you input the move by hand, it finally recognize it as a good move?

When using hash, you can take the move back and it instantly remembers the good move and concentrates the current analysis around this good move.

Hash can be helpful in some situations, because it already has some informations stored about the later game stages. It has the potential to improve the effectivity of the search.

Retrograde analysis is more efficient than analyzing from start to finish. This is how chess endgame tablebase work. Chess tablebase exist for when only 6 or 7 or 8 pieces are on the board so they start with what they know for sure in the endgame. Then gradually branch out towards the beginning where they end analysis.

This topic has been archived and can no longer be replied to.