Data compression using deterministic experts

As an example of a problem in which data can be described by using experts we consider the storage and transmission of chess master games. The transmission of one move in a given situation may be done by coding this move itself or transmitting the number of the expert who proposes this move. We present a stochastic model for "data compression using deterministic experts" and prove some entropy-related upper and lower bounds.