A Simplified Variant of Chess for which a Short Program Computes a Non-trivial Upper Bound for the Number of Reachable Positions Obtained from 65141475298198504104226577310812726424036 Naturally Defined Initial Configurations of Pieces
Apoloniusz Tyszka · Asian Research Journal of Mathematics · 2023
We simplify the rules of chess. We assume that the initial configuration of pieces is not fixed and satisfies some general conditions. Let I denote the set of all these configurations. By our assumptions, for every C \(\in\) I, after 0 or more moves, the configuration obtained fr...
Open access
Research Article
10.9734/arjom/2023/v19i3646