Answer

The program plays the first moves of a game from the included "Opening Book". This is a directory of about one million opening positions in which the program finds information about how often certain opening moves have been played and how promising they are.

Furthermore, the program can store its own experiences with opening variations there - 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.07.2023

Rating

Feedback

Name *

Email Address *

Subject

Feedback *

 

retype the code *