Article
The preposterously fast ChessBase search booster
Rating:
0.0
Views:
35
Likes:
1
Library:
1
Our new database program, ChessBase 16 has, as you know, a blindingly fast search. If you ask the program whether, and how often, a particular position has occurred in a collection of eight million games, and which were the moves played in that position, with what success, then you get an answer in less than one second! How is this possible? The author of this search booster function is Jeroen van den Belt, and he explains how he implemented the new search booster.
Rate This Post
-
Education
-
Communication
-
Entertainment
Rate The Educational Value
Rate The Ease of Understanding and Presentation
Interesting or Boring? Rate the Entertainment Value