An upper bound for the number of chess diagrams without promotion.

Published in: CoRR (2021)

Keyphrases

upper bound
neural network
computational complexity
real time
learning algorithm
special case
small number
branch and bound
computational effort
fixed number
maximum number