12/11/2020 – Jeroen van den Belt has already explained how the search booster came about and how it works in an interview with Frederic Friedel. But how the high-speed tool will be used in practical tests may still be unclear to some. That is why we have simply opened ChessBase 16, and let the booster work.

11/30/2020 – 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.