Login / Signup
An upper bound for the number of chess diagrams without promotion.
Daniel Gourion
Published in:
J. Int. Comput. Games Assoc. (2022)
Keyphrases
</>
upper bound
small number
data sets
lower bound
database
data mining
social networks
information systems
bayesian networks
multi agent systems
computational complexity
maximum number
error probability