Answer

The program plays the first moves of a game from the supplied "Opening Book". This is a position tree with opening positions, not moves. The concept allows the different programs to recognize possible move changes. The program reads the information about how often certain opening moves have been played and how promising these continuations are in practice.

Another strength of this concept is also that, for example, our chess programs store there own modifications with opening variations - it learns from successes and defeats.

The opening book is also called "position tree" (for variant tree) in the program. The associated files are quite large - the program needs about 70 bytes per position.

---

Question: is there a limit to the size of the position tree apart from the hardware resources? If yes: what happens when this is reached?

Answer: At the moment the limit for the tree size is 16 TB. So far no user has managed to generate a position tree of this size. Theoretically nothing happens when the limit is reached, but this is practically untested.

Tags

ChessBase17

Fritz18

Created on

03.03.2023

Rating

Feedback

Name *

Email Address *

Subject

Feedback *

 

retype the code *